/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi007_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 03:14:48,009 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 03:14:48,011 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 03:14:48,023 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 03:14:48,024 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 03:14:48,025 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 03:14:48,026 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 03:14:48,028 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 03:14:48,030 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 03:14:48,031 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 03:14:48,032 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 03:14:48,033 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 03:14:48,033 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 03:14:48,034 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 03:14:48,035 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 03:14:48,036 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 03:14:48,037 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 03:14:48,038 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 03:14:48,040 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 03:14:48,042 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 03:14:48,044 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 03:14:48,045 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 03:14:48,046 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 03:14:48,047 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 03:14:48,049 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 03:14:48,050 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 03:14:48,050 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 03:14:48,051 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 03:14:48,051 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 03:14:48,052 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 03:14:48,052 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 03:14:48,053 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 03:14:48,054 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 03:14:48,055 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 03:14:48,056 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 03:14:48,056 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 03:14:48,057 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 03:14:48,057 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 03:14:48,057 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 03:14:48,058 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 03:14:48,059 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 03:14:48,060 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-27 03:14:48,074 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 03:14:48,074 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 03:14:48,076 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 03:14:48,076 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 03:14:48,076 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 03:14:48,076 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 03:14:48,076 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 03:14:48,077 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 03:14:48,077 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 03:14:48,077 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 03:14:48,077 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 03:14:48,078 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 03:14:48,078 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 03:14:48,078 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 03:14:48,078 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 03:14:48,078 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 03:14:48,078 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 03:14:48,079 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 03:14:48,079 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 03:14:48,079 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 03:14:48,079 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 03:14:48,080 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 03:14:48,080 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 03:14:48,080 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 03:14:48,080 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 03:14:48,080 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 03:14:48,081 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 03:14:48,081 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 03:14:48,081 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 03:14:48,375 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 03:14:48,388 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 03:14:48,390 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 03:14:48,392 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 03:14:48,392 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 03:14:48,393 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi007_pso.opt.i [2019-12-27 03:14:48,463 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b0473f3d/530686fffc2f467dbca489c82b0ed393/FLAG66c3c8dc3 [2019-12-27 03:14:49,049 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 03:14:49,050 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi007_pso.opt.i [2019-12-27 03:14:49,064 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b0473f3d/530686fffc2f467dbca489c82b0ed393/FLAG66c3c8dc3 [2019-12-27 03:14:49,297 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b0473f3d/530686fffc2f467dbca489c82b0ed393 [2019-12-27 03:14:49,308 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 03:14:49,310 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 03:14:49,311 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 03:14:49,311 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 03:14:49,315 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 03:14:49,316 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:14:49" (1/1) ... [2019-12-27 03:14:49,320 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39dfbf39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:14:49, skipping insertion in model container [2019-12-27 03:14:49,321 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:14:49" (1/1) ... [2019-12-27 03:14:49,329 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 03:14:49,390 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 03:14:49,961 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 03:14:49,974 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 03:14:50,035 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 03:14:50,124 INFO L208 MainTranslator]: Completed translation [2019-12-27 03:14:50,125 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:14:50 WrapperNode [2019-12-27 03:14:50,125 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 03:14:50,126 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 03:14:50,126 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 03:14:50,126 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 03:14:50,135 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:14:50" (1/1) ... [2019-12-27 03:14:50,155 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:14:50" (1/1) ... [2019-12-27 03:14:50,185 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 03:14:50,185 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 03:14:50,186 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 03:14:50,186 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 03:14:50,195 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:14:50" (1/1) ... [2019-12-27 03:14:50,195 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:14:50" (1/1) ... [2019-12-27 03:14:50,201 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:14:50" (1/1) ... [2019-12-27 03:14:50,201 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:14:50" (1/1) ... [2019-12-27 03:14:50,224 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:14:50" (1/1) ... [2019-12-27 03:14:50,228 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:14:50" (1/1) ... [2019-12-27 03:14:50,232 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:14:50" (1/1) ... [2019-12-27 03:14:50,237 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 03:14:50,238 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 03:14:50,238 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 03:14:50,238 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 03:14:50,239 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:14:50" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 03:14:50,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 03:14:50,299 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 03:14:50,299 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 03:14:50,299 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 03:14:50,299 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 03:14:50,299 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 03:14:50,300 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 03:14:50,300 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 03:14:50,300 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 03:14:50,300 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 03:14:50,301 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 03:14:50,303 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 03:14:51,015 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 03:14:51,016 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 03:14:51,017 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:14:51 BoogieIcfgContainer [2019-12-27 03:14:51,018 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 03:14:51,020 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 03:14:51,020 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 03:14:51,025 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 03:14:51,026 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 03:14:49" (1/3) ... [2019-12-27 03:14:51,027 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fb4bb7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:14:51, skipping insertion in model container [2019-12-27 03:14:51,027 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:14:50" (2/3) ... [2019-12-27 03:14:51,028 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fb4bb7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:14:51, skipping insertion in model container [2019-12-27 03:14:51,028 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:14:51" (3/3) ... [2019-12-27 03:14:51,033 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi007_pso.opt.i [2019-12-27 03:14:51,042 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 03:14:51,042 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 03:14:51,050 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 03:14:51,051 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 03:14:51,089 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,089 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,089 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,090 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,090 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,090 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,091 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,091 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,092 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,092 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,092 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,093 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,093 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,093 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,094 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,094 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,094 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,094 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,095 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,095 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,095 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,096 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,096 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,096 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,096 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,097 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,097 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,097 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,097 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,098 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,098 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,098 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,098 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,099 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,101 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,101 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,109 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,109 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,109 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,109 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,110 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,110 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,110 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,110 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,110 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,111 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,111 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,111 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,112 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,112 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,112 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,112 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,113 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,113 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,113 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,113 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,113 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,114 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,114 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,114 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,115 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,115 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,115 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,115 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,115 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,116 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,116 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,116 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,116 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,117 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,117 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,117 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,117 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,118 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,118 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,118 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,118 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,119 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,119 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,119 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,119 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,120 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,120 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,120 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,121 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,121 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,121 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,121 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,121 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,122 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,122 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,122 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,122 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,123 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,123 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,123 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,123 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,124 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,124 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,124 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,124 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,126 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,126 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,126 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,126 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,127 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,127 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,127 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,127 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,127 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,128 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,128 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,128 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,128 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,129 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,133 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,133 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,133 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,134 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,134 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,134 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,134 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,135 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,135 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,135 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,135 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,135 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,140 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,140 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,140 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,141 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,141 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,141 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,141 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,141 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,142 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,142 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,142 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,142 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,143 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,143 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,145 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,163 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:14:51,182 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 03:14:51,210 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 03:14:51,210 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 03:14:51,210 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 03:14:51,211 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 03:14:51,211 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 03:14:51,211 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 03:14:51,211 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 03:14:51,211 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 03:14:51,235 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 181 transitions [2019-12-27 03:14:51,237 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-27 03:14:51,343 INFO L132 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-27 03:14:51,344 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 03:14:51,357 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 341 event pairs. 0/136 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 03:14:51,376 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-27 03:14:51,420 INFO L132 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-27 03:14:51,420 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 03:14:51,426 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 341 event pairs. 0/136 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 03:14:51,440 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-27 03:14:51,441 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 03:14:56,234 WARN L192 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-27 03:14:56,341 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-27 03:14:56,718 INFO L206 etLargeBlockEncoding]: Checked pairs total: 76691 [2019-12-27 03:14:56,718 INFO L214 etLargeBlockEncoding]: Total number of compositions: 108 [2019-12-27 03:14:56,722 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 79 places, 90 transitions [2019-12-27 03:14:57,278 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 9438 states. [2019-12-27 03:14:57,281 INFO L276 IsEmpty]: Start isEmpty. Operand 9438 states. [2019-12-27 03:14:57,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 03:14:57,287 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:14:57,288 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 03:14:57,288 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:14:57,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:14:57,295 INFO L82 PathProgramCache]: Analyzing trace with hash 790297, now seen corresponding path program 1 times [2019-12-27 03:14:57,305 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:14:57,306 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283513140] [2019-12-27 03:14:57,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:14:57,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:14:57,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:14:57,539 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283513140] [2019-12-27 03:14:57,540 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:14:57,540 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 03:14:57,541 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149172867] [2019-12-27 03:14:57,549 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:14:57,550 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:14:57,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:14:57,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:14:57,563 INFO L87 Difference]: Start difference. First operand 9438 states. Second operand 3 states. [2019-12-27 03:14:57,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:14:57,851 INFO L93 Difference]: Finished difference Result 9266 states and 29920 transitions. [2019-12-27 03:14:57,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:14:57,854 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 03:14:57,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:14:58,036 INFO L225 Difference]: With dead ends: 9266 [2019-12-27 03:14:58,037 INFO L226 Difference]: Without dead ends: 8258 [2019-12-27 03:14:58,038 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:14:58,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8258 states. [2019-12-27 03:14:58,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8258 to 8258. [2019-12-27 03:14:58,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8258 states. [2019-12-27 03:14:58,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8258 states to 8258 states and 26572 transitions. [2019-12-27 03:14:58,456 INFO L78 Accepts]: Start accepts. Automaton has 8258 states and 26572 transitions. Word has length 3 [2019-12-27 03:14:58,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:14:58,457 INFO L462 AbstractCegarLoop]: Abstraction has 8258 states and 26572 transitions. [2019-12-27 03:14:58,457 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:14:58,457 INFO L276 IsEmpty]: Start isEmpty. Operand 8258 states and 26572 transitions. [2019-12-27 03:14:58,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 03:14:58,460 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:14:58,461 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:14:58,461 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:14:58,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:14:58,462 INFO L82 PathProgramCache]: Analyzing trace with hash 316025548, now seen corresponding path program 1 times [2019-12-27 03:14:58,462 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:14:58,462 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556990121] [2019-12-27 03:14:58,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:14:58,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:14:58,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:14:58,651 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556990121] [2019-12-27 03:14:58,651 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:14:58,653 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:14:58,653 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545575384] [2019-12-27 03:14:58,654 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:14:58,655 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:14:58,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:14:58,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:14:58,656 INFO L87 Difference]: Start difference. First operand 8258 states and 26572 transitions. Second operand 4 states. [2019-12-27 03:14:59,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:14:59,178 INFO L93 Difference]: Finished difference Result 12603 states and 38772 transitions. [2019-12-27 03:14:59,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 03:14:59,179 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 03:14:59,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:14:59,252 INFO L225 Difference]: With dead ends: 12603 [2019-12-27 03:14:59,252 INFO L226 Difference]: Without dead ends: 12589 [2019-12-27 03:14:59,253 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:14:59,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12589 states. [2019-12-27 03:15:00,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12589 to 11299. [2019-12-27 03:15:00,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11299 states. [2019-12-27 03:15:00,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11299 states to 11299 states and 35365 transitions. [2019-12-27 03:15:00,249 INFO L78 Accepts]: Start accepts. Automaton has 11299 states and 35365 transitions. Word has length 11 [2019-12-27 03:15:00,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:15:00,250 INFO L462 AbstractCegarLoop]: Abstraction has 11299 states and 35365 transitions. [2019-12-27 03:15:00,250 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:15:00,250 INFO L276 IsEmpty]: Start isEmpty. Operand 11299 states and 35365 transitions. [2019-12-27 03:15:00,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 03:15:00,255 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:15:00,255 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:15:00,255 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:15:00,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:15:00,256 INFO L82 PathProgramCache]: Analyzing trace with hash -1209477957, now seen corresponding path program 1 times [2019-12-27 03:15:00,256 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:15:00,256 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153513603] [2019-12-27 03:15:00,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:15:00,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:15:00,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:15:00,381 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153513603] [2019-12-27 03:15:00,381 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:15:00,381 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:15:00,382 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507123595] [2019-12-27 03:15:00,382 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:15:00,382 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:15:00,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:15:00,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:15:00,383 INFO L87 Difference]: Start difference. First operand 11299 states and 35365 transitions. Second operand 4 states. [2019-12-27 03:15:00,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:15:00,646 INFO L93 Difference]: Finished difference Result 13736 states and 42816 transitions. [2019-12-27 03:15:00,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 03:15:00,647 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 03:15:00,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:15:00,697 INFO L225 Difference]: With dead ends: 13736 [2019-12-27 03:15:00,697 INFO L226 Difference]: Without dead ends: 13736 [2019-12-27 03:15:00,698 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:15:00,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13736 states. [2019-12-27 03:15:01,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13736 to 12234. [2019-12-27 03:15:01,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12234 states. [2019-12-27 03:15:01,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12234 states to 12234 states and 38359 transitions. [2019-12-27 03:15:01,218 INFO L78 Accepts]: Start accepts. Automaton has 12234 states and 38359 transitions. Word has length 14 [2019-12-27 03:15:01,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:15:01,219 INFO L462 AbstractCegarLoop]: Abstraction has 12234 states and 38359 transitions. [2019-12-27 03:15:01,219 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:15:01,219 INFO L276 IsEmpty]: Start isEmpty. Operand 12234 states and 38359 transitions. [2019-12-27 03:15:01,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 03:15:01,223 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:15:01,223 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:15:01,223 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:15:01,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:15:01,224 INFO L82 PathProgramCache]: Analyzing trace with hash -572907870, now seen corresponding path program 1 times [2019-12-27 03:15:01,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:15:01,224 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893673821] [2019-12-27 03:15:01,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:15:01,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:15:01,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:15:01,278 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893673821] [2019-12-27 03:15:01,278 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:15:01,278 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 03:15:01,279 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526903845] [2019-12-27 03:15:01,280 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:15:01,280 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:15:01,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:15:01,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:15:01,281 INFO L87 Difference]: Start difference. First operand 12234 states and 38359 transitions. Second operand 3 states. [2019-12-27 03:15:01,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:15:01,343 INFO L93 Difference]: Finished difference Result 12209 states and 38285 transitions. [2019-12-27 03:15:01,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:15:01,343 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-27 03:15:01,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:15:01,387 INFO L225 Difference]: With dead ends: 12209 [2019-12-27 03:15:01,389 INFO L226 Difference]: Without dead ends: 12209 [2019-12-27 03:15:01,389 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:15:01,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12209 states. [2019-12-27 03:15:01,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12209 to 12209. [2019-12-27 03:15:01,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12209 states. [2019-12-27 03:15:01,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12209 states to 12209 states and 38285 transitions. [2019-12-27 03:15:01,735 INFO L78 Accepts]: Start accepts. Automaton has 12209 states and 38285 transitions. Word has length 16 [2019-12-27 03:15:01,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:15:01,736 INFO L462 AbstractCegarLoop]: Abstraction has 12209 states and 38285 transitions. [2019-12-27 03:15:01,736 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:15:01,736 INFO L276 IsEmpty]: Start isEmpty. Operand 12209 states and 38285 transitions. [2019-12-27 03:15:01,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 03:15:01,741 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:15:01,741 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:15:01,742 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:15:01,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:15:01,742 INFO L82 PathProgramCache]: Analyzing trace with hash -574911552, now seen corresponding path program 1 times [2019-12-27 03:15:01,742 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:15:01,743 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328770101] [2019-12-27 03:15:01,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:15:01,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:15:01,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:15:01,807 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328770101] [2019-12-27 03:15:01,807 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:15:01,807 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:15:01,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115333650] [2019-12-27 03:15:01,808 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:15:01,808 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:15:01,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:15:01,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:15:01,809 INFO L87 Difference]: Start difference. First operand 12209 states and 38285 transitions. Second operand 4 states. [2019-12-27 03:15:01,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:15:01,849 INFO L93 Difference]: Finished difference Result 2335 states and 5845 transitions. [2019-12-27 03:15:01,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 03:15:01,849 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-27 03:15:01,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:15:01,853 INFO L225 Difference]: With dead ends: 2335 [2019-12-27 03:15:01,854 INFO L226 Difference]: Without dead ends: 1651 [2019-12-27 03:15:01,854 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:15:01,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1651 states. [2019-12-27 03:15:01,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1651 to 1635. [2019-12-27 03:15:01,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1635 states. [2019-12-27 03:15:01,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1635 states to 1635 states and 3657 transitions. [2019-12-27 03:15:01,997 INFO L78 Accepts]: Start accepts. Automaton has 1635 states and 3657 transitions. Word has length 17 [2019-12-27 03:15:01,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:15:01,997 INFO L462 AbstractCegarLoop]: Abstraction has 1635 states and 3657 transitions. [2019-12-27 03:15:01,997 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:15:01,997 INFO L276 IsEmpty]: Start isEmpty. Operand 1635 states and 3657 transitions. [2019-12-27 03:15:01,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 03:15:01,999 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:15:02,000 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:15:02,000 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:15:02,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:15:02,001 INFO L82 PathProgramCache]: Analyzing trace with hash 1133745070, now seen corresponding path program 1 times [2019-12-27 03:15:02,001 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:15:02,001 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303943268] [2019-12-27 03:15:02,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:15:02,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:15:02,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:15:02,184 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303943268] [2019-12-27 03:15:02,185 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:15:02,185 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 03:15:02,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836243109] [2019-12-27 03:15:02,185 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 03:15:02,186 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:15:02,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 03:15:02,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 03:15:02,186 INFO L87 Difference]: Start difference. First operand 1635 states and 3657 transitions. Second operand 6 states. [2019-12-27 03:15:02,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:15:02,877 INFO L93 Difference]: Finished difference Result 4528 states and 9998 transitions. [2019-12-27 03:15:02,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 03:15:02,877 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-27 03:15:02,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:15:02,887 INFO L225 Difference]: With dead ends: 4528 [2019-12-27 03:15:02,887 INFO L226 Difference]: Without dead ends: 4493 [2019-12-27 03:15:02,888 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-27 03:15:02,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4493 states. [2019-12-27 03:15:02,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4493 to 2195. [2019-12-27 03:15:02,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2195 states. [2019-12-27 03:15:02,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2195 states to 2195 states and 4961 transitions. [2019-12-27 03:15:02,942 INFO L78 Accepts]: Start accepts. Automaton has 2195 states and 4961 transitions. Word has length 25 [2019-12-27 03:15:02,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:15:02,942 INFO L462 AbstractCegarLoop]: Abstraction has 2195 states and 4961 transitions. [2019-12-27 03:15:02,943 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 03:15:02,943 INFO L276 IsEmpty]: Start isEmpty. Operand 2195 states and 4961 transitions. [2019-12-27 03:15:02,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 03:15:02,946 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:15:02,946 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:15:02,946 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:15:02,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:15:02,946 INFO L82 PathProgramCache]: Analyzing trace with hash -1963896570, now seen corresponding path program 1 times [2019-12-27 03:15:02,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:15:02,947 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629409906] [2019-12-27 03:15:02,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:15:02,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:15:03,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:15:03,062 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629409906] [2019-12-27 03:15:03,062 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:15:03,062 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 03:15:03,062 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286302583] [2019-12-27 03:15:03,063 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 03:15:03,063 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:15:03,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 03:15:03,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 03:15:03,064 INFO L87 Difference]: Start difference. First operand 2195 states and 4961 transitions. Second operand 6 states. [2019-12-27 03:15:03,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:15:03,665 INFO L93 Difference]: Finished difference Result 4412 states and 9625 transitions. [2019-12-27 03:15:03,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 03:15:03,665 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-12-27 03:15:03,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:15:03,675 INFO L225 Difference]: With dead ends: 4412 [2019-12-27 03:15:03,675 INFO L226 Difference]: Without dead ends: 4383 [2019-12-27 03:15:03,675 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-27 03:15:03,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4383 states. [2019-12-27 03:15:03,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4383 to 2070. [2019-12-27 03:15:03,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2070 states. [2019-12-27 03:15:03,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2070 states to 2070 states and 4705 transitions. [2019-12-27 03:15:03,728 INFO L78 Accepts]: Start accepts. Automaton has 2070 states and 4705 transitions. Word has length 26 [2019-12-27 03:15:03,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:15:03,729 INFO L462 AbstractCegarLoop]: Abstraction has 2070 states and 4705 transitions. [2019-12-27 03:15:03,729 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 03:15:03,729 INFO L276 IsEmpty]: Start isEmpty. Operand 2070 states and 4705 transitions. [2019-12-27 03:15:03,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 03:15:03,732 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:15:03,732 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:15:03,733 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:15:03,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:15:03,733 INFO L82 PathProgramCache]: Analyzing trace with hash 1827812304, now seen corresponding path program 1 times [2019-12-27 03:15:03,733 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:15:03,734 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171075148] [2019-12-27 03:15:03,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:15:03,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:15:03,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:15:03,788 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171075148] [2019-12-27 03:15:03,789 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:15:03,790 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:15:03,790 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924382788] [2019-12-27 03:15:03,790 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:15:03,790 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:15:03,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:15:03,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:15:03,791 INFO L87 Difference]: Start difference. First operand 2070 states and 4705 transitions. Second operand 3 states. [2019-12-27 03:15:03,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:15:03,810 INFO L93 Difference]: Finished difference Result 1991 states and 4456 transitions. [2019-12-27 03:15:03,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:15:03,811 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-27 03:15:03,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:15:03,815 INFO L225 Difference]: With dead ends: 1991 [2019-12-27 03:15:03,815 INFO L226 Difference]: Without dead ends: 1991 [2019-12-27 03:15:03,816 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:15:03,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1991 states. [2019-12-27 03:15:03,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1991 to 1854. [2019-12-27 03:15:03,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1854 states. [2019-12-27 03:15:03,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1854 states to 1854 states and 4184 transitions. [2019-12-27 03:15:03,852 INFO L78 Accepts]: Start accepts. Automaton has 1854 states and 4184 transitions. Word has length 27 [2019-12-27 03:15:03,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:15:03,854 INFO L462 AbstractCegarLoop]: Abstraction has 1854 states and 4184 transitions. [2019-12-27 03:15:03,854 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:15:03,854 INFO L276 IsEmpty]: Start isEmpty. Operand 1854 states and 4184 transitions. [2019-12-27 03:15:03,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 03:15:03,858 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:15:03,858 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:15:03,858 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:15:03,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:15:03,859 INFO L82 PathProgramCache]: Analyzing trace with hash 1234551102, now seen corresponding path program 1 times [2019-12-27 03:15:03,859 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:15:03,860 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208230263] [2019-12-27 03:15:03,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:15:03,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:15:03,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:15:03,954 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208230263] [2019-12-27 03:15:03,954 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:15:03,954 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 03:15:03,955 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489118621] [2019-12-27 03:15:03,955 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:15:03,955 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:15:03,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:15:03,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:15:03,957 INFO L87 Difference]: Start difference. First operand 1854 states and 4184 transitions. Second operand 5 states. [2019-12-27 03:15:03,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:15:03,999 INFO L93 Difference]: Finished difference Result 968 states and 2169 transitions. [2019-12-27 03:15:03,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 03:15:03,999 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-27 03:15:04,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:15:04,002 INFO L225 Difference]: With dead ends: 968 [2019-12-27 03:15:04,003 INFO L226 Difference]: Without dead ends: 886 [2019-12-27 03:15:04,003 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:15:04,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2019-12-27 03:15:04,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 886. [2019-12-27 03:15:04,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 886 states. [2019-12-27 03:15:04,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 886 states and 1985 transitions. [2019-12-27 03:15:04,023 INFO L78 Accepts]: Start accepts. Automaton has 886 states and 1985 transitions. Word has length 28 [2019-12-27 03:15:04,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:15:04,024 INFO L462 AbstractCegarLoop]: Abstraction has 886 states and 1985 transitions. [2019-12-27 03:15:04,024 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:15:04,024 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 1985 transitions. [2019-12-27 03:15:04,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 03:15:04,030 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:15:04,030 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:15:04,030 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:15:04,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:15:04,030 INFO L82 PathProgramCache]: Analyzing trace with hash 551725022, now seen corresponding path program 1 times [2019-12-27 03:15:04,031 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:15:04,031 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170984018] [2019-12-27 03:15:04,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:15:04,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:15:04,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:15:04,180 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170984018] [2019-12-27 03:15:04,180 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:15:04,180 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 03:15:04,180 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429319522] [2019-12-27 03:15:04,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 03:15:04,181 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:15:04,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 03:15:04,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:15:04,181 INFO L87 Difference]: Start difference. First operand 886 states and 1985 transitions. Second operand 7 states. [2019-12-27 03:15:04,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:15:04,559 INFO L93 Difference]: Finished difference Result 2885 states and 6293 transitions. [2019-12-27 03:15:04,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 03:15:04,559 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-12-27 03:15:04,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:15:04,564 INFO L225 Difference]: With dead ends: 2885 [2019-12-27 03:15:04,564 INFO L226 Difference]: Without dead ends: 1947 [2019-12-27 03:15:04,565 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-12-27 03:15:04,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1947 states. [2019-12-27 03:15:04,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1947 to 1014. [2019-12-27 03:15:04,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1014 states. [2019-12-27 03:15:04,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1014 states to 1014 states and 2260 transitions. [2019-12-27 03:15:04,588 INFO L78 Accepts]: Start accepts. Automaton has 1014 states and 2260 transitions. Word has length 52 [2019-12-27 03:15:04,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:15:04,588 INFO L462 AbstractCegarLoop]: Abstraction has 1014 states and 2260 transitions. [2019-12-27 03:15:04,588 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 03:15:04,588 INFO L276 IsEmpty]: Start isEmpty. Operand 1014 states and 2260 transitions. [2019-12-27 03:15:04,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 03:15:04,591 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:15:04,591 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:15:04,592 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:15:04,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:15:04,592 INFO L82 PathProgramCache]: Analyzing trace with hash -744775922, now seen corresponding path program 2 times [2019-12-27 03:15:04,592 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:15:04,593 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039572178] [2019-12-27 03:15:04,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:15:04,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:15:04,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:15:04,659 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039572178] [2019-12-27 03:15:04,659 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:15:04,659 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:15:04,659 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341647818] [2019-12-27 03:15:04,660 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:15:04,660 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:15:04,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:15:04,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:15:04,661 INFO L87 Difference]: Start difference. First operand 1014 states and 2260 transitions. Second operand 3 states. [2019-12-27 03:15:04,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:15:04,721 INFO L93 Difference]: Finished difference Result 1280 states and 2822 transitions. [2019-12-27 03:15:04,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:15:04,722 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 03:15:04,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:15:04,725 INFO L225 Difference]: With dead ends: 1280 [2019-12-27 03:15:04,726 INFO L226 Difference]: Without dead ends: 1280 [2019-12-27 03:15:04,726 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:15:04,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1280 states. [2019-12-27 03:15:04,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1280 to 942. [2019-12-27 03:15:04,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 942 states. [2019-12-27 03:15:04,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 942 states to 942 states and 2088 transitions. [2019-12-27 03:15:04,743 INFO L78 Accepts]: Start accepts. Automaton has 942 states and 2088 transitions. Word has length 52 [2019-12-27 03:15:04,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:15:04,743 INFO L462 AbstractCegarLoop]: Abstraction has 942 states and 2088 transitions. [2019-12-27 03:15:04,743 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:15:04,744 INFO L276 IsEmpty]: Start isEmpty. Operand 942 states and 2088 transitions. [2019-12-27 03:15:04,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 03:15:04,746 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:15:04,747 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:15:04,747 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:15:04,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:15:04,747 INFO L82 PathProgramCache]: Analyzing trace with hash 238171223, now seen corresponding path program 1 times [2019-12-27 03:15:04,747 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:15:04,748 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353490191] [2019-12-27 03:15:04,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:15:04,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 03:15:04,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 03:15:04,866 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 03:15:04,867 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 03:15:04,871 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] ULTIMATE.startENTRY-->L797: Formula: (let ((.cse0 (store |v_#valid_47| 0 0))) (and (= v_~main$tmp_guard0~0_31 0) (= v_~x$r_buff1_thd1~0_165 0) (= 0 v_~x~0_148) (= v_~x$r_buff0_thd0~0_133 0) (= v_~x$r_buff0_thd1~0_227 0) (= v_~weak$$choice2~0_120 0) (= |v_#NULL.offset_6| 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1711~0.base_24|) 0) (= v_~__unbuffered_p1_EBX~0_40 0) (= 0 v_~x$read_delayed_var~0.base_7) (= |v_#valid_45| (store .cse0 |v_ULTIMATE.start_main_~#t1711~0.base_24| 1)) (= 0 v_~__unbuffered_cnt~0_63) (= v_~main$tmp_guard1~0_41 0) (= v_~y~0_147 0) (= 0 |v_#NULL.base_6|) (= v_~x$flush_delayed~0_31 0) (= 0 v_~x$read_delayed~0_7) (= v_~x$mem_tmp~0_24 0) (= 0 v_~x$w_buff1_used~0_507) (= 0 v_~weak$$choice0~0_22) (= v_~x$r_buff1_thd0~0_183 0) (= 0 |v_ULTIMATE.start_main_~#t1711~0.offset_18|) (= 0 v_~x$w_buff1~0_317) (= 0 v_~x$w_buff0~0_542) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1711~0.base_24|) (= 0 v_~x$r_buff0_thd2~0_359) (= 0 v_~x$read_delayed_var~0.offset_7) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1711~0.base_24| 4)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1711~0.base_24| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1711~0.base_24|) |v_ULTIMATE.start_main_~#t1711~0.offset_18| 0)) |v_#memory_int_13|) (= 0 v_~x$w_buff0_used~0_792) (= 0 v_~__unbuffered_p1_EAX~0_39) (= 0 v_~x$r_buff1_thd2~0_331) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_14|, #length=|v_#length_14|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_542, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_227, ~x$flush_delayed~0=v_~x$flush_delayed~0_31, #NULL.offset=|v_#NULL.offset_6|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_165, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_41, ~x$mem_tmp~0=v_~x$mem_tmp~0_24, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_28|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_34|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_69|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_34|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, #length=|v_#length_13|, ULTIMATE.start_main_~#t1711~0.base=|v_ULTIMATE.start_main_~#t1711~0.base_24|, ULTIMATE.start_main_~#t1711~0.offset=|v_ULTIMATE.start_main_~#t1711~0.offset_18|, ~y~0=v_~y~0_147, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_133, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_40, ~x$w_buff1~0=v_~x$w_buff1~0_317, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_507, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_331, ULTIMATE.start_main_~#t1712~0.offset=|v_ULTIMATE.start_main_~#t1712~0.offset_14|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_31, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_183, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_359, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, #NULL.base=|v_#NULL.base_6|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_792, ~weak$$choice0~0=v_~weak$$choice0~0_22, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_37|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_36|, ULTIMATE.start_main_~#t1712~0.base=|v_ULTIMATE.start_main_~#t1712~0.base_16|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_31|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_19|, ~weak$$choice2~0=v_~weak$$choice2~0_120, ~x~0=v_~x~0_148, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~__unbuffered_p1_EAX~0, #length, ULTIMATE.start_main_~#t1711~0.base, ULTIMATE.start_main_~#t1711~0.offset, ~y~0, ~x$r_buff0_thd0~0, ~__unbuffered_p1_EBX~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_~#t1712~0.offset, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_~#t1712~0.base, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 03:15:04,872 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L4-->L738: Formula: (and (= 1 v_~x$r_buff0_thd1~0_40) (= v_~x$r_buff1_thd1~0_23 v_~x$r_buff0_thd1~0_41) (= v_~x$r_buff1_thd2~0_64 v_~x$r_buff0_thd2~0_110) (= v_~y~0_18 1) (not (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_74 0)) (= v_~x$r_buff1_thd0~0_37 v_~x$r_buff0_thd0~0_53)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_53, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_41, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_74, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_110} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_53, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_40, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_74, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_64, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_23, ~y~0=v_~y~0_18, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_110, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_37} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 03:15:04,873 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L797-1-->L799: Formula: (and (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1712~0.base_12| 1) |v_#valid_27|) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1712~0.base_12|)) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t1712~0.base_12| 4) |v_#length_9|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1712~0.base_12|) (not (= |v_ULTIMATE.start_main_~#t1712~0.base_12| 0)) (= 0 |v_ULTIMATE.start_main_~#t1712~0.offset_10|) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1712~0.base_12| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1712~0.base_12|) |v_ULTIMATE.start_main_~#t1712~0.offset_10| 1)) |v_#memory_int_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t1712~0.base=|v_ULTIMATE.start_main_~#t1712~0.base_12|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, #length=|v_#length_9|, ULTIMATE.start_main_~#t1712~0.offset=|v_ULTIMATE.start_main_~#t1712~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1712~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t1712~0.offset] because there is no mapped edge [2019-12-27 03:15:04,875 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L739-->L739-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-333240787 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In-333240787 256)))) (or (and (= ~x$w_buff0_used~0_In-333240787 |P0Thread1of1ForFork0_#t~ite5_Out-333240787|) (or .cse0 .cse1)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out-333240787| 0) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-333240787, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-333240787} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-333240787|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-333240787, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-333240787} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 03:15:04,875 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L763-->L763-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In2003438559 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite14_Out2003438559| ~x$w_buff0~0_In2003438559) (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In2003438559 256) 0))) (or (and (= (mod ~x$r_buff1_thd2~0_In2003438559 256) 0) .cse0) (and .cse0 (= (mod ~x$w_buff1_used~0_In2003438559 256) 0)) (= (mod ~x$w_buff0_used~0_In2003438559 256) 0))) (= |P1Thread1of1ForFork1_#t~ite14_Out2003438559| |P1Thread1of1ForFork1_#t~ite15_Out2003438559|) .cse1) (and (= |P1Thread1of1ForFork1_#t~ite15_Out2003438559| ~x$w_buff0~0_In2003438559) (= |P1Thread1of1ForFork1_#t~ite14_In2003438559| |P1Thread1of1ForFork1_#t~ite14_Out2003438559|) (not .cse1)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In2003438559, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2003438559, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In2003438559, ~weak$$choice2~0=~weak$$choice2~0_In2003438559, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In2003438559, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In2003438559|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2003438559} OutVars{~x$w_buff0~0=~x$w_buff0~0_In2003438559, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2003438559, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In2003438559, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out2003438559|, ~weak$$choice2~0=~weak$$choice2~0_In2003438559, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In2003438559, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out2003438559|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2003438559} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 03:15:04,876 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L740-->L740-2: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In-420310365 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd1~0_In-420310365 256))) (.cse3 (= (mod ~x$r_buff0_thd1~0_In-420310365 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-420310365 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite6_Out-420310365| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |P0Thread1of1ForFork0_#t~ite6_Out-420310365| ~x$w_buff1_used~0_In-420310365)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-420310365, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-420310365, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-420310365, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-420310365} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-420310365|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-420310365, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-420310365, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-420310365, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-420310365} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 03:15:04,877 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L741-->L742: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-705661275 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In-705661275 256)))) (or (and (not .cse0) (not .cse1) (= ~x$r_buff0_thd1~0_Out-705661275 0)) (and (or .cse1 .cse0) (= ~x$r_buff0_thd1~0_Out-705661275 ~x$r_buff0_thd1~0_In-705661275)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-705661275, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-705661275} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_Out-705661275, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-705661275|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-705661275} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-27 03:15:04,877 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L742-->L742-2: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In-791422527 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd1~0_In-791422527 256) 0)) (.cse2 (= (mod ~x$w_buff0_used~0_In-791422527 256) 0)) (.cse3 (= 0 (mod ~x$r_buff0_thd1~0_In-791422527 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite8_Out-791422527| ~x$r_buff1_thd1~0_In-791422527) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out-791422527|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-791422527, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-791422527, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-791422527, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-791422527} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-791422527, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-791422527|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-791422527, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-791422527, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-791422527} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 03:15:04,877 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L742-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~x$r_buff1_thd1~0_128 |v_P0Thread1of1ForFork0_#t~ite8_32|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_31|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_128} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-12-27 03:15:04,877 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L764-->L764-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In950538391 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite18_Out950538391| ~x$w_buff1~0_In950538391) (= |P1Thread1of1ForFork1_#t~ite17_In950538391| |P1Thread1of1ForFork1_#t~ite17_Out950538391|)) (and (= |P1Thread1of1ForFork1_#t~ite17_Out950538391| ~x$w_buff1~0_In950538391) .cse0 (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In950538391 256) 0))) (or (and (= (mod ~x$w_buff1_used~0_In950538391 256) 0) .cse1) (= (mod ~x$w_buff0_used~0_In950538391 256) 0) (and (= 0 (mod ~x$r_buff1_thd2~0_In950538391 256)) .cse1))) (= |P1Thread1of1ForFork1_#t~ite18_Out950538391| |P1Thread1of1ForFork1_#t~ite17_Out950538391|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In950538391, ~x$w_buff1_used~0=~x$w_buff1_used~0_In950538391, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In950538391, ~weak$$choice2~0=~weak$$choice2~0_In950538391, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In950538391, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_In950538391|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In950538391} OutVars{P1Thread1of1ForFork1_#t~ite18=|P1Thread1of1ForFork1_#t~ite18_Out950538391|, ~x$w_buff1~0=~x$w_buff1~0_In950538391, ~x$w_buff1_used~0=~x$w_buff1_used~0_In950538391, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In950538391, ~weak$$choice2~0=~weak$$choice2~0_In950538391, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In950538391, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_Out950538391|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In950538391} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite18, P1Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-12-27 03:15:04,878 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L765-->L765-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-1397368298 256)))) (or (and (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In-1397368298 256) 0))) (or (and (= (mod ~x$w_buff1_used~0_In-1397368298 256) 0) .cse0) (= 0 (mod ~x$w_buff0_used~0_In-1397368298 256)) (and (= (mod ~x$r_buff1_thd2~0_In-1397368298 256) 0) .cse0))) (= |P1Thread1of1ForFork1_#t~ite20_Out-1397368298| ~x$w_buff0_used~0_In-1397368298) .cse1 (= |P1Thread1of1ForFork1_#t~ite21_Out-1397368298| |P1Thread1of1ForFork1_#t~ite20_Out-1397368298|)) (and (= |P1Thread1of1ForFork1_#t~ite21_Out-1397368298| ~x$w_buff0_used~0_In-1397368298) (= |P1Thread1of1ForFork1_#t~ite20_In-1397368298| |P1Thread1of1ForFork1_#t~ite20_Out-1397368298|) (not .cse1)))) InVars {P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In-1397368298|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1397368298, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1397368298, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1397368298, ~weak$$choice2~0=~weak$$choice2~0_In-1397368298, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1397368298} OutVars{P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out-1397368298|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1397368298, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1397368298, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out-1397368298|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1397368298, ~weak$$choice2~0=~weak$$choice2~0_In-1397368298, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1397368298} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-27 03:15:04,879 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L767-->L768: Formula: (and (not (= (mod v_~weak$$choice2~0_27 256) 0)) (= v_~x$r_buff0_thd2~0_135 v_~x$r_buff0_thd2~0_134)) InVars {~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_135, ~weak$$choice2~0=v_~weak$$choice2~0_27} OutVars{P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_9|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_134, ~weak$$choice2~0=v_~weak$$choice2~0_27, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_14|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_11|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite27, ~x$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-27 03:15:04,880 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L768-->L768-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In174884420 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite29_Out174884420| |P1Thread1of1ForFork1_#t~ite30_Out174884420|) (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In174884420 256) 0))) (or (and .cse0 (= 0 (mod ~x$w_buff1_used~0_In174884420 256))) (= 0 (mod ~x$w_buff0_used~0_In174884420 256)) (and .cse0 (= (mod ~x$r_buff1_thd2~0_In174884420 256) 0)))) .cse1 (= |P1Thread1of1ForFork1_#t~ite29_Out174884420| ~x$r_buff1_thd2~0_In174884420)) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite30_Out174884420| ~x$r_buff1_thd2~0_In174884420) (= |P1Thread1of1ForFork1_#t~ite29_In174884420| |P1Thread1of1ForFork1_#t~ite29_Out174884420|)))) InVars {P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In174884420|, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In174884420, ~x$w_buff1_used~0=~x$w_buff1_used~0_In174884420, ~weak$$choice2~0=~weak$$choice2~0_In174884420, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In174884420, ~x$w_buff0_used~0=~x$w_buff0_used~0_In174884420} OutVars{P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out174884420|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out174884420|, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In174884420, ~x$w_buff1_used~0=~x$w_buff1_used~0_In174884420, ~weak$$choice2~0=~weak$$choice2~0_In174884420, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In174884420, ~x$w_buff0_used~0=~x$w_buff0_used~0_In174884420} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-27 03:15:04,880 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [651] [651] L770-->L774: Formula: (and (= 0 v_~x$flush_delayed~0_7) (not (= 0 (mod v_~x$flush_delayed~0_8 256))) (= v_~x$mem_tmp~0_5 v_~x~0_14)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_8, ~x$mem_tmp~0=v_~x$mem_tmp~0_5} OutVars{~x$flush_delayed~0=v_~x$flush_delayed~0_7, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~x$mem_tmp~0=v_~x$mem_tmp~0_5, ~x~0=v_~x~0_14} AuxVars[] AssignedVars[~x$flush_delayed~0, P1Thread1of1ForFork1_#t~ite31, ~x~0] because there is no mapped edge [2019-12-27 03:15:04,881 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L774-2-->L774-4: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In206608782 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In206608782 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite32_Out206608782| ~x$w_buff1~0_In206608782) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite32_Out206608782| ~x~0_In206608782)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In206608782, ~x$w_buff1_used~0=~x$w_buff1_used~0_In206608782, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In206608782, ~x~0=~x~0_In206608782} OutVars{~x$w_buff1~0=~x$w_buff1~0_In206608782, ~x$w_buff1_used~0=~x$w_buff1_used~0_In206608782, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In206608782, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out206608782|, ~x~0=~x~0_In206608782} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-27 03:15:04,881 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L774-4-->L775: Formula: (= v_~x~0_29 |v_P1Thread1of1ForFork1_#t~ite32_8|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_8|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_7|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_7|, ~x~0=v_~x~0_29} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-27 03:15:04,881 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L775-->L775-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In1968385866 256))) (.cse0 (= (mod ~x$r_buff0_thd2~0_In1968385866 256) 0))) (or (and (= ~x$w_buff0_used~0_In1968385866 |P1Thread1of1ForFork1_#t~ite34_Out1968385866|) (or .cse0 .cse1)) (and (= 0 |P1Thread1of1ForFork1_#t~ite34_Out1968385866|) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1968385866, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1968385866} OutVars{P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out1968385866|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1968385866, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1968385866} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 03:15:04,882 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L776-->L776-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff1_thd2~0_In131241798 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In131241798 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In131241798 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In131241798 256) 0))) (or (and (= ~x$w_buff1_used~0_In131241798 |P1Thread1of1ForFork1_#t~ite35_Out131241798|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork1_#t~ite35_Out131241798|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In131241798, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In131241798, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In131241798, ~x$w_buff0_used~0=~x$w_buff0_used~0_In131241798} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In131241798, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In131241798, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out131241798|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In131241798, ~x$w_buff0_used~0=~x$w_buff0_used~0_In131241798} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 03:15:04,882 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L777-->L777-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-654792436 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-654792436 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd2~0_In-654792436 |P1Thread1of1ForFork1_#t~ite36_Out-654792436|)) (and (= 0 |P1Thread1of1ForFork1_#t~ite36_Out-654792436|) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-654792436, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-654792436} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-654792436, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-654792436|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-654792436} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 03:15:04,883 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L778-->L778-2: Formula: (let ((.cse3 (= (mod ~x$r_buff0_thd2~0_In-698689751 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-698689751 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-698689751 256))) (.cse0 (= (mod ~x$r_buff1_thd2~0_In-698689751 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite37_Out-698689751| 0)) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite37_Out-698689751| ~x$r_buff1_thd2~0_In-698689751)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-698689751, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-698689751, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-698689751, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-698689751} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-698689751, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-698689751, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-698689751, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-698689751|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-698689751} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 03:15:04,883 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L778-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~x$r_buff1_thd2~0_269 |v_P1Thread1of1ForFork1_#t~ite37_42|) (= (+ v_~__unbuffered_cnt~0_47 1) v_~__unbuffered_cnt~0_46) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_42|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_269, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_46, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_41|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 03:15:04,883 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L803-->L805-2: Formula: (and (or (= 0 (mod v_~x$r_buff0_thd0~0_64 256)) (= (mod v_~x$w_buff0_used~0_301 256) 0)) (not (= (mod v_~main$tmp_guard0~0_8 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_64, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_301} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_64, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_301} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 03:15:04,884 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L805-2-->L805-4: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In531764781 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In531764781 256) 0))) (or (and (= ~x$w_buff1~0_In531764781 |ULTIMATE.start_main_#t~ite40_Out531764781|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~x~0_In531764781 |ULTIMATE.start_main_#t~ite40_Out531764781|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In531764781, ~x$w_buff1_used~0=~x$w_buff1_used~0_In531764781, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In531764781, ~x~0=~x~0_In531764781} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out531764781|, ~x$w_buff1~0=~x$w_buff1~0_In531764781, ~x$w_buff1_used~0=~x$w_buff1_used~0_In531764781, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In531764781, ~x~0=~x~0_In531764781} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 03:15:04,884 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L805-4-->L806: Formula: (= v_~x~0_46 |v_ULTIMATE.start_main_#t~ite40_13|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_13|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_16|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_12|, ~x~0=v_~x~0_46} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~x~0] because there is no mapped edge [2019-12-27 03:15:04,884 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L806-->L806-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In440194167 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In440194167 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite42_Out440194167| 0) (not .cse1)) (and (or .cse1 .cse0) (= ~x$w_buff0_used~0_In440194167 |ULTIMATE.start_main_#t~ite42_Out440194167|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In440194167, ~x$w_buff0_used~0=~x$w_buff0_used~0_In440194167} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In440194167, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out440194167|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In440194167} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 03:15:04,884 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L807-->L807-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In-2002843175 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-2002843175 256) 0)) (.cse3 (= (mod ~x$r_buff1_thd0~0_In-2002843175 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-2002843175 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite43_Out-2002843175| ~x$w_buff1_used~0_In-2002843175)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |ULTIMATE.start_main_#t~ite43_Out-2002843175| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2002843175, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2002843175, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2002843175, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2002843175} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2002843175, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2002843175, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-2002843175|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2002843175, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2002843175} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 03:15:04,885 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L808-->L808-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In508219821 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd0~0_In508219821 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite44_Out508219821|) (not .cse1)) (and (or .cse0 .cse1) (= ~x$r_buff0_thd0~0_In508219821 |ULTIMATE.start_main_#t~ite44_Out508219821|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In508219821, ~x$w_buff0_used~0=~x$w_buff0_used~0_In508219821} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In508219821, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out508219821|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In508219821} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 03:15:04,886 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L809-->L809-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In-578267305 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In-578267305 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-578267305 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-578267305 256)))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out-578267305| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite45_Out-578267305| ~x$r_buff1_thd0~0_In-578267305) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-578267305, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-578267305, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-578267305, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-578267305} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-578267305, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-578267305, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-578267305, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-578267305|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-578267305} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 03:15:04,886 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L809-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~__unbuffered_p1_EBX~0_27 0) (= v_~main$tmp_guard1~0_20 0) (= v_~y~0_126 2) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= 2 v_~__unbuffered_p1_EAX~0_27) (= v_~x$r_buff1_thd0~0_149 |v_ULTIMATE.start_main_#t~ite45_40|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_27, ~y~0=v_~y~0_126, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_40|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_27, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~y~0=v_~y~0_126, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_149, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_39|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 03:15:04,965 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 03:15:04 BasicIcfg [2019-12-27 03:15:04,965 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 03:15:04,967 INFO L168 Benchmark]: Toolchain (without parser) took 15658.18 ms. Allocated memory was 136.8 MB in the beginning and 617.1 MB in the end (delta: 480.2 MB). Free memory was 98.9 MB in the beginning and 352.6 MB in the end (delta: -253.7 MB). Peak memory consumption was 226.5 MB. Max. memory is 7.1 GB. [2019-12-27 03:15:04,968 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 136.8 MB. Free memory was 118.7 MB in the beginning and 118.5 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 03:15:04,969 INFO L168 Benchmark]: CACSL2BoogieTranslator took 814.69 ms. Allocated memory was 136.8 MB in the beginning and 200.8 MB in the end (delta: 64.0 MB). Free memory was 98.5 MB in the beginning and 154.4 MB in the end (delta: -55.9 MB). Peak memory consumption was 24.2 MB. Max. memory is 7.1 GB. [2019-12-27 03:15:04,970 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.31 ms. Allocated memory is still 200.8 MB. Free memory was 154.4 MB in the beginning and 151.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 03:15:04,971 INFO L168 Benchmark]: Boogie Preprocessor took 51.81 ms. Allocated memory is still 200.8 MB. Free memory was 151.6 MB in the beginning and 149.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 03:15:04,971 INFO L168 Benchmark]: RCFGBuilder took 781.04 ms. Allocated memory is still 200.8 MB. Free memory was 149.6 MB in the beginning and 104.9 MB in the end (delta: 44.8 MB). Peak memory consumption was 44.8 MB. Max. memory is 7.1 GB. [2019-12-27 03:15:04,972 INFO L168 Benchmark]: TraceAbstraction took 13945.70 ms. Allocated memory was 200.8 MB in the beginning and 617.1 MB in the end (delta: 416.3 MB). Free memory was 104.9 MB in the beginning and 352.6 MB in the end (delta: -247.8 MB). Peak memory consumption was 168.5 MB. Max. memory is 7.1 GB. [2019-12-27 03:15:04,977 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 136.8 MB. Free memory was 118.7 MB in the beginning and 118.5 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 814.69 ms. Allocated memory was 136.8 MB in the beginning and 200.8 MB in the end (delta: 64.0 MB). Free memory was 98.5 MB in the beginning and 154.4 MB in the end (delta: -55.9 MB). Peak memory consumption was 24.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 59.31 ms. Allocated memory is still 200.8 MB. Free memory was 154.4 MB in the beginning and 151.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 51.81 ms. Allocated memory is still 200.8 MB. Free memory was 151.6 MB in the beginning and 149.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 781.04 ms. Allocated memory is still 200.8 MB. Free memory was 149.6 MB in the beginning and 104.9 MB in the end (delta: 44.8 MB). Peak memory consumption was 44.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13945.70 ms. Allocated memory was 200.8 MB in the beginning and 617.1 MB in the end (delta: 416.3 MB). Free memory was 104.9 MB in the beginning and 352.6 MB in the end (delta: -247.8 MB). Peak memory consumption was 168.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.4s, 147 ProgramPointsBefore, 79 ProgramPointsAfterwards, 181 TransitionsBefore, 90 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 12 FixpointIterations, 29 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 26 ChoiceCompositions, 4894 VarBasedMoverChecksPositive, 354 VarBasedMoverChecksNegative, 269 SemBasedMoverChecksPositive, 191 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 0 MoverChecksTotal, 76691 CheckedPairsTotal, 108 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L797] FCALL, FORK 0 pthread_create(&t1711, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L724] 1 x$w_buff1 = x$w_buff0 [L725] 1 x$w_buff0 = 1 [L726] 1 x$w_buff1_used = x$w_buff0_used [L727] 1 x$w_buff0_used = (_Bool)1 [L738] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L799] FCALL, FORK 0 pthread_create(&t1712, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L752] 2 y = 2 [L755] 2 __unbuffered_p1_EAX = y [L758] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L759] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L760] 2 x$flush_delayed = weak$$choice2 [L761] 2 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L762] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L738] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L762] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L763] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L739] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L740] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L764] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L765] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L766] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L766] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L768] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L769] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L774] 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L775] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L776] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L777] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L801] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L806] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L807] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L808] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 141 locations, 2 error locations. Result: UNSAFE, OverallTime: 13.6s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1461 SDtfs, 1578 SDslu, 2874 SDs, 0 SdLazy, 1296 SolverSat, 99 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 64 GetRequests, 11 SyntacticMatches, 6 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12234occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.6s AutomataMinimizationTime, 11 MinimizatonAttempts, 8827 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 324 NumberOfCodeBlocks, 324 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 260 ConstructedInterpolants, 0 QuantifiedInterpolants, 28986 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...