/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-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix022_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 05:46:59,080 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 05:46:59,083 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 05:46:59,101 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 05:46:59,101 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 05:46:59,103 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 05:46:59,105 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 05:46:59,115 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 05:46:59,118 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 05:46:59,120 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 05:46:59,121 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 05:46:59,122 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 05:46:59,122 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 05:46:59,123 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 05:46:59,124 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 05:46:59,125 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 05:46:59,125 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 05:46:59,126 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 05:46:59,128 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 05:46:59,130 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 05:46:59,132 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 05:46:59,133 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 05:46:59,134 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 05:46:59,135 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 05:46:59,137 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 05:46:59,137 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 05:46:59,137 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 05:46:59,138 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 05:46:59,138 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 05:46:59,139 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 05:46:59,139 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 05:46:59,140 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 05:46:59,141 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 05:46:59,142 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 05:46:59,143 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 05:46:59,143 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 05:46:59,143 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 05:46:59,144 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 05:46:59,144 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 05:46:59,145 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 05:46:59,145 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 05:46:59,146 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-VariableLbe.epf [2019-12-27 05:46:59,168 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 05:46:59,168 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 05:46:59,173 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 05:46:59,173 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 05:46:59,173 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 05:46:59,174 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 05:46:59,174 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 05:46:59,174 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 05:46:59,174 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 05:46:59,174 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 05:46:59,175 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 05:46:59,175 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 05:46:59,175 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 05:46:59,175 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 05:46:59,175 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 05:46:59,176 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 05:46:59,176 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 05:46:59,176 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 05:46:59,176 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 05:46:59,176 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 05:46:59,177 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 05:46:59,177 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 05:46:59,177 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 05:46:59,177 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 05:46:59,177 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 05:46:59,178 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 05:46:59,178 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 05:46:59,178 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 05:46:59,178 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 05:46:59,178 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 05:46:59,456 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 05:46:59,467 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 05:46:59,471 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 05:46:59,473 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 05:46:59,473 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 05:46:59,474 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix022_power.opt.i [2019-12-27 05:46:59,541 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8419b5bbb/a6b07cbc935449ad80b45a7e21f9b998/FLAGa6f4b10bf [2019-12-27 05:47:00,103 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 05:47:00,104 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix022_power.opt.i [2019-12-27 05:47:00,127 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8419b5bbb/a6b07cbc935449ad80b45a7e21f9b998/FLAGa6f4b10bf [2019-12-27 05:47:00,372 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8419b5bbb/a6b07cbc935449ad80b45a7e21f9b998 [2019-12-27 05:47:00,380 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 05:47:00,382 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 05:47:00,383 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 05:47:00,384 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 05:47:00,387 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 05:47:00,388 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:47:00" (1/1) ... [2019-12-27 05:47:00,391 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fdaac8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:47:00, skipping insertion in model container [2019-12-27 05:47:00,391 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:47:00" (1/1) ... [2019-12-27 05:47:00,399 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 05:47:00,442 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 05:47:00,951 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 05:47:00,968 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 05:47:01,082 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 05:47:01,154 INFO L208 MainTranslator]: Completed translation [2019-12-27 05:47:01,155 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:47:01 WrapperNode [2019-12-27 05:47:01,155 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 05:47:01,156 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 05:47:01,156 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 05:47:01,156 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 05:47:01,165 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:47:01" (1/1) ... [2019-12-27 05:47:01,192 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:47:01" (1/1) ... [2019-12-27 05:47:01,226 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 05:47:01,226 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 05:47:01,226 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 05:47:01,227 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 05:47:01,240 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:47:01" (1/1) ... [2019-12-27 05:47:01,241 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:47:01" (1/1) ... [2019-12-27 05:47:01,245 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:47:01" (1/1) ... [2019-12-27 05:47:01,246 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:47:01" (1/1) ... [2019-12-27 05:47:01,259 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:47:01" (1/1) ... [2019-12-27 05:47:01,263 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:47:01" (1/1) ... [2019-12-27 05:47:01,266 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:47:01" (1/1) ... [2019-12-27 05:47:01,271 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 05:47:01,272 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 05:47:01,272 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 05:47:01,272 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 05:47:01,273 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:47:01" (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 05:47:01,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 05:47:01,357 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 05:47:01,357 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 05:47:01,358 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 05:47:01,358 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 05:47:01,358 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 05:47:01,358 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 05:47:01,358 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 05:47:01,359 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 05:47:01,359 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 05:47:01,359 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 05:47:01,361 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 05:47:02,097 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 05:47:02,098 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 05:47:02,099 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:47:02 BoogieIcfgContainer [2019-12-27 05:47:02,099 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 05:47:02,101 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 05:47:02,101 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 05:47:02,107 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 05:47:02,107 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 05:47:00" (1/3) ... [2019-12-27 05:47:02,108 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ba19e9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:47:02, skipping insertion in model container [2019-12-27 05:47:02,109 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:47:01" (2/3) ... [2019-12-27 05:47:02,111 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ba19e9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:47:02, skipping insertion in model container [2019-12-27 05:47:02,112 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:47:02" (3/3) ... [2019-12-27 05:47:02,113 INFO L109 eAbstractionObserver]: Analyzing ICFG mix022_power.opt.i [2019-12-27 05:47:02,121 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 05:47:02,121 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 05:47:02,128 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 05:47:02,129 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 05:47:02,164 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,164 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,165 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,165 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,165 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,166 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,166 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,166 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,167 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,167 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,167 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,168 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,168 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,168 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,169 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,169 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,169 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,169 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,170 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,170 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,170 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,171 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,171 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,171 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,172 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,172 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,172 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,172 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,173 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,173 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,173 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,173 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,174 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,174 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,175 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,175 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,176 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,176 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,176 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,176 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,176 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,177 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,177 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,177 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,178 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,178 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,178 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,178 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,181 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,181 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,181 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,182 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,182 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,182 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,182 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,182 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,183 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,183 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,183 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,184 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,184 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,184 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,184 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,186 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,186 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,186 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,187 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,187 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,187 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,187 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,187 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,188 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,188 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,188 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,189 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,189 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,189 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,189 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,190 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,190 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,190 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,190 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,191 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,191 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,191 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,191 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,192 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,192 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,192 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,192 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,193 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,193 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,193 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,193 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,194 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,194 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,194 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,194 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,195 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,195 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,195 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,195 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,196 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,196 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,196 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,197 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,197 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,197 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,197 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,198 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,198 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,198 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,198 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,203 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,203 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,203 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,203 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,204 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,204 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,204 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,225 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,225 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,225 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,225 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,226 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,226 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,226 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,226 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,226 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,227 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,227 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,227 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,243 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,246 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,247 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:02,263 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 05:47:02,286 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 05:47:02,286 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 05:47:02,286 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 05:47:02,286 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 05:47:02,286 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 05:47:02,287 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 05:47:02,287 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 05:47:02,287 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 05:47:02,313 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 181 transitions [2019-12-27 05:47:02,315 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-27 05:47:02,406 INFO L132 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-27 05:47:02,407 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 05:47:02,420 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 340 event pairs. 0/136 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 05:47:02,441 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-27 05:47:02,531 INFO L132 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-27 05:47:02,532 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 05:47:02,541 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 340 event pairs. 0/136 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 05:47:02,560 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-27 05:47:02,561 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 05:47:05,820 WARN L192 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-27 05:47:05,926 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-27 05:47:05,950 INFO L206 etLargeBlockEncoding]: Checked pairs total: 55625 [2019-12-27 05:47:05,951 INFO L214 etLargeBlockEncoding]: Total number of compositions: 98 [2019-12-27 05:47:05,954 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 79 places, 89 transitions [2019-12-27 05:47:06,445 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 9482 states. [2019-12-27 05:47:06,447 INFO L276 IsEmpty]: Start isEmpty. Operand 9482 states. [2019-12-27 05:47:06,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 05:47:06,453 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:47:06,454 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 05:47:06,454 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:47:06,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:47:06,460 INFO L82 PathProgramCache]: Analyzing trace with hash 786448, now seen corresponding path program 1 times [2019-12-27 05:47:06,468 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:47:06,469 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814159549] [2019-12-27 05:47:06,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:47:06,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:47:06,677 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 05:47:06,678 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814159549] [2019-12-27 05:47:06,679 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:47:06,679 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 05:47:06,680 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828392567] [2019-12-27 05:47:06,685 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:47:06,685 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:47:06,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:47:06,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:47:06,707 INFO L87 Difference]: Start difference. First operand 9482 states. Second operand 3 states. [2019-12-27 05:47:07,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:47:07,016 INFO L93 Difference]: Finished difference Result 9196 states and 29676 transitions. [2019-12-27 05:47:07,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:47:07,019 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 05:47:07,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:47:07,145 INFO L225 Difference]: With dead ends: 9196 [2019-12-27 05:47:07,149 INFO L226 Difference]: Without dead ends: 8650 [2019-12-27 05:47:07,150 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 05:47:07,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8650 states. [2019-12-27 05:47:07,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8650 to 8650. [2019-12-27 05:47:07,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8650 states. [2019-12-27 05:47:07,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8650 states to 8650 states and 27866 transitions. [2019-12-27 05:47:07,667 INFO L78 Accepts]: Start accepts. Automaton has 8650 states and 27866 transitions. Word has length 3 [2019-12-27 05:47:07,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:47:07,667 INFO L462 AbstractCegarLoop]: Abstraction has 8650 states and 27866 transitions. [2019-12-27 05:47:07,667 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:47:07,668 INFO L276 IsEmpty]: Start isEmpty. Operand 8650 states and 27866 transitions. [2019-12-27 05:47:07,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 05:47:07,671 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:47:07,671 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:47:07,671 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:47:07,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:47:07,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1848805564, now seen corresponding path program 1 times [2019-12-27 05:47:07,672 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:47:07,672 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596707341] [2019-12-27 05:47:07,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:47:07,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:47:07,817 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 05:47:07,818 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596707341] [2019-12-27 05:47:07,818 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:47:07,819 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:47:07,819 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123645725] [2019-12-27 05:47:07,820 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 05:47:07,820 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:47:07,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 05:47:07,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:47:07,821 INFO L87 Difference]: Start difference. First operand 8650 states and 27866 transitions. Second operand 4 states. [2019-12-27 05:47:08,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:47:08,297 INFO L93 Difference]: Finished difference Result 13062 states and 40116 transitions. [2019-12-27 05:47:08,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 05:47:08,297 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 05:47:08,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:47:08,380 INFO L225 Difference]: With dead ends: 13062 [2019-12-27 05:47:08,381 INFO L226 Difference]: Without dead ends: 13055 [2019-12-27 05:47:08,383 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 05:47:08,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13055 states. [2019-12-27 05:47:09,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13055 to 11681. [2019-12-27 05:47:09,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11681 states. [2019-12-27 05:47:09,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11681 states to 11681 states and 36573 transitions. [2019-12-27 05:47:09,375 INFO L78 Accepts]: Start accepts. Automaton has 11681 states and 36573 transitions. Word has length 11 [2019-12-27 05:47:09,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:47:09,376 INFO L462 AbstractCegarLoop]: Abstraction has 11681 states and 36573 transitions. [2019-12-27 05:47:09,376 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 05:47:09,376 INFO L276 IsEmpty]: Start isEmpty. Operand 11681 states and 36573 transitions. [2019-12-27 05:47:09,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 05:47:09,385 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:47:09,385 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:47:09,386 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:47:09,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:47:09,386 INFO L82 PathProgramCache]: Analyzing trace with hash -1479508104, now seen corresponding path program 1 times [2019-12-27 05:47:09,387 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:47:09,387 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218975102] [2019-12-27 05:47:09,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:47:09,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:47:09,497 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 05:47:09,498 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218975102] [2019-12-27 05:47:09,498 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:47:09,498 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:47:09,498 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767381290] [2019-12-27 05:47:09,499 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 05:47:09,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:47:09,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 05:47:09,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:47:09,500 INFO L87 Difference]: Start difference. First operand 11681 states and 36573 transitions. Second operand 4 states. [2019-12-27 05:47:09,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:47:09,738 INFO L93 Difference]: Finished difference Result 13877 states and 43308 transitions. [2019-12-27 05:47:09,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 05:47:09,739 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 05:47:09,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:47:09,787 INFO L225 Difference]: With dead ends: 13877 [2019-12-27 05:47:09,787 INFO L226 Difference]: Without dead ends: 13877 [2019-12-27 05:47:09,787 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 05:47:09,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13877 states. [2019-12-27 05:47:10,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13877 to 12389. [2019-12-27 05:47:10,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12389 states. [2019-12-27 05:47:10,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12389 states to 12389 states and 38882 transitions. [2019-12-27 05:47:10,292 INFO L78 Accepts]: Start accepts. Automaton has 12389 states and 38882 transitions. Word has length 14 [2019-12-27 05:47:10,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:47:10,296 INFO L462 AbstractCegarLoop]: Abstraction has 12389 states and 38882 transitions. [2019-12-27 05:47:10,296 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 05:47:10,296 INFO L276 IsEmpty]: Start isEmpty. Operand 12389 states and 38882 transitions. [2019-12-27 05:47:10,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 05:47:10,300 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:47:10,300 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:47:10,300 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:47:10,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:47:10,300 INFO L82 PathProgramCache]: Analyzing trace with hash -1357739076, now seen corresponding path program 1 times [2019-12-27 05:47:10,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:47:10,302 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868131358] [2019-12-27 05:47:10,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:47:10,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:47:10,385 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 05:47:10,388 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868131358] [2019-12-27 05:47:10,388 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:47:10,388 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 05:47:10,388 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996572143] [2019-12-27 05:47:10,389 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:47:10,389 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:47:10,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:47:10,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:47:10,390 INFO L87 Difference]: Start difference. First operand 12389 states and 38882 transitions. Second operand 3 states. [2019-12-27 05:47:10,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:47:10,445 INFO L93 Difference]: Finished difference Result 12386 states and 38873 transitions. [2019-12-27 05:47:10,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:47:10,446 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-27 05:47:10,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:47:10,488 INFO L225 Difference]: With dead ends: 12386 [2019-12-27 05:47:10,488 INFO L226 Difference]: Without dead ends: 12386 [2019-12-27 05:47:10,489 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 05:47:10,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12386 states. [2019-12-27 05:47:11,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12386 to 12386. [2019-12-27 05:47:11,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12386 states. [2019-12-27 05:47:11,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12386 states to 12386 states and 38873 transitions. [2019-12-27 05:47:11,060 INFO L78 Accepts]: Start accepts. Automaton has 12386 states and 38873 transitions. Word has length 16 [2019-12-27 05:47:11,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:47:11,061 INFO L462 AbstractCegarLoop]: Abstraction has 12386 states and 38873 transitions. [2019-12-27 05:47:11,061 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:47:11,061 INFO L276 IsEmpty]: Start isEmpty. Operand 12386 states and 38873 transitions. [2019-12-27 05:47:11,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 05:47:11,065 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:47:11,065 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 05:47:11,065 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:47:11,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:47:11,066 INFO L82 PathProgramCache]: Analyzing trace with hash 865126068, now seen corresponding path program 1 times [2019-12-27 05:47:11,066 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:47:11,066 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108938096] [2019-12-27 05:47:11,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:47:11,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:47:11,115 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 05:47:11,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108938096] [2019-12-27 05:47:11,115 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:47:11,116 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:47:11,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248213043] [2019-12-27 05:47:11,116 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:47:11,116 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:47:11,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:47:11,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:47:11,118 INFO L87 Difference]: Start difference. First operand 12386 states and 38873 transitions. Second operand 3 states. [2019-12-27 05:47:11,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:47:11,176 INFO L93 Difference]: Finished difference Result 11721 states and 36198 transitions. [2019-12-27 05:47:11,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:47:11,177 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-27 05:47:11,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:47:11,207 INFO L225 Difference]: With dead ends: 11721 [2019-12-27 05:47:11,207 INFO L226 Difference]: Without dead ends: 11721 [2019-12-27 05:47:11,208 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 05:47:11,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11721 states. [2019-12-27 05:47:11,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11721 to 11641. [2019-12-27 05:47:11,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11641 states. [2019-12-27 05:47:11,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11641 states to 11641 states and 35966 transitions. [2019-12-27 05:47:11,554 INFO L78 Accepts]: Start accepts. Automaton has 11641 states and 35966 transitions. Word has length 17 [2019-12-27 05:47:11,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:47:11,555 INFO L462 AbstractCegarLoop]: Abstraction has 11641 states and 35966 transitions. [2019-12-27 05:47:11,555 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:47:11,555 INFO L276 IsEmpty]: Start isEmpty. Operand 11641 states and 35966 transitions. [2019-12-27 05:47:11,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 05:47:11,567 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:47:11,568 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 05:47:11,568 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:47:11,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:47:11,569 INFO L82 PathProgramCache]: Analyzing trace with hash -843797421, now seen corresponding path program 1 times [2019-12-27 05:47:11,569 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:47:11,569 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166888551] [2019-12-27 05:47:11,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:47:11,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:47:11,652 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 05:47:11,652 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166888551] [2019-12-27 05:47:11,652 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:47:11,653 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:47:11,653 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199836786] [2019-12-27 05:47:11,653 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 05:47:11,653 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:47:11,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 05:47:11,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:47:11,654 INFO L87 Difference]: Start difference. First operand 11641 states and 35966 transitions. Second operand 4 states. [2019-12-27 05:47:11,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:47:11,694 INFO L93 Difference]: Finished difference Result 2210 states and 5498 transitions. [2019-12-27 05:47:11,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 05:47:11,694 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-27 05:47:11,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:47:11,698 INFO L225 Difference]: With dead ends: 2210 [2019-12-27 05:47:11,698 INFO L226 Difference]: Without dead ends: 1559 [2019-12-27 05:47:11,699 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 05:47:11,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1559 states. [2019-12-27 05:47:11,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1559 to 1559. [2019-12-27 05:47:11,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1559 states. [2019-12-27 05:47:11,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1559 states to 1559 states and 3435 transitions. [2019-12-27 05:47:11,725 INFO L78 Accepts]: Start accepts. Automaton has 1559 states and 3435 transitions. Word has length 17 [2019-12-27 05:47:11,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:47:11,726 INFO L462 AbstractCegarLoop]: Abstraction has 1559 states and 3435 transitions. [2019-12-27 05:47:11,726 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 05:47:11,726 INFO L276 IsEmpty]: Start isEmpty. Operand 1559 states and 3435 transitions. [2019-12-27 05:47:11,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 05:47:11,728 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:47:11,728 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 05:47:11,729 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:47:11,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:47:11,729 INFO L82 PathProgramCache]: Analyzing trace with hash 935036584, now seen corresponding path program 1 times [2019-12-27 05:47:11,729 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:47:11,729 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461446798] [2019-12-27 05:47:11,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:47:11,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:47:11,808 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 05:47:11,809 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461446798] [2019-12-27 05:47:11,809 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:47:11,809 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 05:47:11,809 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147048657] [2019-12-27 05:47:11,810 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 05:47:11,810 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:47:11,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 05:47:11,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 05:47:11,811 INFO L87 Difference]: Start difference. First operand 1559 states and 3435 transitions. Second operand 6 states. [2019-12-27 05:47:12,032 WARN L192 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-12-27 05:47:12,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:47:12,500 INFO L93 Difference]: Finished difference Result 4279 states and 9333 transitions. [2019-12-27 05:47:12,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 05:47:12,500 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-27 05:47:12,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:47:12,506 INFO L225 Difference]: With dead ends: 4279 [2019-12-27 05:47:12,506 INFO L226 Difference]: Without dead ends: 4244 [2019-12-27 05:47:12,507 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-27 05:47:12,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4244 states. [2019-12-27 05:47:12,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4244 to 1893. [2019-12-27 05:47:12,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1893 states. [2019-12-27 05:47:12,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1893 states to 1893 states and 4248 transitions. [2019-12-27 05:47:12,554 INFO L78 Accepts]: Start accepts. Automaton has 1893 states and 4248 transitions. Word has length 25 [2019-12-27 05:47:12,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:47:12,554 INFO L462 AbstractCegarLoop]: Abstraction has 1893 states and 4248 transitions. [2019-12-27 05:47:12,555 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 05:47:12,555 INFO L276 IsEmpty]: Start isEmpty. Operand 1893 states and 4248 transitions. [2019-12-27 05:47:12,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 05:47:12,558 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:47:12,558 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 05:47:12,558 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:47:12,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:47:12,558 INFO L82 PathProgramCache]: Analyzing trace with hash -1584123616, now seen corresponding path program 1 times [2019-12-27 05:47:12,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:47:12,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115954125] [2019-12-27 05:47:12,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:47:12,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:47:12,629 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 05:47:12,630 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115954125] [2019-12-27 05:47:12,630 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:47:12,630 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 05:47:12,630 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073155590] [2019-12-27 05:47:12,631 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 05:47:12,631 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:47:12,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 05:47:12,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 05:47:12,631 INFO L87 Difference]: Start difference. First operand 1893 states and 4248 transitions. Second operand 6 states. [2019-12-27 05:47:13,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:47:13,167 INFO L93 Difference]: Finished difference Result 3982 states and 8624 transitions. [2019-12-27 05:47:13,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 05:47:13,167 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-12-27 05:47:13,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:47:13,172 INFO L225 Difference]: With dead ends: 3982 [2019-12-27 05:47:13,172 INFO L226 Difference]: Without dead ends: 3953 [2019-12-27 05:47:13,172 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-27 05:47:13,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3953 states. [2019-12-27 05:47:13,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3953 to 1860. [2019-12-27 05:47:13,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1860 states. [2019-12-27 05:47:13,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1860 states to 1860 states and 4196 transitions. [2019-12-27 05:47:13,220 INFO L78 Accepts]: Start accepts. Automaton has 1860 states and 4196 transitions. Word has length 26 [2019-12-27 05:47:13,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:47:13,220 INFO L462 AbstractCegarLoop]: Abstraction has 1860 states and 4196 transitions. [2019-12-27 05:47:13,220 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 05:47:13,221 INFO L276 IsEmpty]: Start isEmpty. Operand 1860 states and 4196 transitions. [2019-12-27 05:47:13,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 05:47:13,223 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:47:13,224 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 05:47:13,224 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:47:13,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:47:13,224 INFO L82 PathProgramCache]: Analyzing trace with hash 1884987326, now seen corresponding path program 1 times [2019-12-27 05:47:13,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:47:13,225 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573548746] [2019-12-27 05:47:13,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:47:13,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:47:13,264 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 05:47:13,265 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573548746] [2019-12-27 05:47:13,265 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:47:13,265 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:47:13,265 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983177379] [2019-12-27 05:47:13,266 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:47:13,266 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:47:13,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:47:13,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:47:13,267 INFO L87 Difference]: Start difference. First operand 1860 states and 4196 transitions. Second operand 3 states. [2019-12-27 05:47:13,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:47:13,287 INFO L93 Difference]: Finished difference Result 3366 states and 7600 transitions. [2019-12-27 05:47:13,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:47:13,288 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-27 05:47:13,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:47:13,291 INFO L225 Difference]: With dead ends: 3366 [2019-12-27 05:47:13,291 INFO L226 Difference]: Without dead ends: 1785 [2019-12-27 05:47:13,291 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 05:47:13,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1785 states. [2019-12-27 05:47:13,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1785 to 1757. [2019-12-27 05:47:13,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1757 states. [2019-12-27 05:47:13,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1757 states to 1757 states and 3881 transitions. [2019-12-27 05:47:13,322 INFO L78 Accepts]: Start accepts. Automaton has 1757 states and 3881 transitions. Word has length 27 [2019-12-27 05:47:13,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:47:13,323 INFO L462 AbstractCegarLoop]: Abstraction has 1757 states and 3881 transitions. [2019-12-27 05:47:13,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:47:13,323 INFO L276 IsEmpty]: Start isEmpty. Operand 1757 states and 3881 transitions. [2019-12-27 05:47:13,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 05:47:13,327 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:47:13,328 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 05:47:13,328 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:47:13,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:47:13,328 INFO L82 PathProgramCache]: Analyzing trace with hash -1012801820, now seen corresponding path program 1 times [2019-12-27 05:47:13,329 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:47:13,329 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122947829] [2019-12-27 05:47:13,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:47:13,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:47:13,478 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 05:47:13,481 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122947829] [2019-12-27 05:47:13,481 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:47:13,481 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 05:47:13,482 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702782777] [2019-12-27 05:47:13,482 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 05:47:13,482 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:47:13,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 05:47:13,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:47:13,483 INFO L87 Difference]: Start difference. First operand 1757 states and 3881 transitions. Second operand 5 states. [2019-12-27 05:47:13,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:47:13,538 INFO L93 Difference]: Finished difference Result 903 states and 1952 transitions. [2019-12-27 05:47:13,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 05:47:13,538 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-27 05:47:13,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:47:13,540 INFO L225 Difference]: With dead ends: 903 [2019-12-27 05:47:13,540 INFO L226 Difference]: Without dead ends: 733 [2019-12-27 05:47:13,541 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 05:47:13,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2019-12-27 05:47:13,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 733. [2019-12-27 05:47:13,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 733 states. [2019-12-27 05:47:13,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 733 states to 733 states and 1633 transitions. [2019-12-27 05:47:13,558 INFO L78 Accepts]: Start accepts. Automaton has 733 states and 1633 transitions. Word has length 28 [2019-12-27 05:47:13,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:47:13,559 INFO L462 AbstractCegarLoop]: Abstraction has 733 states and 1633 transitions. [2019-12-27 05:47:13,559 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 05:47:13,559 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 1633 transitions. [2019-12-27 05:47:13,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 05:47:13,563 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:47:13,563 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 05:47:13,563 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:47:13,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:47:13,564 INFO L82 PathProgramCache]: Analyzing trace with hash -646981299, now seen corresponding path program 1 times [2019-12-27 05:47:13,564 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:47:13,565 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250084389] [2019-12-27 05:47:13,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:47:13,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:47:13,697 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 05:47:13,698 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250084389] [2019-12-27 05:47:13,698 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:47:13,698 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 05:47:13,698 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071078082] [2019-12-27 05:47:13,699 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 05:47:13,699 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:47:13,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 05:47:13,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 05:47:13,700 INFO L87 Difference]: Start difference. First operand 733 states and 1633 transitions. Second operand 7 states. [2019-12-27 05:47:13,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:47:13,893 INFO L93 Difference]: Finished difference Result 1463 states and 3172 transitions. [2019-12-27 05:47:13,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 05:47:13,894 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-12-27 05:47:13,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:47:13,895 INFO L225 Difference]: With dead ends: 1463 [2019-12-27 05:47:13,895 INFO L226 Difference]: Without dead ends: 978 [2019-12-27 05:47:13,896 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-27 05:47:13,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2019-12-27 05:47:13,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 807. [2019-12-27 05:47:13,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 807 states. [2019-12-27 05:47:13,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 1757 transitions. [2019-12-27 05:47:13,909 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 1757 transitions. Word has length 52 [2019-12-27 05:47:13,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:47:13,909 INFO L462 AbstractCegarLoop]: Abstraction has 807 states and 1757 transitions. [2019-12-27 05:47:13,909 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 05:47:13,910 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 1757 transitions. [2019-12-27 05:47:13,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 05:47:13,912 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:47:13,912 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 05:47:13,912 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:47:13,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:47:13,913 INFO L82 PathProgramCache]: Analyzing trace with hash -643986163, now seen corresponding path program 2 times [2019-12-27 05:47:13,913 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:47:13,913 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743404849] [2019-12-27 05:47:13,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:47:13,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:47:14,007 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 05:47:14,007 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743404849] [2019-12-27 05:47:14,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:47:14,008 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:47:14,008 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179729648] [2019-12-27 05:47:14,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:47:14,008 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:47:14,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:47:14,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:47:14,009 INFO L87 Difference]: Start difference. First operand 807 states and 1757 transitions. Second operand 3 states. [2019-12-27 05:47:14,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:47:14,060 INFO L93 Difference]: Finished difference Result 1023 states and 2206 transitions. [2019-12-27 05:47:14,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:47:14,060 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 05:47:14,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:47:14,062 INFO L225 Difference]: With dead ends: 1023 [2019-12-27 05:47:14,062 INFO L226 Difference]: Without dead ends: 1023 [2019-12-27 05:47:14,062 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 05:47:14,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1023 states. [2019-12-27 05:47:14,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1023 to 721. [2019-12-27 05:47:14,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 721 states. [2019-12-27 05:47:14,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 1553 transitions. [2019-12-27 05:47:14,074 INFO L78 Accepts]: Start accepts. Automaton has 721 states and 1553 transitions. Word has length 52 [2019-12-27 05:47:14,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:47:14,075 INFO L462 AbstractCegarLoop]: Abstraction has 721 states and 1553 transitions. [2019-12-27 05:47:14,075 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:47:14,075 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 1553 transitions. [2019-12-27 05:47:14,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 05:47:14,077 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:47:14,077 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 05:47:14,077 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:47:14,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:47:14,078 INFO L82 PathProgramCache]: Analyzing trace with hash -87902062, now seen corresponding path program 1 times [2019-12-27 05:47:14,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:47:14,078 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204527768] [2019-12-27 05:47:14,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:47:14,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 05:47:14,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 05:47:14,469 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 05:47:14,470 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 05:47:14,473 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] ULTIMATE.startENTRY-->L797: Formula: (let ((.cse0 (store |v_#valid_46| 0 0))) (and (= 0 v_~y$w_buff0~0_26) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y$r_buff0_thd2~0_77 0) (= 0 v_~__unbuffered_cnt~0_13) (= 0 v_~__unbuffered_p1_EAX~0_12) (= 0 v_~y$r_buff1_thd2~0_53) (= 0 v_~y$r_buff1_thd0~0_22) (= 0 v_~weak$$choice0~0_5) (= v_~y$r_buff0_thd0~0_24 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t587~0.base_22| 4)) (= 0 v_~y$w_buff1~0_25) (= 0 v_~y$r_buff1_thd1~0_21) (= v_~y$w_buff0_used~0_103 0) (= 0 v_~y$flush_delayed~0_14) (= |v_ULTIMATE.start_main_~#t587~0.offset_17| 0) (= v_~y$read_delayed~0_6 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t587~0.base_22|)) (= v_~y$mem_tmp~0_11 0) (= v_~x~0_17 0) (= v_~y$r_buff0_thd1~0_29 0) (= 0 |v_#NULL.base_4|) (= 0 v_~weak$$choice2~0_33) (= 0 v_~y$read_delayed_var~0.base_7) (= |v_#valid_44| (store .cse0 |v_ULTIMATE.start_main_~#t587~0.base_22| 1)) (= v_~main$tmp_guard1~0_15 0) (= |v_#NULL.offset_4| 0) (= v_~y$w_buff1_used~0_67 0) (= v_~__unbuffered_p1_EBX~0_13 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t587~0.base_22| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t587~0.base_22|) |v_ULTIMATE.start_main_~#t587~0.offset_17| 0)) |v_#memory_int_17|) (= v_~main$tmp_guard0~0_11 0) (= v_~y~0_26 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t587~0.base_22|) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_103, ULTIMATE.start_main_~#t588~0.offset=|v_ULTIMATE.start_main_~#t588~0.offset_15|, #NULL.offset=|v_#NULL.offset_4|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_10|, ULTIMATE.start_main_~#t587~0.base=|v_ULTIMATE.start_main_~#t587~0.base_22|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_10|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_20|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_10|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_21, ~y$mem_tmp~0=v_~y$mem_tmp~0_11, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_12, ULTIMATE.start_main_~#t587~0.offset=|v_ULTIMATE.start_main_~#t587~0.offset_17|, ULTIMATE.start_main_~#t588~0.base=|v_ULTIMATE.start_main_~#t588~0.base_18|, ~y$w_buff0~0=v_~y$w_buff0~0_26, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_29, ~y$flush_delayed~0=v_~y$flush_delayed~0_14, #length=|v_#length_17|, ~y~0=v_~y~0_26, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_13, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_11, #NULL.base=|v_#NULL.base_4|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_53, ~weak$$choice0~0=v_~weak$$choice0~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_12|, ~y$w_buff1~0=v_~y$w_buff1~0_25, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_24, #valid=|v_#valid_44|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_77, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_7|, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_22, ~x~0=v_~x~0_17, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_67} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_~#t588~0.offset, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_~#t587~0.base, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t587~0.offset, ULTIMATE.start_main_~#t588~0.base, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ~__unbuffered_p1_EBX~0, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 05:47:14,475 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L797-1-->L799: Formula: (and (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t588~0.base_12| 4)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t588~0.base_12|) (not (= 0 |v_ULTIMATE.start_main_~#t588~0.base_12|)) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t588~0.base_12|) 0) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t588~0.base_12| 1)) (= |v_ULTIMATE.start_main_~#t588~0.offset_10| 0) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t588~0.base_12| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t588~0.base_12|) |v_ULTIMATE.start_main_~#t588~0.offset_10| 1)))) 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_~#t588~0.base=|v_ULTIMATE.start_main_~#t588~0.base_12|, ULTIMATE.start_main_~#t588~0.offset=|v_ULTIMATE.start_main_~#t588~0.offset_10|, #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|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t588~0.base, ULTIMATE.start_main_~#t588~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-27 05:47:14,476 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L4-->L738: Formula: (and (= v_~y$r_buff0_thd1~0_17 v_~y$r_buff1_thd1~0_11) (= 1 v_~x~0_5) (= v_~y$r_buff0_thd2~0_55 v_~y$r_buff1_thd2~0_33) (not (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_6 0)) (= v_~y$r_buff0_thd1~0_16 1) (= v_~y$r_buff0_thd0~0_15 v_~y$r_buff1_thd0~0_10)) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_15, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_17, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_55, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_6} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_33, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_11, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_15, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_16, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_55, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_6, ~x~0=v_~x~0_5, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_10} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff0_thd1~0, ~x~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 05:47:14,480 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L739-->L739-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-934076006 256))) (.cse0 (= (mod ~y$r_buff0_thd1~0_In-934076006 256) 0))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-934076006|) (not .cse0) (not .cse1)) (and (= ~y$w_buff0_used~0_In-934076006 |P0Thread1of1ForFork0_#t~ite5_Out-934076006|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-934076006, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-934076006} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-934076006|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-934076006, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-934076006} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 05:47:14,482 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L740-->L740-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In312120454 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd1~0_In312120454 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In312120454 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd1~0_In312120454 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite6_Out312120454| ~y$w_buff1_used~0_In312120454) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork0_#t~ite6_Out312120454| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In312120454, ~y$w_buff0_used~0=~y$w_buff0_used~0_In312120454, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In312120454, ~y$w_buff1_used~0=~y$w_buff1_used~0_In312120454} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out312120454|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In312120454, ~y$w_buff0_used~0=~y$w_buff0_used~0_In312120454, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In312120454, ~y$w_buff1_used~0=~y$w_buff1_used~0_In312120454} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 05:47:14,483 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L741-->L742: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In58377473 256))) (.cse1 (= (mod ~y$r_buff0_thd1~0_In58377473 256) 0))) (or (and (not .cse0) (= ~y$r_buff0_thd1~0_Out58377473 0) (not .cse1)) (and (or .cse0 .cse1) (= ~y$r_buff0_thd1~0_Out58377473 ~y$r_buff0_thd1~0_In58377473)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In58377473, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In58377473} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In58377473, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out58377473|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out58377473} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 05:47:14,483 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L763-->L763-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1990779891 256) 0))) (or (and .cse0 (= |P1Thread1of1ForFork1_#t~ite14_Out1990779891| |P1Thread1of1ForFork1_#t~ite15_Out1990779891|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1990779891 256)))) (or (and (= (mod ~y$w_buff1_used~0_In1990779891 256) 0) .cse1) (= 0 (mod ~y$w_buff0_used~0_In1990779891 256)) (and (= 0 (mod ~y$r_buff1_thd2~0_In1990779891 256)) .cse1))) (= ~y$w_buff0~0_In1990779891 |P1Thread1of1ForFork1_#t~ite14_Out1990779891|)) (and (= ~y$w_buff0~0_In1990779891 |P1Thread1of1ForFork1_#t~ite15_Out1990779891|) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite14_In1990779891| |P1Thread1of1ForFork1_#t~ite14_Out1990779891|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1990779891, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1990779891, ~y$w_buff0~0=~y$w_buff0~0_In1990779891, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1990779891, ~weak$$choice2~0=~weak$$choice2~0_In1990779891, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In1990779891|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1990779891} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1990779891, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1990779891, ~y$w_buff0~0=~y$w_buff0~0_In1990779891, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1990779891, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out1990779891|, ~weak$$choice2~0=~weak$$choice2~0_In1990779891, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out1990779891|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1990779891} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 05:47:14,484 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L764-->L764-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1646426484 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite17_In-1646426484| |P1Thread1of1ForFork1_#t~ite17_Out-1646426484|) (= |P1Thread1of1ForFork1_#t~ite18_Out-1646426484| ~y$w_buff1~0_In-1646426484)) (and (= |P1Thread1of1ForFork1_#t~ite17_Out-1646426484| ~y$w_buff1~0_In-1646426484) (= |P1Thread1of1ForFork1_#t~ite18_Out-1646426484| |P1Thread1of1ForFork1_#t~ite17_Out-1646426484|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1646426484 256)))) (or (= 0 (mod ~y$w_buff0_used~0_In-1646426484 256)) (and .cse1 (= (mod ~y$r_buff1_thd2~0_In-1646426484 256) 0)) (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In-1646426484 256))))) .cse0))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1646426484, ~y$w_buff1~0=~y$w_buff1~0_In-1646426484, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1646426484, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1646426484, ~weak$$choice2~0=~weak$$choice2~0_In-1646426484, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_In-1646426484|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1646426484} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1646426484, P1Thread1of1ForFork1_#t~ite18=|P1Thread1of1ForFork1_#t~ite18_Out-1646426484|, ~y$w_buff1~0=~y$w_buff1~0_In-1646426484, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1646426484, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1646426484, ~weak$$choice2~0=~weak$$choice2~0_In-1646426484, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_Out-1646426484|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1646426484} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite18, P1Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-12-27 05:47:14,485 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L765-->L765-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In1968725854 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite20_Out1968725854| ~y$w_buff0_used~0_In1968725854) (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In1968725854 256) 0))) (or (= (mod ~y$w_buff0_used~0_In1968725854 256) 0) (and .cse0 (= 0 (mod ~y$w_buff1_used~0_In1968725854 256))) (and (= (mod ~y$r_buff1_thd2~0_In1968725854 256) 0) .cse0))) .cse1 (= |P1Thread1of1ForFork1_#t~ite20_Out1968725854| |P1Thread1of1ForFork1_#t~ite21_Out1968725854|)) (and (= |P1Thread1of1ForFork1_#t~ite21_Out1968725854| ~y$w_buff0_used~0_In1968725854) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite20_In1968725854| |P1Thread1of1ForFork1_#t~ite20_Out1968725854|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1968725854, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1968725854, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In1968725854|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1968725854, ~weak$$choice2~0=~weak$$choice2~0_In1968725854, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1968725854} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1968725854, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1968725854, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out1968725854|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1968725854, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out1968725854|, ~weak$$choice2~0=~weak$$choice2~0_In1968725854, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1968725854} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-27 05:47:14,487 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L767-->L768: Formula: (and (= v_~y$r_buff0_thd2~0_61 v_~y$r_buff0_thd2~0_60) (not (= 0 (mod v_~weak$$choice2~0_20 256)))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_61, ~weak$$choice2~0=v_~weak$$choice2~0_20} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_60, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_9|, ~weak$$choice2~0=v_~weak$$choice2~0_20, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_8|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_9|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-27 05:47:14,487 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L768-->L768-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-809658966 256) 0))) (or (and (= ~y$r_buff1_thd2~0_In-809658966 |P1Thread1of1ForFork1_#t~ite30_Out-809658966|) (= |P1Thread1of1ForFork1_#t~ite29_In-809658966| |P1Thread1of1ForFork1_#t~ite29_Out-809658966|) (not .cse0)) (and (= |P1Thread1of1ForFork1_#t~ite29_Out-809658966| ~y$r_buff1_thd2~0_In-809658966) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-809658966 256)))) (or (and .cse1 (= (mod ~y$w_buff1_used~0_In-809658966 256) 0)) (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-809658966 256))) (= (mod ~y$w_buff0_used~0_In-809658966 256) 0))) (= |P1Thread1of1ForFork1_#t~ite29_Out-809658966| |P1Thread1of1ForFork1_#t~ite30_Out-809658966|) .cse0))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-809658966, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In-809658966|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-809658966, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-809658966, ~weak$$choice2~0=~weak$$choice2~0_In-809658966, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-809658966} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-809658966, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-809658966|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-809658966|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-809658966, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-809658966, ~weak$$choice2~0=~weak$$choice2~0_In-809658966, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-809658966} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-27 05:47:14,487 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L742-->L742-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd1~0_In-2039378248 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-2039378248 256))) (.cse3 (= (mod ~y$r_buff0_thd1~0_In-2039378248 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-2039378248 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd1~0_In-2039378248 |P0Thread1of1ForFork0_#t~ite8_Out-2039378248|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out-2039378248|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-2039378248, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2039378248, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-2039378248, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2039378248} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-2039378248, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2039378248, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-2039378248|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-2039378248, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2039378248} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 05:47:14,487 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [733] [733] L742-2-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_7 (+ v_~__unbuffered_cnt~0_8 1)) (= |v_P0Thread1of1ForFork0_#t~ite8_8| v_~y$r_buff1_thd1~0_16) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_16, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_7} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 05:47:14,488 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L770-->L774: Formula: (and (= 0 v_~y$flush_delayed~0_6) (not (= 0 (mod v_~y$flush_delayed~0_7 256))) (= v_~y~0_15 v_~y$mem_tmp~0_5)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_7} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_5, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~y$flush_delayed~0=v_~y$flush_delayed~0_6, ~y~0=v_~y~0_15} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-27 05:47:14,489 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L774-2-->L774-4: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In-540129146 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd2~0_In-540129146 256) 0))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite32_Out-540129146| ~y$w_buff1~0_In-540129146)) (and (or .cse0 .cse1) (= ~y~0_In-540129146 |P1Thread1of1ForFork1_#t~ite32_Out-540129146|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-540129146, ~y$w_buff1~0=~y$w_buff1~0_In-540129146, ~y~0=~y~0_In-540129146, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-540129146} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-540129146, ~y$w_buff1~0=~y$w_buff1~0_In-540129146, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-540129146|, ~y~0=~y~0_In-540129146, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-540129146} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-27 05:47:14,489 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L774-4-->L775: Formula: (= v_~y~0_16 |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|, ~y~0=v_~y~0_16} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~y~0] because there is no mapped edge [2019-12-27 05:47:14,489 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L775-->L775-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In1832613050 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In1832613050 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite34_Out1832613050| ~y$w_buff0_used~0_In1832613050) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite34_Out1832613050|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1832613050, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1832613050} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1832613050, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1832613050, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out1832613050|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 05:47:14,490 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L776-->L776-2: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd2~0_In-97030128 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In-97030128 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd2~0_In-97030128 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In-97030128 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite35_Out-97030128| ~y$w_buff1_used~0_In-97030128)) (and (= |P1Thread1of1ForFork1_#t~ite35_Out-97030128| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-97030128, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-97030128, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-97030128, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-97030128} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-97030128, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-97030128, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-97030128, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-97030128|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-97030128} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 05:47:14,491 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L777-->L777-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In234393365 256))) (.cse0 (= (mod ~y$r_buff0_thd2~0_In234393365 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite36_Out234393365|) (not .cse0) (not .cse1)) (and (= ~y$r_buff0_thd2~0_In234393365 |P1Thread1of1ForFork1_#t~ite36_Out234393365|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In234393365, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In234393365} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In234393365, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In234393365, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out234393365|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 05:47:14,492 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L778-->L778-2: Formula: (let ((.cse2 (= (mod ~y$w_buff1_used~0_In-1285663090 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In-1285663090 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1285663090 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1285663090 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite37_Out-1285663090| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite37_Out-1285663090| ~y$r_buff1_thd2~0_In-1285663090) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1285663090, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1285663090, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1285663090, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1285663090} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1285663090, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1285663090, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1285663090, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-1285663090|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1285663090} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 05:47:14,492 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L778-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~y$r_buff1_thd2~0_45 |v_P1Thread1of1ForFork1_#t~ite37_8|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_11 1) v_~__unbuffered_cnt~0_10)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_8|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_45, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_7|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 05:47:14,493 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L803-->L805-2: Formula: (and (or (= 0 (mod v_~y$w_buff0_used~0_82 256)) (= (mod v_~y$r_buff0_thd0~0_17 256) 0)) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_82, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_17, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_82, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_17, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 05:47:14,493 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L805-2-->L805-4: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In2120985351 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In2120985351 256)))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out2120985351| ~y~0_In2120985351) (or .cse0 .cse1)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite40_Out2120985351| ~y$w_buff1~0_In2120985351) (not .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In2120985351, ~y~0=~y~0_In2120985351, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2120985351, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2120985351} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out2120985351|, ~y$w_buff1~0=~y$w_buff1~0_In2120985351, ~y~0=~y~0_In2120985351, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2120985351, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2120985351} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 05:47:14,493 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L805-4-->L806: Formula: (= v_~y~0_18 |v_ULTIMATE.start_main_#t~ite40_7|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_7|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_6|, ~y~0=v_~y~0_18} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-12-27 05:47:14,493 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L806-->L806-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1505391991 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1505391991 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite42_Out1505391991|) (not .cse1)) (and (= ~y$w_buff0_used~0_In1505391991 |ULTIMATE.start_main_#t~ite42_Out1505391991|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1505391991, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1505391991} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1505391991, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1505391991, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out1505391991|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 05:47:14,494 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L807-->L807-2: Formula: (let ((.cse2 (= (mod ~y$w_buff1_used~0_In809874520 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In809874520 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In809874520 256))) (.cse1 (= (mod ~y$r_buff0_thd0~0_In809874520 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite43_Out809874520|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~y$w_buff1_used~0_In809874520 |ULTIMATE.start_main_#t~ite43_Out809874520|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In809874520, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In809874520, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In809874520, ~y$w_buff1_used~0=~y$w_buff1_used~0_In809874520} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In809874520, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In809874520, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out809874520|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In809874520, ~y$w_buff1_used~0=~y$w_buff1_used~0_In809874520} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 05:47:14,495 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L808-->L808-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1326976873 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In1326976873 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite44_Out1326976873| 0)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite44_Out1326976873| ~y$r_buff0_thd0~0_In1326976873)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1326976873, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1326976873} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1326976873, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1326976873, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out1326976873|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 05:47:14,496 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L809-->L809-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In591961770 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In591961770 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In591961770 256))) (.cse2 (= (mod ~y$r_buff0_thd0~0_In591961770 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite45_Out591961770|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse3 .cse2) (= ~y$r_buff1_thd0~0_In591961770 |ULTIMATE.start_main_#t~ite45_Out591961770|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In591961770, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In591961770, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In591961770, ~y$w_buff1_used~0=~y$w_buff1_used~0_In591961770} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In591961770, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In591961770, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In591961770, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out591961770|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In591961770} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 05:47:14,496 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L809-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start_main_#t~ite45_10| v_~y$r_buff1_thd0~0_14) (= 2 v_~__unbuffered_p1_EAX~0_7) (= 0 v_~__unbuffered_p1_EBX~0_8) (= v_~main$tmp_guard1~0_7 0) (= (mod v_~main$tmp_guard1~0_7 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= 2 v_~x~0_9) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_7, ~x~0=v_~x~0_9, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_10|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_7, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~x~0=v_~x~0_9, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_14, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_9|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 05:47:14,583 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 05:47:14 BasicIcfg [2019-12-27 05:47:14,583 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 05:47:14,585 INFO L168 Benchmark]: Toolchain (without parser) took 14203.09 ms. Allocated memory was 137.9 MB in the beginning and 640.2 MB in the end (delta: 502.3 MB). Free memory was 101.0 MB in the beginning and 578.8 MB in the end (delta: -477.8 MB). Peak memory consumption was 560.7 MB. Max. memory is 7.1 GB. [2019-12-27 05:47:14,586 INFO L168 Benchmark]: CDTParser took 1.26 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 05:47:14,587 INFO L168 Benchmark]: CACSL2BoogieTranslator took 772.23 ms. Allocated memory was 137.9 MB in the beginning and 202.9 MB in the end (delta: 65.0 MB). Free memory was 100.8 MB in the beginning and 155.3 MB in the end (delta: -54.5 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. [2019-12-27 05:47:14,587 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.09 ms. Allocated memory is still 202.9 MB. Free memory was 155.3 MB in the beginning and 152.4 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-27 05:47:14,588 INFO L168 Benchmark]: Boogie Preprocessor took 44.90 ms. Allocated memory is still 202.9 MB. Free memory was 152.4 MB in the beginning and 150.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-27 05:47:14,589 INFO L168 Benchmark]: RCFGBuilder took 827.93 ms. Allocated memory is still 202.9 MB. Free memory was 150.3 MB in the beginning and 105.8 MB in the end (delta: 44.5 MB). Peak memory consumption was 44.5 MB. Max. memory is 7.1 GB. [2019-12-27 05:47:14,590 INFO L168 Benchmark]: TraceAbstraction took 12481.99 ms. Allocated memory was 202.9 MB in the beginning and 640.2 MB in the end (delta: 437.3 MB). Free memory was 105.8 MB in the beginning and 578.8 MB in the end (delta: -473.0 MB). Peak memory consumption was 500.5 MB. Max. memory is 7.1 GB. [2019-12-27 05:47:14,594 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.26 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 772.23 ms. Allocated memory was 137.9 MB in the beginning and 202.9 MB in the end (delta: 65.0 MB). Free memory was 100.8 MB in the beginning and 155.3 MB in the end (delta: -54.5 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 70.09 ms. Allocated memory is still 202.9 MB. Free memory was 155.3 MB in the beginning and 152.4 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 44.90 ms. Allocated memory is still 202.9 MB. Free memory was 152.4 MB in the beginning and 150.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 827.93 ms. Allocated memory is still 202.9 MB. Free memory was 150.3 MB in the beginning and 105.8 MB in the end (delta: 44.5 MB). Peak memory consumption was 44.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12481.99 ms. Allocated memory was 202.9 MB in the beginning and 640.2 MB in the end (delta: 437.3 MB). Free memory was 105.8 MB in the beginning and 578.8 MB in the end (delta: -473.0 MB). Peak memory consumption was 500.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.6s, 147 ProgramPointsBefore, 79 ProgramPointsAfterwards, 181 TransitionsBefore, 89 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 8 FixpointIterations, 29 TrivialSequentialCompositions, 38 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 27 ChoiceCompositions, 4371 VarBasedMoverChecksPositive, 158 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 55625 CheckedPairsTotal, 98 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(&t587, ((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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L724] 1 y$w_buff1 = y$w_buff0 [L725] 1 y$w_buff0 = 1 [L726] 1 y$w_buff1_used = y$w_buff0_used [L727] 1 y$w_buff0_used = (_Bool)1 [L799] FCALL, FORK 0 pthread_create(&t588, ((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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) 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=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L752] 2 x = 2 [L755] 2 __unbuffered_p1_EAX = x [L758] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L759] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L760] 2 y$flush_delayed = weak$$choice2 [L761] 2 y$mem_tmp = y 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=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L762] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$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=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L762] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L739] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L740] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L763] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L764] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L765] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L766] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) 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=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L766] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L768] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L769] 2 __unbuffered_p1_EBX = y 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=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L774] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) 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=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L775] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L776] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L777] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$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=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L806] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L807] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L808] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 141 locations, 2 error locations. Result: UNSAFE, OverallTime: 12.1s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1447 SDtfs, 1583 SDslu, 2340 SDs, 0 SdLazy, 1197 SolverSat, 97 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 63 GetRequests, 14 SyntacticMatches, 3 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12389occurred 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: 3.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 7887 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 341 NumberOfCodeBlocks, 341 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 276 ConstructedInterpolants, 0 QuantifiedInterpolants, 23814 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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...