/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-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix044_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 21:18:08,277 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 21:18:08,280 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 21:18:08,292 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 21:18:08,293 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 21:18:08,294 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 21:18:08,295 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 21:18:08,299 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 21:18:08,301 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 21:18:08,306 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 21:18:08,310 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 21:18:08,311 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 21:18:08,311 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 21:18:08,314 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 21:18:08,315 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 21:18:08,316 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 21:18:08,317 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 21:18:08,317 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 21:18:08,321 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 21:18:08,323 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 21:18:08,328 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 21:18:08,330 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 21:18:08,333 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 21:18:08,334 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 21:18:08,339 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 21:18:08,339 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 21:18:08,340 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 21:18:08,341 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 21:18:08,343 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 21:18:08,345 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 21:18:08,345 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 21:18:08,347 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 21:18:08,348 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 21:18:08,350 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 21:18:08,353 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 21:18:08,353 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 21:18:08,354 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 21:18:08,354 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 21:18:08,354 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 21:18:08,357 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 21:18:08,358 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 21:18:08,359 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-MCR.epf [2019-12-27 21:18:08,393 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 21:18:08,393 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 21:18:08,397 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 21:18:08,398 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 21:18:08,398 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 21:18:08,398 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 21:18:08,398 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 21:18:08,399 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 21:18:08,399 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 21:18:08,399 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 21:18:08,399 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 21:18:08,399 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 21:18:08,402 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 21:18:08,402 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 21:18:08,402 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 21:18:08,402 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 21:18:08,403 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 21:18:08,403 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 21:18:08,403 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 21:18:08,403 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 21:18:08,403 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 21:18:08,404 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 21:18:08,404 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 21:18:08,404 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 21:18:08,404 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 21:18:08,408 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 21:18:08,408 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 21:18:08,408 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 21:18:08,409 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 21:18:08,409 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 21:18:08,409 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 21:18:08,409 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 21:18:08,739 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 21:18:08,752 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 21:18:08,755 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 21:18:08,757 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 21:18:08,757 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 21:18:08,758 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix044_tso.opt.i [2019-12-27 21:18:08,825 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/619a63ba2/27164f67150145eaa7d7bfb87aeb91ec/FLAG5e3329e18 [2019-12-27 21:18:09,363 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 21:18:09,363 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix044_tso.opt.i [2019-12-27 21:18:09,389 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/619a63ba2/27164f67150145eaa7d7bfb87aeb91ec/FLAG5e3329e18 [2019-12-27 21:18:09,650 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/619a63ba2/27164f67150145eaa7d7bfb87aeb91ec [2019-12-27 21:18:09,659 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 21:18:09,661 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 21:18:09,662 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 21:18:09,662 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 21:18:09,665 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 21:18:09,666 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:18:09" (1/1) ... [2019-12-27 21:18:09,669 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ad31de0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:18:09, skipping insertion in model container [2019-12-27 21:18:09,669 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:18:09" (1/1) ... [2019-12-27 21:18:09,678 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 21:18:09,732 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 21:18:10,295 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:18:10,313 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 21:18:10,404 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:18:10,479 INFO L208 MainTranslator]: Completed translation [2019-12-27 21:18:10,480 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:18:10 WrapperNode [2019-12-27 21:18:10,480 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 21:18:10,481 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 21:18:10,481 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 21:18:10,481 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 21:18:10,490 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:18:10" (1/1) ... [2019-12-27 21:18:10,511 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:18:10" (1/1) ... [2019-12-27 21:18:10,550 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 21:18:10,551 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 21:18:10,551 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 21:18:10,551 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 21:18:10,560 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:18:10" (1/1) ... [2019-12-27 21:18:10,560 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:18:10" (1/1) ... [2019-12-27 21:18:10,565 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:18:10" (1/1) ... [2019-12-27 21:18:10,566 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:18:10" (1/1) ... [2019-12-27 21:18:10,587 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:18:10" (1/1) ... [2019-12-27 21:18:10,599 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:18:10" (1/1) ... [2019-12-27 21:18:10,604 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:18:10" (1/1) ... [2019-12-27 21:18:10,612 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 21:18:10,614 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 21:18:10,614 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 21:18:10,614 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 21:18:10,615 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:18:10" (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 21:18:10,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 21:18:10,677 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 21:18:10,677 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 21:18:10,678 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 21:18:10,678 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 21:18:10,678 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 21:18:10,678 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 21:18:10,678 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 21:18:10,678 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 21:18:10,679 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 21:18:10,679 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-27 21:18:10,679 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-27 21:18:10,679 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 21:18:10,679 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 21:18:10,680 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 21:18:10,682 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 21:18:11,453 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 21:18:11,453 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 21:18:11,454 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:18:11 BoogieIcfgContainer [2019-12-27 21:18:11,455 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 21:18:11,456 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 21:18:11,456 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 21:18:11,459 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 21:18:11,460 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 09:18:09" (1/3) ... [2019-12-27 21:18:11,461 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6907260b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:18:11, skipping insertion in model container [2019-12-27 21:18:11,461 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:18:10" (2/3) ... [2019-12-27 21:18:11,461 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6907260b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:18:11, skipping insertion in model container [2019-12-27 21:18:11,462 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:18:11" (3/3) ... [2019-12-27 21:18:11,463 INFO L109 eAbstractionObserver]: Analyzing ICFG mix044_tso.opt.i [2019-12-27 21:18:11,474 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 21:18:11,475 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 21:18:11,483 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 21:18:11,484 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 21:18:11,541 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:18:11,541 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:18:11,541 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:18:11,542 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:18:11,544 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:18:11,544 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:18:11,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:18:11,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:18:11,545 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:18:11,545 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:18:11,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:18:11,546 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:18:11,547 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:18:11,547 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:18:11,547 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:18:11,547 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:18:11,547 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:18:11,548 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:18:11,548 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:18:11,548 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:18:11,548 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:18:11,549 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:18:11,549 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:18:11,550 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:18:11,550 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:18:11,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:18:11,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:18:11,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:18:11,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:18:11,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:18:11,552 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:18:11,552 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:18:11,553 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:18:11,553 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:18:11,554 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:18:11,554 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:18:11,555 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:18:11,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:18:11,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:18:11,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:18:11,557 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:18:11,557 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:18:11,560 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:18:11,561 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:18:11,561 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:18:11,561 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:18:11,561 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:18:11,561 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:18:11,561 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:18:11,562 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:18:11,562 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:18:11,562 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:18:11,562 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:18:11,563 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:18:11,563 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:18:11,563 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:18:11,563 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:18:11,563 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:18:11,564 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:18:11,564 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:18:11,564 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:18:11,564 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:18:11,564 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:18:11,565 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:18:11,565 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:18:11,566 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:18:11,566 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:18:11,566 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:18:11,566 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:18:11,566 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:18:11,566 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:18:11,567 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:18:11,567 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:18:11,567 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:18:11,568 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:18:11,568 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:18:11,571 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:18:11,572 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:18:11,573 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:18:11,573 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:18:11,578 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:18:11,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:18:11,579 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:18:11,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:18:11,581 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:18:11,582 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:18:11,582 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:18:11,582 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:18:11,582 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:18:11,582 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:18:11,583 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:18:11,583 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:18:11,583 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:18:11,583 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:18:11,586 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:18:11,587 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:18:11,587 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:18:11,587 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:18:11,587 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:18:11,587 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:18:11,588 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:18:11,588 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:18:11,588 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:18:11,588 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:18:11,588 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:18:11,589 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:18:11,604 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-27 21:18:11,624 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 21:18:11,625 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 21:18:11,625 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 21:18:11,625 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 21:18:11,625 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 21:18:11,625 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 21:18:11,625 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 21:18:11,626 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 21:18:11,642 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 181 places, 209 transitions [2019-12-27 21:18:11,644 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 181 places, 209 transitions [2019-12-27 21:18:11,749 INFO L132 PetriNetUnfolder]: 41/205 cut-off events. [2019-12-27 21:18:11,750 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:18:11,766 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 205 events. 41/205 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 263 event pairs. 0/162 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-27 21:18:11,786 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 181 places, 209 transitions [2019-12-27 21:18:11,838 INFO L132 PetriNetUnfolder]: 41/205 cut-off events. [2019-12-27 21:18:11,839 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:18:11,845 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 205 events. 41/205 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 263 event pairs. 0/162 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-27 21:18:11,861 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12668 [2019-12-27 21:18:11,862 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 21:18:15,468 WARN L192 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-12-27 21:18:15,621 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-12-27 21:18:15,642 INFO L206 etLargeBlockEncoding]: Checked pairs total: 54567 [2019-12-27 21:18:15,642 INFO L214 etLargeBlockEncoding]: Total number of compositions: 117 [2019-12-27 21:18:15,645 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 93 places, 100 transitions [2019-12-27 21:18:18,197 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 39550 states. [2019-12-27 21:18:18,199 INFO L276 IsEmpty]: Start isEmpty. Operand 39550 states. [2019-12-27 21:18:18,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 21:18:18,208 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:18:18,209 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:18:18,210 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:18:18,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:18:18,216 INFO L82 PathProgramCache]: Analyzing trace with hash -1832018812, now seen corresponding path program 1 times [2019-12-27 21:18:18,228 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:18:18,228 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125750265] [2019-12-27 21:18:18,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:18:18,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:18:18,526 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 21:18:18,527 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125750265] [2019-12-27 21:18:18,527 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:18:18,528 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 21:18:18,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1164208564] [2019-12-27 21:18:18,531 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:18:18,535 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:18:18,551 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 10 states and 9 transitions. [2019-12-27 21:18:18,551 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:18:18,555 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:18:18,556 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:18:18,556 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:18:18,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:18:18,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:18:18,573 INFO L87 Difference]: Start difference. First operand 39550 states. Second operand 3 states. [2019-12-27 21:18:20,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:18:20,104 INFO L93 Difference]: Finished difference Result 36830 states and 156304 transitions. [2019-12-27 21:18:20,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:18:20,106 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-27 21:18:20,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:18:20,536 INFO L225 Difference]: With dead ends: 36830 [2019-12-27 21:18:20,536 INFO L226 Difference]: Without dead ends: 36102 [2019-12-27 21:18:20,538 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 21:18:21,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36102 states. [2019-12-27 21:18:22,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36102 to 36102. [2019-12-27 21:18:22,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36102 states. [2019-12-27 21:18:24,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36102 states to 36102 states and 153336 transitions. [2019-12-27 21:18:24,381 INFO L78 Accepts]: Start accepts. Automaton has 36102 states and 153336 transitions. Word has length 9 [2019-12-27 21:18:24,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:18:24,382 INFO L462 AbstractCegarLoop]: Abstraction has 36102 states and 153336 transitions. [2019-12-27 21:18:24,382 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:18:24,382 INFO L276 IsEmpty]: Start isEmpty. Operand 36102 states and 153336 transitions. [2019-12-27 21:18:24,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 21:18:24,395 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:18:24,395 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:18:24,396 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:18:24,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:18:24,396 INFO L82 PathProgramCache]: Analyzing trace with hash 1657144856, now seen corresponding path program 1 times [2019-12-27 21:18:24,397 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:18:24,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565999019] [2019-12-27 21:18:24,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:18:24,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:18:24,563 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 21:18:24,564 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565999019] [2019-12-27 21:18:24,564 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:18:24,564 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:18:24,565 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1536770049] [2019-12-27 21:18:24,566 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:18:24,568 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:18:24,577 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 39 transitions. [2019-12-27 21:18:24,577 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:18:24,619 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:18:24,621 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:18:24,622 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:18:24,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:18:24,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:18:24,622 INFO L87 Difference]: Start difference. First operand 36102 states and 153336 transitions. Second operand 5 states. [2019-12-27 21:18:25,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:18:25,755 INFO L93 Difference]: Finished difference Result 56134 states and 230968 transitions. [2019-12-27 21:18:25,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:18:25,756 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-12-27 21:18:25,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:18:26,469 INFO L225 Difference]: With dead ends: 56134 [2019-12-27 21:18:26,470 INFO L226 Difference]: Without dead ends: 56106 [2019-12-27 21:18:26,471 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:18:26,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56106 states. [2019-12-27 21:18:28,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56106 to 50070. [2019-12-27 21:18:28,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50070 states. [2019-12-27 21:18:31,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50070 states to 50070 states and 208456 transitions. [2019-12-27 21:18:31,012 INFO L78 Accepts]: Start accepts. Automaton has 50070 states and 208456 transitions. Word has length 15 [2019-12-27 21:18:31,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:18:31,013 INFO L462 AbstractCegarLoop]: Abstraction has 50070 states and 208456 transitions. [2019-12-27 21:18:31,013 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:18:31,013 INFO L276 IsEmpty]: Start isEmpty. Operand 50070 states and 208456 transitions. [2019-12-27 21:18:31,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 21:18:31,016 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:18:31,016 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:18:31,017 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:18:31,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:18:31,017 INFO L82 PathProgramCache]: Analyzing trace with hash -311678002, now seen corresponding path program 1 times [2019-12-27 21:18:31,018 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:18:31,018 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245619949] [2019-12-27 21:18:31,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:18:31,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:18:31,086 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 21:18:31,086 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245619949] [2019-12-27 21:18:31,087 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:18:31,087 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:18:31,087 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [146446570] [2019-12-27 21:18:31,087 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:18:31,089 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:18:31,091 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 16 states and 15 transitions. [2019-12-27 21:18:31,092 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:18:31,095 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:18:31,095 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:18:31,096 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:18:31,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:18:31,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:18:31,096 INFO L87 Difference]: Start difference. First operand 50070 states and 208456 transitions. Second operand 3 states. [2019-12-27 21:18:31,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:18:31,297 INFO L93 Difference]: Finished difference Result 39280 states and 151115 transitions. [2019-12-27 21:18:31,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:18:31,298 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-27 21:18:31,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:18:31,527 INFO L225 Difference]: With dead ends: 39280 [2019-12-27 21:18:31,528 INFO L226 Difference]: Without dead ends: 39280 [2019-12-27 21:18:31,528 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 21:18:32,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39280 states. [2019-12-27 21:18:33,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39280 to 39280. [2019-12-27 21:18:33,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39280 states. [2019-12-27 21:18:35,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39280 states to 39280 states and 151115 transitions. [2019-12-27 21:18:35,733 INFO L78 Accepts]: Start accepts. Automaton has 39280 states and 151115 transitions. Word has length 15 [2019-12-27 21:18:35,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:18:35,733 INFO L462 AbstractCegarLoop]: Abstraction has 39280 states and 151115 transitions. [2019-12-27 21:18:35,733 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:18:35,733 INFO L276 IsEmpty]: Start isEmpty. Operand 39280 states and 151115 transitions. [2019-12-27 21:18:35,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 21:18:35,737 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:18:35,737 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:18:35,737 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:18:35,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:18:35,738 INFO L82 PathProgramCache]: Analyzing trace with hash -1094107821, now seen corresponding path program 1 times [2019-12-27 21:18:35,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:18:35,739 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615502848] [2019-12-27 21:18:35,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:18:35,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:18:35,781 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 21:18:35,782 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615502848] [2019-12-27 21:18:35,782 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:18:35,782 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:18:35,782 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [134930384] [2019-12-27 21:18:35,783 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:18:35,784 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:18:35,787 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 23 states and 28 transitions. [2019-12-27 21:18:35,787 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:18:35,787 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:18:35,788 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:18:35,788 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:18:35,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:18:35,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:18:35,789 INFO L87 Difference]: Start difference. First operand 39280 states and 151115 transitions. Second operand 4 states. [2019-12-27 21:18:35,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:18:35,866 INFO L93 Difference]: Finished difference Result 16344 states and 52151 transitions. [2019-12-27 21:18:35,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 21:18:35,866 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 21:18:35,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:18:35,890 INFO L225 Difference]: With dead ends: 16344 [2019-12-27 21:18:35,891 INFO L226 Difference]: Without dead ends: 16344 [2019-12-27 21:18:35,891 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:18:35,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16344 states. [2019-12-27 21:18:36,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16344 to 16344. [2019-12-27 21:18:36,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16344 states. [2019-12-27 21:18:36,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16344 states to 16344 states and 52151 transitions. [2019-12-27 21:18:36,262 INFO L78 Accepts]: Start accepts. Automaton has 16344 states and 52151 transitions. Word has length 16 [2019-12-27 21:18:36,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:18:36,263 INFO L462 AbstractCegarLoop]: Abstraction has 16344 states and 52151 transitions. [2019-12-27 21:18:36,263 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:18:36,263 INFO L276 IsEmpty]: Start isEmpty. Operand 16344 states and 52151 transitions. [2019-12-27 21:18:36,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 21:18:36,270 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:18:36,270 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 21:18:36,270 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:18:36,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:18:36,271 INFO L82 PathProgramCache]: Analyzing trace with hash -1111128464, now seen corresponding path program 1 times [2019-12-27 21:18:36,271 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:18:36,272 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645410226] [2019-12-27 21:18:36,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:18:36,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:18:36,319 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 21:18:36,320 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645410226] [2019-12-27 21:18:36,320 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:18:36,320 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:18:36,320 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [321101126] [2019-12-27 21:18:36,321 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:18:36,323 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:18:36,326 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 37 transitions. [2019-12-27 21:18:36,326 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:18:36,345 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 21:18:36,345 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 21:18:36,346 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:18:36,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 21:18:36,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:18:36,346 INFO L87 Difference]: Start difference. First operand 16344 states and 52151 transitions. Second operand 6 states. [2019-12-27 21:18:36,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:18:36,400 INFO L93 Difference]: Finished difference Result 2799 states and 7236 transitions. [2019-12-27 21:18:36,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:18:36,401 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-12-27 21:18:36,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:18:36,406 INFO L225 Difference]: With dead ends: 2799 [2019-12-27 21:18:36,406 INFO L226 Difference]: Without dead ends: 2799 [2019-12-27 21:18:36,406 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:18:36,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2799 states. [2019-12-27 21:18:36,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2799 to 2799. [2019-12-27 21:18:36,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2799 states. [2019-12-27 21:18:36,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2799 states to 2799 states and 7236 transitions. [2019-12-27 21:18:36,452 INFO L78 Accepts]: Start accepts. Automaton has 2799 states and 7236 transitions. Word has length 17 [2019-12-27 21:18:36,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:18:36,452 INFO L462 AbstractCegarLoop]: Abstraction has 2799 states and 7236 transitions. [2019-12-27 21:18:36,452 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 21:18:36,453 INFO L276 IsEmpty]: Start isEmpty. Operand 2799 states and 7236 transitions. [2019-12-27 21:18:36,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-27 21:18:36,458 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:18:36,458 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] [2019-12-27 21:18:36,458 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:18:36,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:18:36,459 INFO L82 PathProgramCache]: Analyzing trace with hash 1318629020, now seen corresponding path program 1 times [2019-12-27 21:18:36,459 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:18:36,459 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984358427] [2019-12-27 21:18:36,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:18:36,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:18:36,569 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 21:18:36,570 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984358427] [2019-12-27 21:18:36,570 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:18:36,570 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 21:18:36,570 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1323987344] [2019-12-27 21:18:36,570 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:18:36,584 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:18:36,597 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 64 states and 97 transitions. [2019-12-27 21:18:36,597 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:18:36,648 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 21:18:36,648 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 21:18:36,648 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:18:36,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 21:18:36,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2019-12-27 21:18:36,649 INFO L87 Difference]: Start difference. First operand 2799 states and 7236 transitions. Second operand 8 states. [2019-12-27 21:18:36,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:18:36,722 INFO L93 Difference]: Finished difference Result 1357 states and 3888 transitions. [2019-12-27 21:18:36,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 21:18:36,723 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2019-12-27 21:18:36,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:18:36,726 INFO L225 Difference]: With dead ends: 1357 [2019-12-27 21:18:36,726 INFO L226 Difference]: Without dead ends: 1357 [2019-12-27 21:18:36,726 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2019-12-27 21:18:36,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1357 states. [2019-12-27 21:18:36,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1357 to 1217. [2019-12-27 21:18:36,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1217 states. [2019-12-27 21:18:36,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1217 states to 1217 states and 3488 transitions. [2019-12-27 21:18:36,747 INFO L78 Accepts]: Start accepts. Automaton has 1217 states and 3488 transitions. Word has length 29 [2019-12-27 21:18:36,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:18:36,748 INFO L462 AbstractCegarLoop]: Abstraction has 1217 states and 3488 transitions. [2019-12-27 21:18:36,748 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 21:18:36,748 INFO L276 IsEmpty]: Start isEmpty. Operand 1217 states and 3488 transitions. [2019-12-27 21:18:36,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 21:18:36,752 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:18:36,752 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, 1, 1, 1, 1, 1] [2019-12-27 21:18:36,752 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:18:36,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:18:36,753 INFO L82 PathProgramCache]: Analyzing trace with hash 1789262397, now seen corresponding path program 1 times [2019-12-27 21:18:36,754 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:18:36,754 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490382445] [2019-12-27 21:18:36,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:18:36,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:18:36,833 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 21:18:36,833 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490382445] [2019-12-27 21:18:36,834 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:18:36,834 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:18:36,834 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [666874887] [2019-12-27 21:18:36,834 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:18:36,856 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:18:36,967 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 100 states and 139 transitions. [2019-12-27 21:18:36,967 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:18:36,968 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:18:36,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:18:36,969 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:18:36,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:18:36,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:18:36,969 INFO L87 Difference]: Start difference. First operand 1217 states and 3488 transitions. Second operand 3 states. [2019-12-27 21:18:37,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:18:37,022 INFO L93 Difference]: Finished difference Result 1228 states and 3503 transitions. [2019-12-27 21:18:37,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:18:37,022 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-27 21:18:37,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:18:37,025 INFO L225 Difference]: With dead ends: 1228 [2019-12-27 21:18:37,025 INFO L226 Difference]: Without dead ends: 1228 [2019-12-27 21:18:37,026 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 21:18:37,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2019-12-27 21:18:37,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 1222. [2019-12-27 21:18:37,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1222 states. [2019-12-27 21:18:37,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1222 states to 1222 states and 3497 transitions. [2019-12-27 21:18:37,046 INFO L78 Accepts]: Start accepts. Automaton has 1222 states and 3497 transitions. Word has length 58 [2019-12-27 21:18:37,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:18:37,049 INFO L462 AbstractCegarLoop]: Abstraction has 1222 states and 3497 transitions. [2019-12-27 21:18:37,049 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:18:37,049 INFO L276 IsEmpty]: Start isEmpty. Operand 1222 states and 3497 transitions. [2019-12-27 21:18:37,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 21:18:37,053 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:18:37,053 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, 1, 1, 1, 1, 1] [2019-12-27 21:18:37,053 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:18:37,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:18:37,054 INFO L82 PathProgramCache]: Analyzing trace with hash -2131195958, now seen corresponding path program 1 times [2019-12-27 21:18:37,054 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:18:37,055 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929505206] [2019-12-27 21:18:37,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:18:37,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:18:37,183 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 21:18:37,183 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929505206] [2019-12-27 21:18:37,184 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:18:37,184 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 21:18:37,184 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1435213811] [2019-12-27 21:18:37,184 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:18:37,199 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:18:37,252 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 100 states and 139 transitions. [2019-12-27 21:18:37,252 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:18:37,256 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 21:18:37,257 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:18:37,257 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:18:37,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:18:37,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:18:37,257 INFO L87 Difference]: Start difference. First operand 1222 states and 3497 transitions. Second operand 5 states. [2019-12-27 21:18:37,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:18:37,480 INFO L93 Difference]: Finished difference Result 1763 states and 5019 transitions. [2019-12-27 21:18:37,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 21:18:37,481 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-12-27 21:18:37,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:18:37,485 INFO L225 Difference]: With dead ends: 1763 [2019-12-27 21:18:37,485 INFO L226 Difference]: Without dead ends: 1763 [2019-12-27 21:18:37,485 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:18:37,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1763 states. [2019-12-27 21:18:37,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1763 to 1418. [2019-12-27 21:18:37,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1418 states. [2019-12-27 21:18:37,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1418 states to 1418 states and 4073 transitions. [2019-12-27 21:18:37,507 INFO L78 Accepts]: Start accepts. Automaton has 1418 states and 4073 transitions. Word has length 58 [2019-12-27 21:18:37,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:18:37,508 INFO L462 AbstractCegarLoop]: Abstraction has 1418 states and 4073 transitions. [2019-12-27 21:18:37,508 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:18:37,508 INFO L276 IsEmpty]: Start isEmpty. Operand 1418 states and 4073 transitions. [2019-12-27 21:18:37,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 21:18:37,511 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:18:37,512 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, 1, 1, 1, 1, 1] [2019-12-27 21:18:37,512 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:18:37,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:18:37,512 INFO L82 PathProgramCache]: Analyzing trace with hash 831744802, now seen corresponding path program 2 times [2019-12-27 21:18:37,513 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:18:37,513 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951658557] [2019-12-27 21:18:37,513 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:18:37,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:18:37,617 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 21:18:37,617 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951658557] [2019-12-27 21:18:37,618 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:18:37,618 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:18:37,618 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1379640999] [2019-12-27 21:18:37,618 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:18:37,636 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:18:37,699 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 107 states and 153 transitions. [2019-12-27 21:18:37,700 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:18:37,795 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 11 times. [2019-12-27 21:18:37,795 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 21:18:37,795 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:18:37,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 21:18:37,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-27 21:18:37,796 INFO L87 Difference]: Start difference. First operand 1418 states and 4073 transitions. Second operand 10 states. [2019-12-27 21:18:39,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:18:39,535 INFO L93 Difference]: Finished difference Result 3066 states and 8447 transitions. [2019-12-27 21:18:39,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 21:18:39,548 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 58 [2019-12-27 21:18:39,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:18:39,553 INFO L225 Difference]: With dead ends: 3066 [2019-12-27 21:18:39,553 INFO L226 Difference]: Without dead ends: 3066 [2019-12-27 21:18:39,554 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 20 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=150, Invalid=356, Unknown=0, NotChecked=0, Total=506 [2019-12-27 21:18:39,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3066 states. [2019-12-27 21:18:39,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3066 to 1502. [2019-12-27 21:18:39,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1502 states. [2019-12-27 21:18:39,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1502 states to 1502 states and 4321 transitions. [2019-12-27 21:18:39,587 INFO L78 Accepts]: Start accepts. Automaton has 1502 states and 4321 transitions. Word has length 58 [2019-12-27 21:18:39,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:18:39,588 INFO L462 AbstractCegarLoop]: Abstraction has 1502 states and 4321 transitions. [2019-12-27 21:18:39,588 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 21:18:39,588 INFO L276 IsEmpty]: Start isEmpty. Operand 1502 states and 4321 transitions. [2019-12-27 21:18:39,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 21:18:39,592 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:18:39,592 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, 1, 1, 1, 1, 1] [2019-12-27 21:18:39,592 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:18:39,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:18:39,593 INFO L82 PathProgramCache]: Analyzing trace with hash -1828606006, now seen corresponding path program 3 times [2019-12-27 21:18:39,594 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:18:39,594 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069204477] [2019-12-27 21:18:39,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:18:39,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:18:39,693 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 21:18:39,694 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069204477] [2019-12-27 21:18:39,694 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:18:39,694 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:18:39,694 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [794098328] [2019-12-27 21:18:39,695 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:18:39,712 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:18:39,776 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 107 states and 154 transitions. [2019-12-27 21:18:39,776 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:18:39,813 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 10 times. [2019-12-27 21:18:39,813 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 21:18:39,813 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:18:39,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 21:18:39,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:18:39,814 INFO L87 Difference]: Start difference. First operand 1502 states and 4321 transitions. Second operand 6 states. [2019-12-27 21:18:40,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:18:40,146 INFO L93 Difference]: Finished difference Result 2376 states and 6757 transitions. [2019-12-27 21:18:40,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 21:18:40,146 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2019-12-27 21:18:40,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:18:40,151 INFO L225 Difference]: With dead ends: 2376 [2019-12-27 21:18:40,151 INFO L226 Difference]: Without dead ends: 2376 [2019-12-27 21:18:40,152 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 15 SyntacticMatches, 5 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-12-27 21:18:40,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2376 states. [2019-12-27 21:18:40,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2376 to 1690. [2019-12-27 21:18:40,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1690 states. [2019-12-27 21:18:40,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1690 states to 1690 states and 4865 transitions. [2019-12-27 21:18:40,180 INFO L78 Accepts]: Start accepts. Automaton has 1690 states and 4865 transitions. Word has length 58 [2019-12-27 21:18:40,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:18:40,180 INFO L462 AbstractCegarLoop]: Abstraction has 1690 states and 4865 transitions. [2019-12-27 21:18:40,180 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 21:18:40,180 INFO L276 IsEmpty]: Start isEmpty. Operand 1690 states and 4865 transitions. [2019-12-27 21:18:40,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 21:18:40,184 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:18:40,184 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, 1, 1, 1, 1, 1] [2019-12-27 21:18:40,185 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:18:40,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:18:40,185 INFO L82 PathProgramCache]: Analyzing trace with hash 361631606, now seen corresponding path program 4 times [2019-12-27 21:18:40,186 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:18:40,186 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701375210] [2019-12-27 21:18:40,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:18:40,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:18:40,292 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 21:18:40,292 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701375210] [2019-12-27 21:18:40,293 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:18:40,293 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 21:18:40,293 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [179685227] [2019-12-27 21:18:40,293 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:18:40,311 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:18:40,373 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 107 states and 154 transitions. [2019-12-27 21:18:40,374 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:18:40,468 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 10 times. [2019-12-27 21:18:40,468 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 21:18:40,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:18:40,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 21:18:40,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-12-27 21:18:40,469 INFO L87 Difference]: Start difference. First operand 1690 states and 4865 transitions. Second operand 11 states. [2019-12-27 21:18:42,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:18:42,211 INFO L93 Difference]: Finished difference Result 3427 states and 9437 transitions. [2019-12-27 21:18:42,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 21:18:42,211 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 58 [2019-12-27 21:18:42,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:18:42,215 INFO L225 Difference]: With dead ends: 3427 [2019-12-27 21:18:42,216 INFO L226 Difference]: Without dead ends: 3427 [2019-12-27 21:18:42,216 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=164, Invalid=436, Unknown=0, NotChecked=0, Total=600 [2019-12-27 21:18:42,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3427 states. [2019-12-27 21:18:42,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3427 to 1606. [2019-12-27 21:18:42,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1606 states. [2019-12-27 21:18:42,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1606 states to 1606 states and 4617 transitions. [2019-12-27 21:18:42,241 INFO L78 Accepts]: Start accepts. Automaton has 1606 states and 4617 transitions. Word has length 58 [2019-12-27 21:18:42,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:18:42,241 INFO L462 AbstractCegarLoop]: Abstraction has 1606 states and 4617 transitions. [2019-12-27 21:18:42,241 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 21:18:42,242 INFO L276 IsEmpty]: Start isEmpty. Operand 1606 states and 4617 transitions. [2019-12-27 21:18:42,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 21:18:42,245 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:18:42,245 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, 1, 1, 1, 1, 1, 1] [2019-12-27 21:18:42,245 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:18:42,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:18:42,246 INFO L82 PathProgramCache]: Analyzing trace with hash -1130563328, now seen corresponding path program 1 times [2019-12-27 21:18:42,247 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:18:42,247 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860813523] [2019-12-27 21:18:42,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:18:42,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:18:42,397 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 21:18:42,397 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860813523] [2019-12-27 21:18:42,397 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:18:42,398 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:18:42,398 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1075148011] [2019-12-27 21:18:42,398 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:18:42,416 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:18:42,488 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 100 states and 138 transitions. [2019-12-27 21:18:42,488 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:18:42,489 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:18:42,489 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 21:18:42,489 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:18:42,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 21:18:42,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:18:42,490 INFO L87 Difference]: Start difference. First operand 1606 states and 4617 transitions. Second operand 7 states. [2019-12-27 21:18:42,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:18:42,648 INFO L93 Difference]: Finished difference Result 3216 states and 8644 transitions. [2019-12-27 21:18:42,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 21:18:42,648 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 59 [2019-12-27 21:18:42,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:18:42,652 INFO L225 Difference]: With dead ends: 3216 [2019-12-27 21:18:42,652 INFO L226 Difference]: Without dead ends: 2282 [2019-12-27 21:18:42,653 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-27 21:18:42,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2282 states. [2019-12-27 21:18:42,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2282 to 1476. [2019-12-27 21:18:42,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1476 states. [2019-12-27 21:18:42,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1476 states to 1476 states and 4177 transitions. [2019-12-27 21:18:42,683 INFO L78 Accepts]: Start accepts. Automaton has 1476 states and 4177 transitions. Word has length 59 [2019-12-27 21:18:42,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:18:42,683 INFO L462 AbstractCegarLoop]: Abstraction has 1476 states and 4177 transitions. [2019-12-27 21:18:42,684 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 21:18:42,684 INFO L276 IsEmpty]: Start isEmpty. Operand 1476 states and 4177 transitions. [2019-12-27 21:18:42,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 21:18:42,687 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:18:42,687 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, 1, 1, 1, 1, 1, 1] [2019-12-27 21:18:42,687 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:18:42,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:18:42,688 INFO L82 PathProgramCache]: Analyzing trace with hash -2124049444, now seen corresponding path program 2 times [2019-12-27 21:18:42,688 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:18:42,689 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557623134] [2019-12-27 21:18:42,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:18:42,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:18:42,794 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 21:18:42,795 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557623134] [2019-12-27 21:18:42,795 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:18:42,796 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:18:42,796 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1886671547] [2019-12-27 21:18:42,796 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:18:42,825 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:18:42,921 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 126 states and 205 transitions. [2019-12-27 21:18:42,921 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:18:42,923 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:18:42,923 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:18:42,923 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:18:42,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:18:42,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:18:42,924 INFO L87 Difference]: Start difference. First operand 1476 states and 4177 transitions. Second operand 3 states. [2019-12-27 21:18:42,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:18:42,979 INFO L93 Difference]: Finished difference Result 1475 states and 4175 transitions. [2019-12-27 21:18:42,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:18:42,980 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-27 21:18:42,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:18:42,982 INFO L225 Difference]: With dead ends: 1475 [2019-12-27 21:18:42,983 INFO L226 Difference]: Without dead ends: 1475 [2019-12-27 21:18:42,983 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 21:18:42,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1475 states. [2019-12-27 21:18:43,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1475 to 950. [2019-12-27 21:18:43,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 950 states. [2019-12-27 21:18:43,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 2693 transitions. [2019-12-27 21:18:43,005 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 2693 transitions. Word has length 59 [2019-12-27 21:18:43,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:18:43,005 INFO L462 AbstractCegarLoop]: Abstraction has 950 states and 2693 transitions. [2019-12-27 21:18:43,005 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:18:43,005 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 2693 transitions. [2019-12-27 21:18:43,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 21:18:43,007 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:18:43,008 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, 1, 1, 1, 1, 1, 1] [2019-12-27 21:18:43,008 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:18:43,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:18:43,008 INFO L82 PathProgramCache]: Analyzing trace with hash -916388173, now seen corresponding path program 1 times [2019-12-27 21:18:43,009 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:18:43,009 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322072739] [2019-12-27 21:18:43,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:18:43,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:18:43,183 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 21:18:43,184 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322072739] [2019-12-27 21:18:43,184 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:18:43,184 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 21:18:43,184 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [303233913] [2019-12-27 21:18:43,185 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:18:43,202 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:18:43,294 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 125 states and 196 transitions. [2019-12-27 21:18:43,294 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:18:43,296 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 21:18:43,296 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 21:18:43,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:18:43,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 21:18:43,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:18:43,297 INFO L87 Difference]: Start difference. First operand 950 states and 2693 transitions. Second operand 6 states. [2019-12-27 21:18:43,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:18:43,376 INFO L93 Difference]: Finished difference Result 1369 states and 3710 transitions. [2019-12-27 21:18:43,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 21:18:43,376 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2019-12-27 21:18:43,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:18:43,378 INFO L225 Difference]: With dead ends: 1369 [2019-12-27 21:18:43,378 INFO L226 Difference]: Without dead ends: 805 [2019-12-27 21:18:43,379 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-27 21:18:43,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2019-12-27 21:18:43,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 693. [2019-12-27 21:18:43,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 693 states. [2019-12-27 21:18:43,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 693 states and 1734 transitions. [2019-12-27 21:18:43,387 INFO L78 Accepts]: Start accepts. Automaton has 693 states and 1734 transitions. Word has length 59 [2019-12-27 21:18:43,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:18:43,387 INFO L462 AbstractCegarLoop]: Abstraction has 693 states and 1734 transitions. [2019-12-27 21:18:43,387 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 21:18:43,387 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 1734 transitions. [2019-12-27 21:18:43,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 21:18:43,389 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:18:43,389 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, 1, 1, 1, 1, 1, 1] [2019-12-27 21:18:43,389 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:18:43,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:18:43,389 INFO L82 PathProgramCache]: Analyzing trace with hash -983573057, now seen corresponding path program 2 times [2019-12-27 21:18:43,390 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:18:43,390 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086175585] [2019-12-27 21:18:43,391 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:18:43,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:18:43,665 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 21:18:43,666 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086175585] [2019-12-27 21:18:43,666 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:18:43,666 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 21:18:43,666 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1831564859] [2019-12-27 21:18:43,667 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:18:43,683 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:18:43,787 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 143 states and 239 transitions. [2019-12-27 21:18:43,787 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:18:43,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 21:18:43,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 21:18:43,977 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 14 times. [2019-12-27 21:18:43,977 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-27 21:18:43,977 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:18:43,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-27 21:18:43,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2019-12-27 21:18:43,978 INFO L87 Difference]: Start difference. First operand 693 states and 1734 transitions. Second operand 20 states. [2019-12-27 21:18:47,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:18:47,351 INFO L93 Difference]: Finished difference Result 3127 states and 7406 transitions. [2019-12-27 21:18:47,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-12-27 21:18:47,352 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 59 [2019-12-27 21:18:47,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:18:47,353 INFO L225 Difference]: With dead ends: 3127 [2019-12-27 21:18:47,353 INFO L226 Difference]: Without dead ends: 721 [2019-12-27 21:18:47,355 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 720 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=707, Invalid=2715, Unknown=0, NotChecked=0, Total=3422 [2019-12-27 21:18:47,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2019-12-27 21:18:47,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 297. [2019-12-27 21:18:47,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2019-12-27 21:18:47,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 549 transitions. [2019-12-27 21:18:47,361 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 549 transitions. Word has length 59 [2019-12-27 21:18:47,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:18:47,361 INFO L462 AbstractCegarLoop]: Abstraction has 297 states and 549 transitions. [2019-12-27 21:18:47,361 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-27 21:18:47,361 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 549 transitions. [2019-12-27 21:18:47,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 21:18:47,362 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:18:47,362 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, 1, 1, 1, 1, 1, 1] [2019-12-27 21:18:47,362 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:18:47,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:18:47,362 INFO L82 PathProgramCache]: Analyzing trace with hash 851087049, now seen corresponding path program 3 times [2019-12-27 21:18:47,363 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:18:47,363 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600335427] [2019-12-27 21:18:47,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:18:47,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:18:47,420 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 21:18:47,420 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600335427] [2019-12-27 21:18:47,420 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:18:47,421 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:18:47,421 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1876387998] [2019-12-27 21:18:47,421 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:18:47,438 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:18:47,489 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 84 states and 104 transitions. [2019-12-27 21:18:47,489 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:18:47,500 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 21:18:47,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:18:47,500 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:18:47,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:18:47,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:18:47,501 INFO L87 Difference]: Start difference. First operand 297 states and 549 transitions. Second operand 4 states. [2019-12-27 21:18:47,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:18:47,597 INFO L93 Difference]: Finished difference Result 338 states and 601 transitions. [2019-12-27 21:18:47,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:18:47,598 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-12-27 21:18:47,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:18:47,599 INFO L225 Difference]: With dead ends: 338 [2019-12-27 21:18:47,599 INFO L226 Difference]: Without dead ends: 338 [2019-12-27 21:18:47,600 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 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 21:18:47,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2019-12-27 21:18:47,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 236. [2019-12-27 21:18:47,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2019-12-27 21:18:47,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 419 transitions. [2019-12-27 21:18:47,604 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 419 transitions. Word has length 59 [2019-12-27 21:18:47,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:18:47,604 INFO L462 AbstractCegarLoop]: Abstraction has 236 states and 419 transitions. [2019-12-27 21:18:47,604 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:18:47,604 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 419 transitions. [2019-12-27 21:18:47,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 21:18:47,605 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:18:47,605 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, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:18:47,605 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:18:47,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:18:47,606 INFO L82 PathProgramCache]: Analyzing trace with hash -1833326427, now seen corresponding path program 1 times [2019-12-27 21:18:47,606 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:18:47,607 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687472753] [2019-12-27 21:18:47,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:18:47,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:18:47,877 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 21:18:47,877 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687472753] [2019-12-27 21:18:47,877 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:18:47,878 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 21:18:47,878 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1496799578] [2019-12-27 21:18:47,878 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:18:47,893 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:18:47,961 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 98 states and 131 transitions. [2019-12-27 21:18:47,961 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:18:48,108 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 21:18:48,109 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 21:18:48,109 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:18:48,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 21:18:48,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2019-12-27 21:18:48,111 INFO L87 Difference]: Start difference. First operand 236 states and 419 transitions. Second operand 16 states. [2019-12-27 21:18:49,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:18:49,762 INFO L93 Difference]: Finished difference Result 509 states and 877 transitions. [2019-12-27 21:18:49,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-27 21:18:49,762 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 60 [2019-12-27 21:18:49,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:18:49,763 INFO L225 Difference]: With dead ends: 509 [2019-12-27 21:18:49,763 INFO L226 Difference]: Without dead ends: 478 [2019-12-27 21:18:49,764 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 4 SyntacticMatches, 7 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=291, Invalid=1115, Unknown=0, NotChecked=0, Total=1406 [2019-12-27 21:18:49,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2019-12-27 21:18:49,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 344. [2019-12-27 21:18:49,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2019-12-27 21:18:49,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 604 transitions. [2019-12-27 21:18:49,770 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 604 transitions. Word has length 60 [2019-12-27 21:18:49,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:18:49,771 INFO L462 AbstractCegarLoop]: Abstraction has 344 states and 604 transitions. [2019-12-27 21:18:49,771 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 21:18:49,771 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 604 transitions. [2019-12-27 21:18:49,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 21:18:49,772 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:18:49,772 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, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:18:49,772 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:18:49,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:18:49,772 INFO L82 PathProgramCache]: Analyzing trace with hash -1060183003, now seen corresponding path program 2 times [2019-12-27 21:18:49,773 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:18:49,773 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152103894] [2019-12-27 21:18:49,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:18:49,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 21:18:49,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 21:18:49,894 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 21:18:49,895 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 21:18:49,900 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] ULTIMATE.startENTRY-->L833: Formula: (let ((.cse0 (store |v_#valid_72| 0 0))) (and (= v_~main$tmp_guard0~0_10 0) (= 0 v_~z$r_buff1_thd0~0_47) (= 0 v_~a~0_9) (= 0 v_~__unbuffered_p3_EAX~0_10) (= |v_#NULL.offset_7| 0) (= v_~z$r_buff0_thd3~0_20 0) (= v_~z$mem_tmp~0_11 0) (= v_~z$r_buff0_thd1~0_8 0) (= v_~z$r_buff1_thd1~0_8 0) (= (store |v_#length_30| |v_ULTIMATE.start_main_~#t1189~0.base_19| 4) |v_#length_29|) (< 0 |v_#StackHeapBarrier_21|) (= 0 v_~z$r_buff1_thd4~0_16) (< |v_#StackHeapBarrier_21| |v_ULTIMATE.start_main_~#t1189~0.base_19|) (= (select .cse0 |v_ULTIMATE.start_main_~#t1189~0.base_19|) 0) (= v_~z$r_buff1_thd2~0_9 0) (= v_~z$read_delayed_var~0.offset_7 0) (= v_~b~0_11 0) (= 0 v_~__unbuffered_p1_EAX~0_10) (= 0 v_~z$w_buff1~0_22) (= 0 v_~z$flush_delayed~0_16) (= v_~z$w_buff0_used~0_105 0) (= 0 v_~z$w_buff1_used~0_62) (= v_~z$r_buff0_thd4~0_24 0) (= 0 v_~weak$$choice2~0_33) (= 0 v_~weak$$choice0~0_7) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$read_delayed~0_7 0) (= 0 v_~__unbuffered_cnt~0_27) (= 0 |v_#NULL.base_7|) (= (store |v_#memory_int_26| |v_ULTIMATE.start_main_~#t1189~0.base_19| (store (select |v_#memory_int_26| |v_ULTIMATE.start_main_~#t1189~0.base_19|) |v_ULTIMATE.start_main_~#t1189~0.offset_16| 0)) |v_#memory_int_25|) (= v_~z~0_27 0) (= |v_ULTIMATE.start_main_~#t1189~0.offset_16| 0) (= v_~z$r_buff0_thd0~0_80 0) (= v_~z$r_buff0_thd2~0_9 0) (= 0 v_~z$w_buff0~0_25) (= v_~x~0_12 0) (= v_~main$tmp_guard1~0_12 0) (= 0 v_~z$r_buff1_thd3~0_17) (= (store .cse0 |v_ULTIMATE.start_main_~#t1189~0.base_19| 1) |v_#valid_70|) (= 0 v_~__unbuffered_p3_EBX~0_10) (= 0 v_~y~0_9))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_21|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_26|, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_12|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_9, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_10|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_15|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_~#t1191~0.base=|v_ULTIMATE.start_main_~#t1191~0.base_21|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_12|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_16|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_10|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_16|, ~a~0=v_~a~0_9, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_80, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_10, ULTIMATE.start_main_~#t1192~0.offset=|v_ULTIMATE.start_main_~#t1192~0.offset_17|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_24, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_10, #length=|v_#length_29|, ULTIMATE.start_main_~#t1192~0.base=|v_ULTIMATE.start_main_~#t1192~0.base_22|, ~z$mem_tmp~0=v_~z$mem_tmp~0_11, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_15|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_13|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_62, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_12|, ~z$flush_delayed~0=v_~z$flush_delayed~0_16, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_12|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_15|, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_21|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_15|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_8, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_8|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_20, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_27, ~x~0=v_~x~0_12, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_16, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_13|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_14|, ~z$w_buff1~0=v_~z$w_buff1~0_22, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_12|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_10|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_17|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_10|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_14|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_15|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_47, ULTIMATE.start_main_~#t1189~0.offset=|v_ULTIMATE.start_main_~#t1189~0.offset_16|, ULTIMATE.start_main_#t~nondet26=|v_ULTIMATE.start_main_#t~nondet26_8|, ~y~0=v_~y~0_9, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_9, ULTIMATE.start_main_~#t1191~0.offset=|v_ULTIMATE.start_main_~#t1191~0.offset_16|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_105, ~z$w_buff0~0=v_~z$w_buff0~0_25, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_12|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_8|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_17, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_15|, ULTIMATE.start_main_~#t1189~0.base=|v_ULTIMATE.start_main_~#t1189~0.base_19|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_13|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_13|, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_12|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_14|, ULTIMATE.start_main_~#t1190~0.base=|v_ULTIMATE.start_main_~#t1190~0.base_22|, ~b~0=v_~b~0_11, ULTIMATE.start_main_~#t1190~0.offset=|v_ULTIMATE.start_main_~#t1190~0.offset_17|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_14|, #valid=|v_#valid_70|, #memory_int=|v_#memory_int_25|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_8|, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_8|, ~z~0=v_~z~0_27, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_~#t1191~0.base, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t1192~0.offset, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ULTIMATE.start_main_~#t1192~0.base, ~z$mem_tmp~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ULTIMATE.start_main_#t~nondet15, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ULTIMATE.start_main_#t~nondet17, ~__unbuffered_cnt~0, ~x~0, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~ite29, ~z$read_delayed~0, ULTIMATE.start_main_#t~ite46, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite30, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t1189~0.offset, ULTIMATE.start_main_#t~nondet26, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t1191~0.offset, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_~#t1189~0.base, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_~#t1190~0.base, ~b~0, ULTIMATE.start_main_~#t1190~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_main_#t~nondet18, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 21:18:49,901 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L833-1-->L835: Formula: (and (= (store |v_#valid_49| |v_ULTIMATE.start_main_~#t1190~0.base_13| 1) |v_#valid_48|) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1190~0.base_13| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1190~0.base_13|) |v_ULTIMATE.start_main_~#t1190~0.offset_11| 1)) |v_#memory_int_19|) (= 0 |v_ULTIMATE.start_main_~#t1190~0.offset_11|) (not (= 0 |v_ULTIMATE.start_main_~#t1190~0.base_13|)) (= (select |v_#valid_49| |v_ULTIMATE.start_main_~#t1190~0.base_13|) 0) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t1190~0.base_13| 4) |v_#length_23|) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t1190~0.base_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_20|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_~#t1190~0.base=|v_ULTIMATE.start_main_~#t1190~0.base_13|, ULTIMATE.start_main_~#t1190~0.offset=|v_ULTIMATE.start_main_~#t1190~0.offset_11|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1190~0.base, ULTIMATE.start_main_~#t1190~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length] because there is no mapped edge [2019-12-27 21:18:49,902 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L835-1-->L837: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t1191~0.offset_10|) (= 0 (select |v_#valid_47| |v_ULTIMATE.start_main_~#t1191~0.base_12|)) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1191~0.base_12|) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1191~0.base_12| 4)) (not (= |v_ULTIMATE.start_main_~#t1191~0.base_12| 0)) (= (store |v_#valid_47| |v_ULTIMATE.start_main_~#t1191~0.base_12| 1) |v_#valid_46|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1191~0.base_12| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1191~0.base_12|) |v_ULTIMATE.start_main_~#t1191~0.offset_10| 2)) |v_#memory_int_17|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_~#t1191~0.offset=|v_ULTIMATE.start_main_~#t1191~0.offset_10|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_5|, ULTIMATE.start_main_~#t1191~0.base=|v_ULTIMATE.start_main_~#t1191~0.base_12|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1191~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_main_~#t1191~0.base, #length] because there is no mapped edge [2019-12-27 21:18:49,903 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L837-1-->L839: Formula: (and (= 0 (select |v_#valid_40| |v_ULTIMATE.start_main_~#t1192~0.base_12|)) (= 0 |v_ULTIMATE.start_main_~#t1192~0.offset_10|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1192~0.base_12|) (= |v_#valid_39| (store |v_#valid_40| |v_ULTIMATE.start_main_~#t1192~0.base_12| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t1192~0.base_12|)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1192~0.base_12| 4)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1192~0.base_12| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1192~0.base_12|) |v_ULTIMATE.start_main_~#t1192~0.offset_10| 3)) |v_#memory_int_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t1192~0.base=|v_ULTIMATE.start_main_~#t1192~0.base_12|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t1192~0.offset=|v_ULTIMATE.start_main_~#t1192~0.offset_10|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1192~0.base, ULTIMATE.start_main_~#t1192~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet17] because there is no mapped edge [2019-12-27 21:18:49,904 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L4-->L810: Formula: (and (= v_~__unbuffered_p3_EBX~0_4 v_~b~0_4) (not (= 0 v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_8)) (= v_~__unbuffered_p3_EAX~0_4 v_~a~0_3) (= v_~z$r_buff1_thd1~0_3 v_~z$r_buff0_thd1~0_3) (= v_~z$r_buff1_thd2~0_4 v_~z$r_buff0_thd2~0_4) (= 1 v_~a~0_3) (= v_~z$r_buff0_thd4~0_15 1) (= v_~z$r_buff0_thd4~0_16 v_~z$r_buff1_thd4~0_10) (= v_~z$r_buff0_thd3~0_15 v_~z$r_buff1_thd3~0_11) (= v_~z$r_buff0_thd0~0_46 v_~z$r_buff1_thd0~0_26)) InVars {P3Thread1of1ForFork3___VERIFIER_assert_~expression=v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_8, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_46, ~b~0=v_~b~0_4, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_16, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_15, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_3, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_4} OutVars{P3Thread1of1ForFork3___VERIFIER_assert_~expression=v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_8, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_10, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_11, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_4, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_4, ~a~0=v_~a~0_3, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_46, ~b~0=v_~b~0_4, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_26, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_3, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_4, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_15, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_15, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_3, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_4} AuxVars[] AssignedVars[~a~0, ~z$r_buff1_thd4~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EBX~0] because there is no mapped edge [2019-12-27 21:18:49,904 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork0_~arg.base_5 |v_P0Thread1of1ForFork0_#in~arg.base_5|) (= 1 v_~b~0_7) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= 1 v_~x~0_7) (= v_P0Thread1of1ForFork0_~arg.offset_5 |v_P0Thread1of1ForFork0_#in~arg.offset_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_20 (+ v_~__unbuffered_cnt~0_21 1))) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, ~b~0=v_~b~0_7, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_5, ~x~0=v_~x~0_7, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_5} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, ~b~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_~arg.base, ~x~0, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-27 21:18:49,906 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] P1ENTRY-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_23 1) v_~__unbuffered_cnt~0_22) (= v_~__unbuffered_p1_EAX~0_6 v_~y~0_5) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= 2 v_~x~0_8) (= |v_P1Thread1of1ForFork1_#in~arg.offset_4| v_P1Thread1of1ForFork1_~arg.offset_4) (= v_P1Thread1of1ForFork1_~arg.base_4 |v_P1Thread1of1ForFork1_#in~arg.base_4|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_4|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_23, ~y~0=v_~y~0_5} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_4, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_6, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_4, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_4|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, ~y~0=v_~y~0_5, ~x~0=v_~x~0_8, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork1_~arg.base, ~__unbuffered_cnt~0, ~x~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 21:18:49,907 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L811-->L811-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1179010153 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In-1179010153 256)))) (or (and (not .cse0) (= 0 |P3Thread1of1ForFork3_#t~ite11_Out-1179010153|) (not .cse1)) (and (= ~z$w_buff0_used~0_In-1179010153 |P3Thread1of1ForFork3_#t~ite11_Out-1179010153|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1179010153, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1179010153} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1179010153, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1179010153, P3Thread1of1ForFork3_#t~ite11=|P3Thread1of1ForFork3_#t~ite11_Out-1179010153|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite11] because there is no mapped edge [2019-12-27 21:18:49,909 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L774-2-->L774-4: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In1335114517 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In1335114517 256)))) (or (and (not .cse0) (not .cse1) (= ~z$w_buff1~0_In1335114517 |P2Thread1of1ForFork2_#t~ite3_Out1335114517|)) (and (or .cse0 .cse1) (= ~z~0_In1335114517 |P2Thread1of1ForFork2_#t~ite3_Out1335114517|)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1335114517, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1335114517, ~z$w_buff1~0=~z$w_buff1~0_In1335114517, ~z~0=~z~0_In1335114517} OutVars{P2Thread1of1ForFork2_#t~ite3=|P2Thread1of1ForFork2_#t~ite3_Out1335114517|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1335114517, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1335114517, ~z$w_buff1~0=~z$w_buff1~0_In1335114517, ~z~0=~z~0_In1335114517} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-27 21:18:49,910 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L812-->L812-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1628468268 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In-1628468268 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In-1628468268 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd4~0_In-1628468268 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In-1628468268 |P3Thread1of1ForFork3_#t~ite12_Out-1628468268|) (or .cse2 .cse3)) (and (= 0 |P3Thread1of1ForFork3_#t~ite12_Out-1628468268|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1628468268, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1628468268, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1628468268, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1628468268} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1628468268, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1628468268, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1628468268, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1628468268, P3Thread1of1ForFork3_#t~ite12=|P3Thread1of1ForFork3_#t~ite12_Out-1628468268|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite12] because there is no mapped edge [2019-12-27 21:18:49,912 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L813-->L814: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In-606838509 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-606838509 256) 0))) (or (and (= ~z$r_buff0_thd4~0_Out-606838509 ~z$r_buff0_thd4~0_In-606838509) (or .cse0 .cse1)) (and (not .cse1) (= 0 ~z$r_buff0_thd4~0_Out-606838509) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-606838509, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-606838509} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-606838509, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-606838509, P3Thread1of1ForFork3_#t~ite13=|P3Thread1of1ForFork3_#t~ite13_Out-606838509|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~ite13] because there is no mapped edge [2019-12-27 21:18:49,912 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L814-->L814-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd4~0_In-295284655 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-295284655 256))) (.cse2 (= (mod ~z$r_buff1_thd4~0_In-295284655 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In-295284655 256) 0))) (or (and (or .cse0 .cse1) (= |P3Thread1of1ForFork3_#t~ite14_Out-295284655| ~z$r_buff1_thd4~0_In-295284655) (or .cse2 .cse3)) (and (= 0 |P3Thread1of1ForFork3_#t~ite14_Out-295284655|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-295284655, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-295284655, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-295284655, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-295284655} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-295284655, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-295284655, P3Thread1of1ForFork3_#t~ite14=|P3Thread1of1ForFork3_#t~ite14_Out-295284655|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-295284655, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-295284655} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite14] because there is no mapped edge [2019-12-27 21:18:49,912 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [736] [736] L814-2-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork3_#t~ite14_8| v_~z$r_buff1_thd4~0_11) (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= 0 |v_P3Thread1of1ForFork3_#res.offset_5|) (= 0 |v_P3Thread1of1ForFork3_#res.base_5|)) InVars {P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_11, P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_7|, P3Thread1of1ForFork3_#res.base=|v_P3Thread1of1ForFork3_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, P3Thread1of1ForFork3_#res.offset=|v_P3Thread1of1ForFork3_#res.offset_5|} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, P3Thread1of1ForFork3_#t~ite14, P3Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork3_#res.offset] because there is no mapped edge [2019-12-27 21:18:49,912 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L774-4-->L775: Formula: (= v_~z~0_20 |v_P2Thread1of1ForFork2_#t~ite3_8|) InVars {P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_8|} OutVars{P2Thread1of1ForFork2_#t~ite4=|v_P2Thread1of1ForFork2_#t~ite4_7|, P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_7|, ~z~0=v_~z~0_20} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite4, P2Thread1of1ForFork2_#t~ite3, ~z~0] because there is no mapped edge [2019-12-27 21:18:49,912 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L775-->L775-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In1084524133 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1084524133 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite5_Out1084524133| 0) (not .cse1)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite5_Out1084524133| ~z$w_buff0_used~0_In1084524133)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1084524133, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1084524133} OutVars{P2Thread1of1ForFork2_#t~ite5=|P2Thread1of1ForFork2_#t~ite5_Out1084524133|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1084524133, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1084524133} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-27 21:18:49,913 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L776-->L776-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff0_thd3~0_In1236109269 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In1236109269 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In1236109269 256))) (.cse0 (= (mod ~z$r_buff1_thd3~0_In1236109269 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite6_Out1236109269| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P2Thread1of1ForFork2_#t~ite6_Out1236109269| ~z$w_buff1_used~0_In1236109269) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1236109269, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1236109269, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1236109269, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1236109269} OutVars{P2Thread1of1ForFork2_#t~ite6=|P2Thread1of1ForFork2_#t~ite6_Out1236109269|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1236109269, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1236109269, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1236109269, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1236109269} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-27 21:18:49,914 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L777-->L777-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In2108251456 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In2108251456 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite7_Out2108251456| 0) (not .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite7_Out2108251456| ~z$r_buff0_thd3~0_In2108251456) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2108251456, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2108251456} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2108251456, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2108251456, P2Thread1of1ForFork2_#t~ite7=|P2Thread1of1ForFork2_#t~ite7_Out2108251456|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-27 21:18:49,915 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L778-->L778-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In2023794242 256))) (.cse0 (= (mod ~z$r_buff0_thd3~0_In2023794242 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In2023794242 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd3~0_In2023794242 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork2_#t~ite8_Out2023794242|)) (and (or .cse1 .cse0) (or .cse2 .cse3) (= ~z$r_buff1_thd3~0_In2023794242 |P2Thread1of1ForFork2_#t~ite8_Out2023794242|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2023794242, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In2023794242, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2023794242, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2023794242} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2023794242, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In2023794242, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2023794242, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2023794242, P2Thread1of1ForFork2_#t~ite8=|P2Thread1of1ForFork2_#t~ite8_Out2023794242|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-27 21:18:49,915 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L778-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_18 1) v_~__unbuffered_cnt~0_17) (= v_~z$r_buff1_thd3~0_12 |v_P2Thread1of1ForFork2_#t~ite8_8|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_8|} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_12, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_7|} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset, P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-27 21:18:49,915 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L839-1-->L845: Formula: (and (= 4 v_~__unbuffered_cnt~0_14) (= v_~main$tmp_guard0~0_5 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_4|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet18] because there is no mapped edge [2019-12-27 21:18:49,916 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L845-2-->L845-4: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In1368356189 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In1368356189 256)))) (or (and (or .cse0 .cse1) (= ~z~0_In1368356189 |ULTIMATE.start_main_#t~ite19_Out1368356189|)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite19_Out1368356189| ~z$w_buff1~0_In1368356189)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1368356189, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1368356189, ~z$w_buff1~0=~z$w_buff1~0_In1368356189, ~z~0=~z~0_In1368356189} OutVars{ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out1368356189|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1368356189, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1368356189, ~z$w_buff1~0=~z$w_buff1~0_In1368356189, ~z~0=~z~0_In1368356189} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-27 21:18:49,916 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L845-4-->L846: Formula: (= v_~z~0_16 |v_ULTIMATE.start_main_#t~ite19_7|) InVars {ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_7|} OutVars{ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_6|, ~z~0=v_~z~0_16, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19, ~z~0, ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-27 21:18:49,917 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L846-->L846-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-818925099 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-818925099 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite21_Out-818925099| ~z$w_buff0_used~0_In-818925099) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite21_Out-818925099|) (not .cse0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-818925099, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-818925099} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-818925099, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-818925099, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-818925099|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-27 21:18:49,918 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L847-->L847-2: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd0~0_In-1641309820 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In-1641309820 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd0~0_In-1641309820 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In-1641309820 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite22_Out-1641309820|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In-1641309820 |ULTIMATE.start_main_#t~ite22_Out-1641309820|) (or .cse3 .cse2)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1641309820, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1641309820, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1641309820, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1641309820} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1641309820, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1641309820, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1641309820, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1641309820, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-1641309820|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-27 21:18:49,920 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L848-->L848-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-928311897 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-928311897 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite23_Out-928311897| 0) (not .cse0) (not .cse1)) (and (= ~z$r_buff0_thd0~0_In-928311897 |ULTIMATE.start_main_#t~ite23_Out-928311897|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-928311897, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-928311897} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-928311897, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-928311897, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-928311897|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-27 21:18:49,921 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L849-->L849-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In-2136844676 256))) (.cse0 (= (mod ~z$r_buff1_thd0~0_In-2136844676 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In-2136844676 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd0~0_In-2136844676 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite24_Out-2136844676| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |ULTIMATE.start_main_#t~ite24_Out-2136844676| ~z$r_buff1_thd0~0_In-2136844676) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2136844676, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2136844676, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2136844676, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2136844676} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2136844676, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2136844676, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2136844676, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-2136844676|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2136844676} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24] because there is no mapped edge [2019-12-27 21:18:49,928 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L860-->L860-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In166021767 256)))) (or (and .cse0 (= ~z$w_buff1_used~0_In166021767 |ULTIMATE.start_main_#t~ite39_Out166021767|) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In166021767 256)))) (or (and (= 0 (mod ~z$r_buff1_thd0~0_In166021767 256)) .cse1) (= (mod ~z$w_buff0_used~0_In166021767 256) 0) (and .cse1 (= (mod ~z$w_buff1_used~0_In166021767 256) 0)))) (= |ULTIMATE.start_main_#t~ite39_Out166021767| |ULTIMATE.start_main_#t~ite40_Out166021767|)) (and (= ~z$w_buff1_used~0_In166021767 |ULTIMATE.start_main_#t~ite40_Out166021767|) (not .cse0) (= |ULTIMATE.start_main_#t~ite39_In166021767| |ULTIMATE.start_main_#t~ite39_Out166021767|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In166021767, ~z$w_buff0_used~0=~z$w_buff0_used~0_In166021767, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_In166021767|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In166021767, ~z$w_buff1_used~0=~z$w_buff1_used~0_In166021767, ~weak$$choice2~0=~weak$$choice2~0_In166021767} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In166021767, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out166021767|, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out166021767|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In166021767, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In166021767, ~z$w_buff1_used~0=~z$w_buff1_used~0_In166021767, ~weak$$choice2~0=~weak$$choice2~0_In166021767} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-27 21:18:49,929 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L861-->L862: Formula: (and (= v_~z$r_buff0_thd0~0_59 v_~z$r_buff0_thd0~0_60) (not (= (mod v_~weak$$choice2~0_18 256) 0))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_60, ~weak$$choice2~0=v_~weak$$choice2~0_18} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_9|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_59, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_8|, ~weak$$choice2~0=v_~weak$$choice2~0_18, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 21:18:49,929 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L862-->L862-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In574503389 256) 0)) (.cse1 (= |ULTIMATE.start_main_#t~ite46_Out574503389| |ULTIMATE.start_main_#t~ite45_Out574503389|)) (.cse4 (= 0 (mod ~z$w_buff0_used~0_In574503389 256))) (.cse5 (= 0 (mod ~z$w_buff1_used~0_In574503389 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In574503389 256))) (.cse2 (= (mod ~z$r_buff0_thd0~0_In574503389 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite44_In574503389| |ULTIMATE.start_main_#t~ite44_Out574503389|) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite45_In574503389| |ULTIMATE.start_main_#t~ite45_Out574503389|) (= ~z$r_buff1_thd0~0_In574503389 |ULTIMATE.start_main_#t~ite46_Out574503389|)) (and .cse0 .cse1 (or (and .cse2 .cse3) .cse4 (and .cse2 .cse5)) (= ~z$r_buff1_thd0~0_In574503389 |ULTIMATE.start_main_#t~ite45_Out574503389|)))) (let ((.cse6 (not .cse2))) (and .cse0 .cse1 (not .cse4) (= 0 |ULTIMATE.start_main_#t~ite44_Out574503389|) (or .cse6 (not .cse5)) (or .cse6 (not .cse3)) (= |ULTIMATE.start_main_#t~ite45_Out574503389| |ULTIMATE.start_main_#t~ite44_Out574503389|))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In574503389, ~z$w_buff0_used~0=~z$w_buff0_used~0_In574503389, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In574503389, ~z$w_buff1_used~0=~z$w_buff1_used~0_In574503389, ~weak$$choice2~0=~weak$$choice2~0_In574503389, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_In574503389|, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_In574503389|} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In574503389, ~z$w_buff0_used~0=~z$w_buff0_used~0_In574503389, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In574503389, ~z$w_buff1_used~0=~z$w_buff1_used~0_In574503389, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out574503389|, ~weak$$choice2~0=~weak$$choice2~0_In574503389, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out574503389|, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out574503389|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 21:18:49,930 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L864-->L4: Formula: (and (= 0 v_~z$flush_delayed~0_11) (= (mod v_~main$tmp_guard1~0_7 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|) (not (= 0 (mod v_~z$flush_delayed~0_12 256))) (= v_~z~0_23 v_~z$mem_tmp~0_7)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_7, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~z$flush_delayed~0=v_~z$flush_delayed~0_12} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_7, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_11|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~z$flush_delayed~0=v_~z$flush_delayed~0_11, ~z~0=v_~z~0_23, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite47, ~z$flush_delayed~0, ~z~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 21:18:49,930 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [732] [732] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_8 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_8 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_8, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 21:18:50,029 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 09:18:50 BasicIcfg [2019-12-27 21:18:50,031 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 21:18:50,033 INFO L168 Benchmark]: Toolchain (without parser) took 40372.61 ms. Allocated memory was 147.8 MB in the beginning and 1.7 GB in the end (delta: 1.6 GB). Free memory was 104.2 MB in the beginning and 575.3 MB in the end (delta: -471.1 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-12-27 21:18:50,033 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 147.8 MB. Free memory was 124.2 MB in the beginning and 124.0 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-27 21:18:50,034 INFO L168 Benchmark]: CACSL2BoogieTranslator took 818.84 ms. Allocated memory was 147.8 MB in the beginning and 203.4 MB in the end (delta: 55.6 MB). Free memory was 104.0 MB in the beginning and 156.5 MB in the end (delta: -52.5 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. [2019-12-27 21:18:50,035 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.77 ms. Allocated memory is still 203.4 MB. Free memory was 156.5 MB in the beginning and 153.3 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. [2019-12-27 21:18:50,036 INFO L168 Benchmark]: Boogie Preprocessor took 61.80 ms. Allocated memory is still 203.4 MB. Free memory was 153.3 MB in the beginning and 150.8 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. [2019-12-27 21:18:50,038 INFO L168 Benchmark]: RCFGBuilder took 841.50 ms. Allocated memory is still 203.4 MB. Free memory was 150.8 MB in the beginning and 101.4 MB in the end (delta: 49.4 MB). Peak memory consumption was 49.4 MB. Max. memory is 7.1 GB. [2019-12-27 21:18:50,039 INFO L168 Benchmark]: TraceAbstraction took 38574.74 ms. Allocated memory was 203.4 MB in the beginning and 1.7 GB in the end (delta: 1.5 GB). Free memory was 100.7 MB in the beginning and 575.3 MB in the end (delta: -474.6 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-12-27 21:18:50,047 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 147.8 MB. Free memory was 124.2 MB in the beginning and 124.0 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 818.84 ms. Allocated memory was 147.8 MB in the beginning and 203.4 MB in the end (delta: 55.6 MB). Free memory was 104.0 MB in the beginning and 156.5 MB in the end (delta: -52.5 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 69.77 ms. Allocated memory is still 203.4 MB. Free memory was 156.5 MB in the beginning and 153.3 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 61.80 ms. Allocated memory is still 203.4 MB. Free memory was 153.3 MB in the beginning and 150.8 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 841.50 ms. Allocated memory is still 203.4 MB. Free memory was 150.8 MB in the beginning and 101.4 MB in the end (delta: 49.4 MB). Peak memory consumption was 49.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 38574.74 ms. Allocated memory was 203.4 MB in the beginning and 1.7 GB in the end (delta: 1.5 GB). Free memory was 100.7 MB in the beginning and 575.3 MB in the end (delta: -474.6 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.9s, 181 ProgramPointsBefore, 93 ProgramPointsAfterwards, 209 TransitionsBefore, 100 TransitionsAfterwards, 12668 CoEnabledTransitionPairs, 7 FixpointIterations, 37 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 26 ChoiceCompositions, 4801 VarBasedMoverChecksPositive, 172 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 54567 CheckedPairsTotal, 117 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L833] FCALL, FORK 0 pthread_create(&t1189, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L835] FCALL, FORK 0 pthread_create(&t1190, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L837] FCALL, FORK 0 pthread_create(&t1191, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L839] FCALL, FORK 0 pthread_create(&t1192, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L788] 4 z$w_buff1 = z$w_buff0 [L789] 4 z$w_buff0 = 2 [L790] 4 z$w_buff1_used = z$w_buff0_used [L791] 4 z$w_buff0_used = (_Bool)1 [L810] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 3 y = 1 [L771] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L810] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L774] 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L811] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L812] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L775] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L776] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L777] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L845] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L846] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L847] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L848] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L849] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L852] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L853] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L854] 0 z$flush_delayed = weak$$choice2 [L855] 0 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L856] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L856] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L857] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L857] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L858] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L858] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L859] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L859] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L860] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L862] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L863] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 169 locations, 2 error locations. Result: UNSAFE, OverallTime: 38.2s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 14.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2164 SDtfs, 3990 SDslu, 7209 SDs, 0 SdLazy, 6037 SolverSat, 377 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 311 GetRequests, 98 SyntacticMatches, 25 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1198 ImplicationChecksByTransitivity, 4.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50070occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 13.2s AutomataMinimizationTime, 17 MinimizatonAttempts, 12701 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 806 NumberOfCodeBlocks, 806 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 729 ConstructedInterpolants, 0 QuantifiedInterpolants, 166733 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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...