/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix055_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 21:50:16,393 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 21:50:16,395 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 21:50:16,408 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 21:50:16,408 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 21:50:16,409 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 21:50:16,411 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 21:50:16,413 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 21:50:16,414 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 21:50:16,415 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 21:50:16,416 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 21:50:16,417 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 21:50:16,417 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 21:50:16,418 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 21:50:16,419 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 21:50:16,420 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 21:50:16,421 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 21:50:16,423 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 21:50:16,425 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 21:50:16,429 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 21:50:16,432 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 21:50:16,434 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 21:50:16,435 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 21:50:16,437 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 21:50:16,441 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 21:50:16,442 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 21:50:16,442 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 21:50:16,444 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 21:50:16,445 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 21:50:16,446 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 21:50:16,446 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 21:50:16,447 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 21:50:16,448 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 21:50:16,449 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 21:50:16,453 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 21:50:16,453 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 21:50:16,454 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 21:50:16,454 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 21:50:16,454 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 21:50:16,456 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 21:50:16,458 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 21:50:16,459 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-18 21:50:16,478 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 21:50:16,478 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 21:50:16,480 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 21:50:16,481 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 21:50:16,481 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 21:50:16,481 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 21:50:16,481 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 21:50:16,482 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 21:50:16,482 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 21:50:16,482 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 21:50:16,483 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 21:50:16,483 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 21:50:16,483 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 21:50:16,484 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 21:50:16,484 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 21:50:16,484 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 21:50:16,484 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 21:50:16,485 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 21:50:16,485 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 21:50:16,485 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 21:50:16,485 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 21:50:16,485 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 21:50:16,486 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 21:50:16,486 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 21:50:16,486 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 21:50:16,486 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 21:50:16,486 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 21:50:16,487 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 21:50:16,487 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 21:50:16,487 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 21:50:16,785 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 21:50:16,796 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 21:50:16,799 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 21:50:16,804 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 21:50:16,805 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 21:50:16,806 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix055_rmo.opt.i [2019-12-18 21:50:16,889 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3c9889af/f9167549bd314879b8e9a275ca61debc/FLAG9fee11df9 [2019-12-18 21:50:17,476 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 21:50:17,477 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix055_rmo.opt.i [2019-12-18 21:50:17,493 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3c9889af/f9167549bd314879b8e9a275ca61debc/FLAG9fee11df9 [2019-12-18 21:50:17,791 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3c9889af/f9167549bd314879b8e9a275ca61debc [2019-12-18 21:50:17,803 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 21:50:17,805 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 21:50:17,806 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 21:50:17,806 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 21:50:17,809 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 21:50:17,810 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:50:17" (1/1) ... [2019-12-18 21:50:17,813 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53f98591 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:50:17, skipping insertion in model container [2019-12-18 21:50:17,813 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:50:17" (1/1) ... [2019-12-18 21:50:17,821 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 21:50:17,885 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 21:50:18,437 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:50:18,454 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 21:50:18,546 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:50:18,620 INFO L208 MainTranslator]: Completed translation [2019-12-18 21:50:18,621 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:50:18 WrapperNode [2019-12-18 21:50:18,621 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 21:50:18,622 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 21:50:18,622 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 21:50:18,622 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 21:50:18,630 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:50:18" (1/1) ... [2019-12-18 21:50:18,651 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:50:18" (1/1) ... [2019-12-18 21:50:18,694 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 21:50:18,694 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 21:50:18,694 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 21:50:18,695 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 21:50:18,708 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:50:18" (1/1) ... [2019-12-18 21:50:18,708 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:50:18" (1/1) ... [2019-12-18 21:50:18,714 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:50:18" (1/1) ... [2019-12-18 21:50:18,715 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:50:18" (1/1) ... [2019-12-18 21:50:18,726 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:50:18" (1/1) ... [2019-12-18 21:50:18,730 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:50:18" (1/1) ... [2019-12-18 21:50:18,733 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:50:18" (1/1) ... [2019-12-18 21:50:18,739 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 21:50:18,739 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 21:50:18,740 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 21:50:18,740 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 21:50:18,741 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:50:18" (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-18 21:50:18,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 21:50:18,805 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 21:50:18,805 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 21:50:18,805 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 21:50:18,806 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 21:50:18,807 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 21:50:18,807 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 21:50:18,808 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 21:50:18,808 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 21:50:18,809 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 21:50:18,809 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-18 21:50:18,809 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-18 21:50:18,809 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 21:50:18,810 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 21:50:18,810 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 21:50:18,813 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 21:50:19,634 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 21:50:19,634 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 21:50:19,635 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:50:19 BoogieIcfgContainer [2019-12-18 21:50:19,636 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 21:50:19,637 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 21:50:19,637 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 21:50:19,641 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 21:50:19,641 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 09:50:17" (1/3) ... [2019-12-18 21:50:19,642 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cf693f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:50:19, skipping insertion in model container [2019-12-18 21:50:19,642 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:50:18" (2/3) ... [2019-12-18 21:50:19,643 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cf693f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:50:19, skipping insertion in model container [2019-12-18 21:50:19,643 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:50:19" (3/3) ... [2019-12-18 21:50:19,645 INFO L109 eAbstractionObserver]: Analyzing ICFG mix055_rmo.opt.i [2019-12-18 21:50:19,655 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 21:50:19,656 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 21:50:19,663 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 21:50:19,664 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 21:50:19,704 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:50:19,704 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:50:19,705 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:50:19,705 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:50:19,706 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:50:19,707 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:50:19,707 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:50:19,707 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:50:19,707 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:50:19,708 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:50:19,708 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:50:19,709 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:50:19,710 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:50:19,710 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:50:19,710 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:50:19,710 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:50:19,711 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:50:19,711 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:50:19,711 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:50:19,711 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:50:19,712 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:50:19,712 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:50:19,712 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:50:19,712 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:50:19,713 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:50:19,713 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:50:19,713 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:50:19,713 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:50:19,713 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:50:19,714 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:50:19,714 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:50:19,714 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:50:19,714 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:50:19,715 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:50:19,716 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:50:19,716 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:50:19,716 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:50:19,717 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:50:19,718 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:50:19,718 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:50:19,718 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:50:19,718 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:50:19,722 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:50:19,722 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:50:19,722 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:50:19,723 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:50:19,723 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:50:19,723 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:50:19,723 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:50:19,724 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:50:19,724 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:50:19,724 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:50:19,724 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:50:19,725 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:50:19,725 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:50:19,725 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:50:19,725 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:50:19,725 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:50:19,725 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:50:19,726 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:50:19,726 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:50:19,726 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:50:19,726 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:50:19,727 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:50:19,727 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:50:19,727 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:50:19,727 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:50:19,728 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:50:19,728 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:50:19,728 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:50:19,728 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:50:19,729 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:50:19,745 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:50:19,746 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:50:19,746 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:50:19,746 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:50:19,749 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:50:19,750 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:50:19,750 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:50:19,750 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:50:19,753 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:50:19,754 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:50:19,754 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:50:19,754 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:50:19,758 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:50:19,758 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:50:19,758 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:50:19,758 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:50:19,759 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:50:19,759 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:50:19,759 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:50:19,759 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:50:19,759 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:50:19,760 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:50:19,762 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:50:19,762 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:50:19,762 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:50:19,763 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:50:19,764 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:50:19,764 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:50:19,764 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:50:19,765 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:50:19,765 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:50:19,765 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:50:19,765 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:50:19,765 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:50:19,781 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-18 21:50:19,796 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 21:50:19,797 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 21:50:19,797 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 21:50:19,797 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 21:50:19,797 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 21:50:19,797 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 21:50:19,798 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 21:50:19,798 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 21:50:19,815 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 179 places, 207 transitions [2019-12-18 21:50:19,817 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 207 transitions [2019-12-18 21:50:19,924 INFO L126 PetriNetUnfolder]: 41/203 cut-off events. [2019-12-18 21:50:19,924 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:50:19,941 INFO L76 FinitePrefix]: Finished finitePrefix Result has 216 conditions, 203 events. 41/203 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 267 event pairs. 12/172 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-18 21:50:19,967 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 207 transitions [2019-12-18 21:50:20,011 INFO L126 PetriNetUnfolder]: 41/203 cut-off events. [2019-12-18 21:50:20,011 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:50:20,018 INFO L76 FinitePrefix]: Finished finitePrefix Result has 216 conditions, 203 events. 41/203 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 267 event pairs. 12/172 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-18 21:50:20,034 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12668 [2019-12-18 21:50:20,036 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 21:50:23,558 WARN L192 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-18 21:50:23,705 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-18 21:50:23,727 INFO L206 etLargeBlockEncoding]: Checked pairs total: 51526 [2019-12-18 21:50:23,727 INFO L214 etLargeBlockEncoding]: Total number of compositions: 119 [2019-12-18 21:50:23,731 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 91 places, 96 transitions [2019-12-18 21:50:25,909 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 34622 states. [2019-12-18 21:50:25,911 INFO L276 IsEmpty]: Start isEmpty. Operand 34622 states. [2019-12-18 21:50:25,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-18 21:50:25,918 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:50:25,918 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:50:25,919 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-18 21:50:25,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:50:25,925 INFO L82 PathProgramCache]: Analyzing trace with hash 1005539762, now seen corresponding path program 1 times [2019-12-18 21:50:25,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:50:25,935 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452890408] [2019-12-18 21:50:25,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:50:26,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:50:26,237 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-18 21:50:26,238 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452890408] [2019-12-18 21:50:26,239 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:50:26,239 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 21:50:26,240 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342500664] [2019-12-18 21:50:26,244 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:50:26,244 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:50:26,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:50:26,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:50:26,262 INFO L87 Difference]: Start difference. First operand 34622 states. Second operand 3 states. [2019-12-18 21:50:27,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:50:27,746 INFO L93 Difference]: Finished difference Result 34366 states and 145048 transitions. [2019-12-18 21:50:27,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:50:27,748 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-18 21:50:27,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:50:28,137 INFO L225 Difference]: With dead ends: 34366 [2019-12-18 21:50:28,138 INFO L226 Difference]: Without dead ends: 33694 [2019-12-18 21:50:28,140 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-18 21:50:28,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33694 states. [2019-12-18 21:50:29,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33694 to 33694. [2019-12-18 21:50:29,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33694 states. [2019-12-18 21:50:30,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33694 states to 33694 states and 142304 transitions. [2019-12-18 21:50:30,164 INFO L78 Accepts]: Start accepts. Automaton has 33694 states and 142304 transitions. Word has length 9 [2019-12-18 21:50:30,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:50:30,165 INFO L462 AbstractCegarLoop]: Abstraction has 33694 states and 142304 transitions. [2019-12-18 21:50:30,165 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:50:30,165 INFO L276 IsEmpty]: Start isEmpty. Operand 33694 states and 142304 transitions. [2019-12-18 21:50:30,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 21:50:30,175 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:50:30,175 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:50:30,177 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-18 21:50:30,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:50:30,177 INFO L82 PathProgramCache]: Analyzing trace with hash -1499462081, now seen corresponding path program 1 times [2019-12-18 21:50:30,178 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:50:30,178 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136611585] [2019-12-18 21:50:30,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:50:30,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:50:30,337 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-18 21:50:30,338 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136611585] [2019-12-18 21:50:30,338 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:50:30,338 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:50:30,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915579469] [2019-12-18 21:50:30,340 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:50:30,340 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:50:30,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:50:30,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:50:30,341 INFO L87 Difference]: Start difference. First operand 33694 states and 142304 transitions. Second operand 4 states. [2019-12-18 21:50:32,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:50:32,459 INFO L93 Difference]: Finished difference Result 52350 states and 214000 transitions. [2019-12-18 21:50:32,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:50:32,459 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-18 21:50:32,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:50:32,763 INFO L225 Difference]: With dead ends: 52350 [2019-12-18 21:50:32,763 INFO L226 Difference]: Without dead ends: 52322 [2019-12-18 21:50:32,764 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:50:33,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52322 states. [2019-12-18 21:50:34,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52322 to 46842. [2019-12-18 21:50:34,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46842 states. [2019-12-18 21:50:34,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46842 states to 46842 states and 193636 transitions. [2019-12-18 21:50:34,870 INFO L78 Accepts]: Start accepts. Automaton has 46842 states and 193636 transitions. Word has length 15 [2019-12-18 21:50:34,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:50:34,871 INFO L462 AbstractCegarLoop]: Abstraction has 46842 states and 193636 transitions. [2019-12-18 21:50:34,871 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:50:34,871 INFO L276 IsEmpty]: Start isEmpty. Operand 46842 states and 193636 transitions. [2019-12-18 21:50:34,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 21:50:34,874 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:50:34,874 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:50:34,875 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-18 21:50:34,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:50:34,875 INFO L82 PathProgramCache]: Analyzing trace with hash 1997976486, now seen corresponding path program 1 times [2019-12-18 21:50:34,875 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:50:34,876 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469071348] [2019-12-18 21:50:34,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:50:34,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:50:34,943 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-18 21:50:34,944 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469071348] [2019-12-18 21:50:34,947 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:50:34,947 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:50:34,947 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261343544] [2019-12-18 21:50:34,948 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:50:34,948 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:50:34,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:50:34,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:50:34,949 INFO L87 Difference]: Start difference. First operand 46842 states and 193636 transitions. Second operand 4 states. [2019-12-18 21:50:35,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:50:35,427 INFO L93 Difference]: Finished difference Result 57862 states and 237476 transitions. [2019-12-18 21:50:35,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:50:35,430 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-18 21:50:35,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:50:35,630 INFO L225 Difference]: With dead ends: 57862 [2019-12-18 21:50:35,631 INFO L226 Difference]: Without dead ends: 57862 [2019-12-18 21:50:35,631 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:50:38,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57862 states. [2019-12-18 21:50:39,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57862 to 51558. [2019-12-18 21:50:39,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51558 states. [2019-12-18 21:50:39,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51558 states to 51558 states and 212860 transitions. [2019-12-18 21:50:39,730 INFO L78 Accepts]: Start accepts. Automaton has 51558 states and 212860 transitions. Word has length 15 [2019-12-18 21:50:39,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:50:39,731 INFO L462 AbstractCegarLoop]: Abstraction has 51558 states and 212860 transitions. [2019-12-18 21:50:39,731 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:50:39,731 INFO L276 IsEmpty]: Start isEmpty. Operand 51558 states and 212860 transitions. [2019-12-18 21:50:39,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 21:50:39,748 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:50:39,749 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] [2019-12-18 21:50:39,749 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-18 21:50:39,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:50:39,749 INFO L82 PathProgramCache]: Analyzing trace with hash 188440407, now seen corresponding path program 1 times [2019-12-18 21:50:39,750 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:50:39,751 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093322845] [2019-12-18 21:50:39,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:50:39,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:50:39,881 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-18 21:50:39,882 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093322845] [2019-12-18 21:50:39,882 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:50:39,882 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:50:39,882 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512820774] [2019-12-18 21:50:39,883 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:50:39,883 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:50:39,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:50:39,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:50:39,884 INFO L87 Difference]: Start difference. First operand 51558 states and 212860 transitions. Second operand 5 states. [2019-12-18 21:50:41,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:50:41,137 INFO L93 Difference]: Finished difference Result 69038 states and 280320 transitions. [2019-12-18 21:50:41,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 21:50:41,138 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-12-18 21:50:41,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:50:41,359 INFO L225 Difference]: With dead ends: 69038 [2019-12-18 21:50:41,359 INFO L226 Difference]: Without dead ends: 69010 [2019-12-18 21:50:41,360 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 21:50:41,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69010 states. [2019-12-18 21:50:44,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69010 to 51618. [2019-12-18 21:50:44,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51618 states. [2019-12-18 21:50:45,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51618 states to 51618 states and 212640 transitions. [2019-12-18 21:50:45,116 INFO L78 Accepts]: Start accepts. Automaton has 51618 states and 212640 transitions. Word has length 21 [2019-12-18 21:50:45,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:50:45,117 INFO L462 AbstractCegarLoop]: Abstraction has 51618 states and 212640 transitions. [2019-12-18 21:50:45,117 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:50:45,117 INFO L276 IsEmpty]: Start isEmpty. Operand 51618 states and 212640 transitions. [2019-12-18 21:50:45,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-18 21:50:45,180 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:50:45,180 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-18 21:50:45,180 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-18 21:50:45,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:50:45,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1938437726, now seen corresponding path program 1 times [2019-12-18 21:50:45,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:50:45,181 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915039497] [2019-12-18 21:50:45,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:50:45,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:50:45,609 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-18 21:50:45,610 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915039497] [2019-12-18 21:50:45,610 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:50:45,610 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:50:45,610 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097687222] [2019-12-18 21:50:45,611 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:50:45,611 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:50:45,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:50:45,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:50:45,612 INFO L87 Difference]: Start difference. First operand 51618 states and 212640 transitions. Second operand 3 states. [2019-12-18 21:50:45,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:50:45,952 INFO L93 Difference]: Finished difference Result 65186 states and 266156 transitions. [2019-12-18 21:50:45,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:50:45,952 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-12-18 21:50:45,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:50:46,113 INFO L225 Difference]: With dead ends: 65186 [2019-12-18 21:50:46,113 INFO L226 Difference]: Without dead ends: 65186 [2019-12-18 21:50:46,113 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:50:46,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65186 states. [2019-12-18 21:50:49,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65186 to 56294. [2019-12-18 21:50:49,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56294 states. [2019-12-18 21:50:49,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56294 states to 56294 states and 231400 transitions. [2019-12-18 21:50:49,762 INFO L78 Accepts]: Start accepts. Automaton has 56294 states and 231400 transitions. Word has length 29 [2019-12-18 21:50:49,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:50:49,762 INFO L462 AbstractCegarLoop]: Abstraction has 56294 states and 231400 transitions. [2019-12-18 21:50:49,762 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:50:49,763 INFO L276 IsEmpty]: Start isEmpty. Operand 56294 states and 231400 transitions. [2019-12-18 21:50:49,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-18 21:50:49,803 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:50:49,803 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-18 21:50:49,803 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-18 21:50:49,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:50:49,803 INFO L82 PathProgramCache]: Analyzing trace with hash 1938201041, now seen corresponding path program 1 times [2019-12-18 21:50:49,804 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:50:49,804 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725480128] [2019-12-18 21:50:49,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:50:49,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:50:49,902 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-18 21:50:49,903 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725480128] [2019-12-18 21:50:49,903 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:50:49,903 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:50:49,904 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861445800] [2019-12-18 21:50:49,904 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:50:49,904 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:50:49,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:50:49,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:50:49,905 INFO L87 Difference]: Start difference. First operand 56294 states and 231400 transitions. Second operand 4 states. [2019-12-18 21:50:50,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:50:50,652 INFO L93 Difference]: Finished difference Result 45340 states and 171347 transitions. [2019-12-18 21:50:50,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 21:50:50,652 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2019-12-18 21:50:50,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:50:50,751 INFO L225 Difference]: With dead ends: 45340 [2019-12-18 21:50:50,751 INFO L226 Difference]: Without dead ends: 44232 [2019-12-18 21:50:50,752 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:50:50,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44232 states. [2019-12-18 21:50:51,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44232 to 44232. [2019-12-18 21:50:51,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44232 states. [2019-12-18 21:50:51,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44232 states to 44232 states and 167871 transitions. [2019-12-18 21:50:51,625 INFO L78 Accepts]: Start accepts. Automaton has 44232 states and 167871 transitions. Word has length 29 [2019-12-18 21:50:51,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:50:51,625 INFO L462 AbstractCegarLoop]: Abstraction has 44232 states and 167871 transitions. [2019-12-18 21:50:51,626 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:50:51,626 INFO L276 IsEmpty]: Start isEmpty. Operand 44232 states and 167871 transitions. [2019-12-18 21:50:51,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-18 21:50:51,654 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:50:51,654 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] [2019-12-18 21:50:51,654 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-18 21:50:51,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:50:51,654 INFO L82 PathProgramCache]: Analyzing trace with hash -1904073376, now seen corresponding path program 1 times [2019-12-18 21:50:51,655 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:50:51,655 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114795846] [2019-12-18 21:50:51,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:50:51,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:50:51,756 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-18 21:50:51,756 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114795846] [2019-12-18 21:50:51,757 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:50:51,757 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 21:50:51,757 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592141632] [2019-12-18 21:50:51,757 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:50:51,758 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:50:51,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:50:51,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:50:51,759 INFO L87 Difference]: Start difference. First operand 44232 states and 167871 transitions. Second operand 5 states. [2019-12-18 21:50:53,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:50:53,362 INFO L93 Difference]: Finished difference Result 19345 states and 60752 transitions. [2019-12-18 21:50:53,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:50:53,362 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-12-18 21:50:53,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:50:53,389 INFO L225 Difference]: With dead ends: 19345 [2019-12-18 21:50:53,389 INFO L226 Difference]: Without dead ends: 18469 [2019-12-18 21:50:53,390 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:50:53,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18469 states. [2019-12-18 21:50:53,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18469 to 18469. [2019-12-18 21:50:53,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18469 states. [2019-12-18 21:50:53,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18469 states to 18469 states and 57954 transitions. [2019-12-18 21:50:53,677 INFO L78 Accepts]: Start accepts. Automaton has 18469 states and 57954 transitions. Word has length 30 [2019-12-18 21:50:53,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:50:53,678 INFO L462 AbstractCegarLoop]: Abstraction has 18469 states and 57954 transitions. [2019-12-18 21:50:53,678 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:50:53,678 INFO L276 IsEmpty]: Start isEmpty. Operand 18469 states and 57954 transitions. [2019-12-18 21:50:53,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-18 21:50:53,688 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:50:53,689 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] [2019-12-18 21:50:53,689 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-18 21:50:53,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:50:53,689 INFO L82 PathProgramCache]: Analyzing trace with hash 700126081, now seen corresponding path program 1 times [2019-12-18 21:50:53,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:50:53,690 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321345245] [2019-12-18 21:50:53,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:50:53,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:50:53,774 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-18 21:50:53,774 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321345245] [2019-12-18 21:50:53,775 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:50:53,775 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:50:53,775 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656082793] [2019-12-18 21:50:53,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:50:53,776 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:50:53,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:50:53,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:50:53,776 INFO L87 Difference]: Start difference. First operand 18469 states and 57954 transitions. Second operand 6 states. [2019-12-18 21:50:53,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:50:53,868 INFO L93 Difference]: Finished difference Result 3432 states and 8687 transitions. [2019-12-18 21:50:53,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 21:50:53,869 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2019-12-18 21:50:53,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:50:53,873 INFO L225 Difference]: With dead ends: 3432 [2019-12-18 21:50:53,873 INFO L226 Difference]: Without dead ends: 3063 [2019-12-18 21:50:53,874 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-18 21:50:53,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3063 states. [2019-12-18 21:50:53,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3063 to 3063. [2019-12-18 21:50:53,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3063 states. [2019-12-18 21:50:53,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3063 states to 3063 states and 7649 transitions. [2019-12-18 21:50:53,908 INFO L78 Accepts]: Start accepts. Automaton has 3063 states and 7649 transitions. Word has length 31 [2019-12-18 21:50:53,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:50:53,908 INFO L462 AbstractCegarLoop]: Abstraction has 3063 states and 7649 transitions. [2019-12-18 21:50:53,908 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:50:53,908 INFO L276 IsEmpty]: Start isEmpty. Operand 3063 states and 7649 transitions. [2019-12-18 21:50:53,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-18 21:50:53,913 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:50:53,913 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] [2019-12-18 21:50:53,913 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-18 21:50:53,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:50:53,914 INFO L82 PathProgramCache]: Analyzing trace with hash -196360051, now seen corresponding path program 1 times [2019-12-18 21:50:53,914 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:50:53,914 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056193287] [2019-12-18 21:50:53,914 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:50:53,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:50:54,010 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-18 21:50:54,011 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056193287] [2019-12-18 21:50:54,011 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:50:54,011 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:50:54,012 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578057221] [2019-12-18 21:50:54,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:50:54,012 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:50:54,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:50:54,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:50:54,013 INFO L87 Difference]: Start difference. First operand 3063 states and 7649 transitions. Second operand 7 states. [2019-12-18 21:50:54,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:50:54,128 INFO L93 Difference]: Finished difference Result 1341 states and 3748 transitions. [2019-12-18 21:50:54,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 21:50:54,129 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2019-12-18 21:50:54,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:50:54,132 INFO L225 Difference]: With dead ends: 1341 [2019-12-18 21:50:54,132 INFO L226 Difference]: Without dead ends: 1292 [2019-12-18 21:50:54,133 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-12-18 21:50:54,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1292 states. [2019-12-18 21:50:54,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1292 to 1180. [2019-12-18 21:50:54,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1180 states. [2019-12-18 21:50:54,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1180 states to 1180 states and 3332 transitions. [2019-12-18 21:50:54,157 INFO L78 Accepts]: Start accepts. Automaton has 1180 states and 3332 transitions. Word has length 43 [2019-12-18 21:50:54,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:50:54,157 INFO L462 AbstractCegarLoop]: Abstraction has 1180 states and 3332 transitions. [2019-12-18 21:50:54,157 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:50:54,157 INFO L276 IsEmpty]: Start isEmpty. Operand 1180 states and 3332 transitions. [2019-12-18 21:50:54,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 21:50:54,161 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:50:54,161 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-18 21:50:54,161 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-18 21:50:54,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:50:54,162 INFO L82 PathProgramCache]: Analyzing trace with hash 443866773, now seen corresponding path program 1 times [2019-12-18 21:50:54,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:50:54,162 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718801851] [2019-12-18 21:50:54,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:50:54,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:50:54,364 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-18 21:50:54,364 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718801851] [2019-12-18 21:50:54,364 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:50:54,364 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 21:50:54,365 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618178014] [2019-12-18 21:50:54,365 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:50:54,365 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:50:54,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:50:54,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:50:54,366 INFO L87 Difference]: Start difference. First operand 1180 states and 3332 transitions. Second operand 7 states. [2019-12-18 21:50:54,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:50:54,883 INFO L93 Difference]: Finished difference Result 1646 states and 4530 transitions. [2019-12-18 21:50:54,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 21:50:54,886 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 58 [2019-12-18 21:50:54,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:50:54,889 INFO L225 Difference]: With dead ends: 1646 [2019-12-18 21:50:54,889 INFO L226 Difference]: Without dead ends: 1646 [2019-12-18 21:50:54,890 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-12-18 21:50:54,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1646 states. [2019-12-18 21:50:54,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1646 to 1509. [2019-12-18 21:50:54,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1509 states. [2019-12-18 21:50:54,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1509 states to 1509 states and 4178 transitions. [2019-12-18 21:50:54,906 INFO L78 Accepts]: Start accepts. Automaton has 1509 states and 4178 transitions. Word has length 58 [2019-12-18 21:50:54,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:50:54,906 INFO L462 AbstractCegarLoop]: Abstraction has 1509 states and 4178 transitions. [2019-12-18 21:50:54,907 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:50:54,907 INFO L276 IsEmpty]: Start isEmpty. Operand 1509 states and 4178 transitions. [2019-12-18 21:50:54,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 21:50:54,910 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:50:54,910 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-18 21:50:54,910 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-18 21:50:54,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:50:54,910 INFO L82 PathProgramCache]: Analyzing trace with hash -2143304257, now seen corresponding path program 2 times [2019-12-18 21:50:54,911 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:50:54,911 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714407366] [2019-12-18 21:50:54,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:50:54,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:50:55,005 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-18 21:50:55,006 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714407366] [2019-12-18 21:50:55,006 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:50:55,006 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:50:55,006 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822454800] [2019-12-18 21:50:55,007 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:50:55,007 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:50:55,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:50:55,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:50:55,008 INFO L87 Difference]: Start difference. First operand 1509 states and 4178 transitions. Second operand 5 states. [2019-12-18 21:50:55,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:50:55,255 INFO L93 Difference]: Finished difference Result 1998 states and 5544 transitions. [2019-12-18 21:50:55,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 21:50:55,255 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-12-18 21:50:55,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:50:55,259 INFO L225 Difference]: With dead ends: 1998 [2019-12-18 21:50:55,259 INFO L226 Difference]: Without dead ends: 1998 [2019-12-18 21:50:55,259 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:50:55,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1998 states. [2019-12-18 21:50:55,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1998 to 1605. [2019-12-18 21:50:55,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1605 states. [2019-12-18 21:50:55,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1605 states to 1605 states and 4458 transitions. [2019-12-18 21:50:55,279 INFO L78 Accepts]: Start accepts. Automaton has 1605 states and 4458 transitions. Word has length 58 [2019-12-18 21:50:55,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:50:55,279 INFO L462 AbstractCegarLoop]: Abstraction has 1605 states and 4458 transitions. [2019-12-18 21:50:55,279 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:50:55,280 INFO L276 IsEmpty]: Start isEmpty. Operand 1605 states and 4458 transitions. [2019-12-18 21:50:55,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 21:50:55,281 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:50:55,281 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-18 21:50:55,282 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-18 21:50:55,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:50:55,282 INFO L82 PathProgramCache]: Analyzing trace with hash -1535525935, now seen corresponding path program 3 times [2019-12-18 21:50:55,282 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:50:55,282 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701938004] [2019-12-18 21:50:55,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:50:55,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:50:55,393 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-18 21:50:55,394 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701938004] [2019-12-18 21:50:55,394 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:50:55,394 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:50:55,394 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737350927] [2019-12-18 21:50:55,394 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:50:55,395 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:50:55,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:50:55,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:50:55,395 INFO L87 Difference]: Start difference. First operand 1605 states and 4458 transitions. Second operand 6 states. [2019-12-18 21:50:55,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:50:55,665 INFO L93 Difference]: Finished difference Result 2195 states and 6078 transitions. [2019-12-18 21:50:55,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 21:50:55,666 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2019-12-18 21:50:55,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:50:55,670 INFO L225 Difference]: With dead ends: 2195 [2019-12-18 21:50:55,670 INFO L226 Difference]: Without dead ends: 2195 [2019-12-18 21:50:55,670 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 21:50:55,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2195 states. [2019-12-18 21:50:55,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2195 to 1549. [2019-12-18 21:50:55,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1549 states. [2019-12-18 21:50:55,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1549 states to 1549 states and 4298 transitions. [2019-12-18 21:50:55,692 INFO L78 Accepts]: Start accepts. Automaton has 1549 states and 4298 transitions. Word has length 58 [2019-12-18 21:50:55,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:50:55,693 INFO L462 AbstractCegarLoop]: Abstraction has 1549 states and 4298 transitions. [2019-12-18 21:50:55,693 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:50:55,693 INFO L276 IsEmpty]: Start isEmpty. Operand 1549 states and 4298 transitions. [2019-12-18 21:50:55,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 21:50:55,696 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:50:55,696 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-18 21:50:55,696 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-18 21:50:55,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:50:55,697 INFO L82 PathProgramCache]: Analyzing trace with hash 900965748, now seen corresponding path program 1 times [2019-12-18 21:50:55,697 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:50:55,697 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271394178] [2019-12-18 21:50:55,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:50:55,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:50:55,955 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-18 21:50:55,956 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271394178] [2019-12-18 21:50:55,956 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:50:55,956 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 21:50:55,956 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325174353] [2019-12-18 21:50:55,957 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 21:50:55,957 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:50:55,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 21:50:55,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-12-18 21:50:55,957 INFO L87 Difference]: Start difference. First operand 1549 states and 4298 transitions. Second operand 12 states. [2019-12-18 21:50:57,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:50:57,284 INFO L93 Difference]: Finished difference Result 3638 states and 9214 transitions. [2019-12-18 21:50:57,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-18 21:50:57,285 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 59 [2019-12-18 21:50:57,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:50:57,289 INFO L225 Difference]: With dead ends: 3638 [2019-12-18 21:50:57,289 INFO L226 Difference]: Without dead ends: 2093 [2019-12-18 21:50:57,290 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=253, Invalid=1007, Unknown=0, NotChecked=0, Total=1260 [2019-12-18 21:50:57,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2093 states. [2019-12-18 21:50:57,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2093 to 1403. [2019-12-18 21:50:57,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1403 states. [2019-12-18 21:50:57,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1403 states to 1403 states and 3804 transitions. [2019-12-18 21:50:57,309 INFO L78 Accepts]: Start accepts. Automaton has 1403 states and 3804 transitions. Word has length 59 [2019-12-18 21:50:57,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:50:57,309 INFO L462 AbstractCegarLoop]: Abstraction has 1403 states and 3804 transitions. [2019-12-18 21:50:57,309 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 21:50:57,309 INFO L276 IsEmpty]: Start isEmpty. Operand 1403 states and 3804 transitions. [2019-12-18 21:50:57,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 21:50:57,311 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:50:57,311 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-18 21:50:57,311 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-18 21:50:57,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:50:57,311 INFO L82 PathProgramCache]: Analyzing trace with hash -746332050, now seen corresponding path program 2 times [2019-12-18 21:50:57,312 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:50:57,312 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116623661] [2019-12-18 21:50:57,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:50:57,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:50:57,390 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-18 21:50:57,391 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116623661] [2019-12-18 21:50:57,391 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:50:57,391 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:50:57,391 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008289050] [2019-12-18 21:50:57,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:50:57,392 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:50:57,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:50:57,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:50:57,392 INFO L87 Difference]: Start difference. First operand 1403 states and 3804 transitions. Second operand 3 states. [2019-12-18 21:50:57,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:50:57,432 INFO L93 Difference]: Finished difference Result 1402 states and 3802 transitions. [2019-12-18 21:50:57,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:50:57,432 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-18 21:50:57,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:50:57,434 INFO L225 Difference]: With dead ends: 1402 [2019-12-18 21:50:57,435 INFO L226 Difference]: Without dead ends: 1402 [2019-12-18 21:50:57,435 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-18 21:50:57,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2019-12-18 21:50:57,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 1073. [2019-12-18 21:50:57,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1073 states. [2019-12-18 21:50:57,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1073 states to 1073 states and 2888 transitions. [2019-12-18 21:50:57,454 INFO L78 Accepts]: Start accepts. Automaton has 1073 states and 2888 transitions. Word has length 59 [2019-12-18 21:50:57,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:50:57,454 INFO L462 AbstractCegarLoop]: Abstraction has 1073 states and 2888 transitions. [2019-12-18 21:50:57,454 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:50:57,455 INFO L276 IsEmpty]: Start isEmpty. Operand 1073 states and 2888 transitions. [2019-12-18 21:50:57,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 21:50:57,457 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:50:57,457 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-18 21:50:57,457 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-18 21:50:57,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:50:57,457 INFO L82 PathProgramCache]: Analyzing trace with hash -1912027671, now seen corresponding path program 1 times [2019-12-18 21:50:57,457 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:50:57,458 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539225208] [2019-12-18 21:50:57,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:50:57,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:50:57,529 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-18 21:50:57,530 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539225208] [2019-12-18 21:50:57,530 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:50:57,530 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:50:57,530 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065281814] [2019-12-18 21:50:57,531 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:50:57,531 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:50:57,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:50:57,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:50:57,531 INFO L87 Difference]: Start difference. First operand 1073 states and 2888 transitions. Second operand 3 states. [2019-12-18 21:50:57,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:50:57,546 INFO L93 Difference]: Finished difference Result 1019 states and 2715 transitions. [2019-12-18 21:50:57,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:50:57,547 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-18 21:50:57,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:50:57,548 INFO L225 Difference]: With dead ends: 1019 [2019-12-18 21:50:57,549 INFO L226 Difference]: Without dead ends: 1019 [2019-12-18 21:50:57,551 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-18 21:50:57,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1019 states. [2019-12-18 21:50:57,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1019 to 1019. [2019-12-18 21:50:57,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1019 states. [2019-12-18 21:50:57,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1019 states to 1019 states and 2715 transitions. [2019-12-18 21:50:57,566 INFO L78 Accepts]: Start accepts. Automaton has 1019 states and 2715 transitions. Word has length 59 [2019-12-18 21:50:57,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:50:57,566 INFO L462 AbstractCegarLoop]: Abstraction has 1019 states and 2715 transitions. [2019-12-18 21:50:57,566 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:50:57,567 INFO L276 IsEmpty]: Start isEmpty. Operand 1019 states and 2715 transitions. [2019-12-18 21:50:57,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 21:50:57,568 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:50:57,568 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-18 21:50:57,569 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-18 21:50:57,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:50:57,569 INFO L82 PathProgramCache]: Analyzing trace with hash 792391964, now seen corresponding path program 1 times [2019-12-18 21:50:57,569 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:50:57,569 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337132652] [2019-12-18 21:50:57,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:50:57,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:50:57,719 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-18 21:50:57,720 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337132652] [2019-12-18 21:50:57,720 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:50:57,720 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:50:57,720 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740572143] [2019-12-18 21:50:57,721 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:50:57,721 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:50:57,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:50:57,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:50:57,722 INFO L87 Difference]: Start difference. First operand 1019 states and 2715 transitions. Second operand 7 states. [2019-12-18 21:50:57,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:50:57,857 INFO L93 Difference]: Finished difference Result 1958 states and 4862 transitions. [2019-12-18 21:50:57,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 21:50:57,858 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 60 [2019-12-18 21:50:57,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:50:57,859 INFO L225 Difference]: With dead ends: 1958 [2019-12-18 21:50:57,859 INFO L226 Difference]: Without dead ends: 795 [2019-12-18 21:50:57,860 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 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-18 21:50:57,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2019-12-18 21:50:57,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 570. [2019-12-18 21:50:57,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 570 states. [2019-12-18 21:50:57,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 1221 transitions. [2019-12-18 21:50:57,868 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 1221 transitions. Word has length 60 [2019-12-18 21:50:57,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:50:57,868 INFO L462 AbstractCegarLoop]: Abstraction has 570 states and 1221 transitions. [2019-12-18 21:50:57,868 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:50:57,868 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 1221 transitions. [2019-12-18 21:50:57,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 21:50:57,869 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:50:57,869 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-18 21:50:57,869 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-18 21:50:57,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:50:57,869 INFO L82 PathProgramCache]: Analyzing trace with hash -631890150, now seen corresponding path program 2 times [2019-12-18 21:50:57,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:50:57,870 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649772334] [2019-12-18 21:50:57,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:50:57,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:50:57,987 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-18 21:50:57,988 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649772334] [2019-12-18 21:50:57,988 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:50:57,988 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:50:57,989 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153865468] [2019-12-18 21:50:57,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:50:57,989 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:50:57,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:50:57,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:50:57,990 INFO L87 Difference]: Start difference. First operand 570 states and 1221 transitions. Second operand 6 states. [2019-12-18 21:50:58,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:50:58,064 INFO L93 Difference]: Finished difference Result 807 states and 1666 transitions. [2019-12-18 21:50:58,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 21:50:58,064 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2019-12-18 21:50:58,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:50:58,065 INFO L225 Difference]: With dead ends: 807 [2019-12-18 21:50:58,065 INFO L226 Difference]: Without dead ends: 238 [2019-12-18 21:50:58,066 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 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-18 21:50:58,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2019-12-18 21:50:58,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 214. [2019-12-18 21:50:58,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2019-12-18 21:50:58,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 362 transitions. [2019-12-18 21:50:58,069 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 362 transitions. Word has length 60 [2019-12-18 21:50:58,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:50:58,069 INFO L462 AbstractCegarLoop]: Abstraction has 214 states and 362 transitions. [2019-12-18 21:50:58,070 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:50:58,070 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 362 transitions. [2019-12-18 21:50:58,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 21:50:58,070 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:50:58,070 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-18 21:50:58,071 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-18 21:50:58,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:50:58,071 INFO L82 PathProgramCache]: Analyzing trace with hash 1041044752, now seen corresponding path program 3 times [2019-12-18 21:50:58,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:50:58,072 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501980091] [2019-12-18 21:50:58,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:50:58,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:50:58,384 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-18 21:50:58,384 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501980091] [2019-12-18 21:50:58,387 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:50:58,387 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 21:50:58,390 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092960896] [2019-12-18 21:50:58,390 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 21:50:58,390 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:50:58,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 21:50:58,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-12-18 21:50:58,391 INFO L87 Difference]: Start difference. First operand 214 states and 362 transitions. Second operand 14 states. [2019-12-18 21:50:59,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:50:59,003 INFO L93 Difference]: Finished difference Result 372 states and 620 transitions. [2019-12-18 21:50:59,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 21:50:59,006 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 60 [2019-12-18 21:50:59,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:50:59,006 INFO L225 Difference]: With dead ends: 372 [2019-12-18 21:50:59,006 INFO L226 Difference]: Without dead ends: 340 [2019-12-18 21:50:59,007 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=130, Invalid=520, Unknown=0, NotChecked=0, Total=650 [2019-12-18 21:50:59,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2019-12-18 21:50:59,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 322. [2019-12-18 21:50:59,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2019-12-18 21:50:59,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 547 transitions. [2019-12-18 21:50:59,011 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 547 transitions. Word has length 60 [2019-12-18 21:50:59,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:50:59,011 INFO L462 AbstractCegarLoop]: Abstraction has 322 states and 547 transitions. [2019-12-18 21:50:59,011 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 21:50:59,011 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 547 transitions. [2019-12-18 21:50:59,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 21:50:59,011 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:50:59,012 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-18 21:50:59,012 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:50:59,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:50:59,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1167049754, now seen corresponding path program 4 times [2019-12-18 21:50:59,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:50:59,012 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039585998] [2019-12-18 21:50:59,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:50:59,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:50:59,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:50:59,125 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 21:50:59,126 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 21:50:59,130 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] ULTIMATE.startENTRY-->L823: Formula: (let ((.cse0 (store |v_#valid_72| 0 0))) (and (= (store |v_#length_32| |v_ULTIMATE.start_main_~#t1477~0.base_22| 4) |v_#length_31|) (= v_~main$tmp_guard0~0_10 0) (= 0 v_~weak$$choice0~0_8) (= 0 v_~z$r_buff1_thd1~0_10) (= 0 v_~__unbuffered_p3_EAX~0_10) (= 0 |v_ULTIMATE.start_main_~#t1477~0.offset_17|) (= v_~z$r_buff0_thd4~0_27 0) (= v_~a~0_11 0) (= |v_#NULL.offset_6| 0) (= v_~z~0_26 0) (= v_~main$tmp_guard1~0_11 0) (= 0 v_~z$r_buff1_thd3~0_18) (< 0 |v_#StackHeapBarrier_21|) (= v_~x~0_13 0) (= 0 v_~z$w_buff1~0_21) (= 0 v_~z$r_buff1_thd4~0_20) (= 0 v_~z$flush_delayed~0_15) (= (store |v_#memory_int_28| |v_ULTIMATE.start_main_~#t1477~0.base_22| (store (select |v_#memory_int_28| |v_ULTIMATE.start_main_~#t1477~0.base_22|) |v_ULTIMATE.start_main_~#t1477~0.offset_17| 0)) |v_#memory_int_27|) (= v_~z$read_delayed_var~0.offset_7 0) (= v_~z$r_buff0_thd3~0_19 0) (= 0 v_~__unbuffered_p1_EAX~0_10) (= (select .cse0 |v_ULTIMATE.start_main_~#t1477~0.base_22|) 0) (= v_~z$w_buff0_used~0_105 0) (= 0 v_~z$r_buff1_thd0~0_48) (= 0 v_~z$r_buff1_thd2~0_10) (= 0 |v_#NULL.base_6|) (= 0 v_~weak$$choice2~0_33) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$read_delayed~0_7 0) (= 0 v_~__unbuffered_cnt~0_27) (= v_~z$r_buff0_thd1~0_9 0) (= v_~z$mem_tmp~0_10 0) (< |v_#StackHeapBarrier_21| |v_ULTIMATE.start_main_~#t1477~0.base_22|) (= v_~z$r_buff0_thd0~0_80 0) (= v_~z$r_buff0_thd2~0_9 0) (= v_~y~0_10 0) (= 0 v_~z$w_buff0~0_25) (= 0 v_~z$w_buff1_used~0_65) (= |v_#valid_70| (store .cse0 |v_ULTIMATE.start_main_~#t1477~0.base_22| 1)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_21|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_28|, #length=|v_#length_32|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_13|, ULTIMATE.start_main_~#t1480~0.offset=|v_ULTIMATE.start_main_~#t1480~0.offset_16|, ULTIMATE.start_main_~#t1479~0.base=|v_ULTIMATE.start_main_~#t1479~0.base_20|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_10, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_11|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_16|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_14|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_15|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_11|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_17|, ~a~0=v_~a~0_11, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_80, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_10, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_27, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_10, #length=|v_#length_31|, ~z$mem_tmp~0=v_~z$mem_tmp~0_10, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_17|, ULTIMATE.start_main_~#t1477~0.base=|v_ULTIMATE.start_main_~#t1477~0.base_22|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_15|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_65, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_16|, ~z$flush_delayed~0=v_~z$flush_delayed~0_15, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_13|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_16|, ~weak$$choice0~0=v_~weak$$choice0~0_8, #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_10, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_9|, ~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_19, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_27, ~x~0=v_~x~0_13, ULTIMATE.start_main_~#t1477~0.offset=|v_ULTIMATE.start_main_~#t1477~0.offset_17|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_20, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_14|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_15|, ~z$w_buff1~0=v_~z$w_buff1~0_21, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_11, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_13|, ~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_11|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_17|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_11|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_15|, ULTIMATE.start_main_~#t1478~0.base=|v_ULTIMATE.start_main_~#t1478~0.base_23|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_16|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_48, ULTIMATE.start_main_#t~nondet26=|v_ULTIMATE.start_main_#t~nondet26_9|, ~y~0=v_~y~0_10, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_9, ULTIMATE.start_main_~#t1480~0.base=|v_ULTIMATE.start_main_~#t1480~0.base_20|, ~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_13|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_9|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_18, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_17|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_14|, ULTIMATE.start_main_~#t1479~0.offset=|v_ULTIMATE.start_main_~#t1479~0.offset_17|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_14|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_16|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_15|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, #valid=|v_#valid_70|, #memory_int=|v_#memory_int_27|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_9|, ULTIMATE.start_main_~#t1478~0.offset=|v_ULTIMATE.start_main_~#t1478~0.offset_18|, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_8|, ~z~0=v_~z~0_26, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_~#t1480~0.offset, ULTIMATE.start_main_~#t1479~0.base, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, 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, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~z$mem_tmp~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_~#t1477~0.base, 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, ULTIMATE.start_main_~#t1477~0.offset, ~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_~#t1478~0.base, ULTIMATE.start_main_#t~ite30, ~z$r_buff1_thd0~0, ULTIMATE.start_main_#t~nondet26, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t1480~0.base, ~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_#t~ite38, ULTIMATE.start_main_~#t1479~0.offset, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_main_~#t1478~0.offset, ULTIMATE.start_main_#t~nondet18, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 21:50:59,131 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L823-1-->L825: Formula: (and (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t1478~0.base_13|) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1478~0.base_13| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1478~0.base_13|) |v_ULTIMATE.start_main_~#t1478~0.offset_11| 1)) |v_#memory_int_19|) (= (select |v_#valid_47| |v_ULTIMATE.start_main_~#t1478~0.base_13|) 0) (= 0 |v_ULTIMATE.start_main_~#t1478~0.offset_11|) (not (= 0 |v_ULTIMATE.start_main_~#t1478~0.base_13|)) (= (store |v_#valid_47| |v_ULTIMATE.start_main_~#t1478~0.base_13| 1) |v_#valid_46|) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1478~0.base_13| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_20|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t1478~0.base=|v_ULTIMATE.start_main_~#t1478~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, ULTIMATE.start_main_~#t1478~0.offset=|v_ULTIMATE.start_main_~#t1478~0.offset_11|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1478~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_~#t1478~0.offset, #length] because there is no mapped edge [2019-12-18 21:50:59,131 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L825-1-->L827: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t1479~0.offset_10|) (= (store |v_#length_20| |v_ULTIMATE.start_main_~#t1479~0.base_10| 4) |v_#length_19|) (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t1479~0.base_10| 1)) (= (select |v_#valid_41| |v_ULTIMATE.start_main_~#t1479~0.base_10|) 0) (not (= 0 |v_ULTIMATE.start_main_~#t1479~0.base_10|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1479~0.base_10|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1479~0.base_10| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1479~0.base_10|) |v_ULTIMATE.start_main_~#t1479~0.offset_10| 2)) |v_#memory_int_15|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_16|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t1479~0.base=|v_ULTIMATE.start_main_~#t1479~0.base_10|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_5|, ULTIMATE.start_main_~#t1479~0.offset=|v_ULTIMATE.start_main_~#t1479~0.offset_10|, #length=|v_#length_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1479~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_main_~#t1479~0.offset, #length] because there is no mapped edge [2019-12-18 21:50:59,132 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L827-1-->L829: Formula: (and (= |v_#valid_44| (store |v_#valid_45| |v_ULTIMATE.start_main_~#t1480~0.base_11| 1)) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1480~0.base_11|) (= (select |v_#valid_45| |v_ULTIMATE.start_main_~#t1480~0.base_11|) 0) (not (= |v_ULTIMATE.start_main_~#t1480~0.base_11| 0)) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1480~0.base_11| 4)) (= |v_ULTIMATE.start_main_~#t1480~0.offset_10| 0) (= |v_#memory_int_17| (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1480~0.base_11| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1480~0.base_11|) |v_ULTIMATE.start_main_~#t1480~0.offset_10| 3)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t1480~0.base=|v_ULTIMATE.start_main_~#t1480~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_~#t1480~0.offset=|v_ULTIMATE.start_main_~#t1480~0.offset_10|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_17|, #length=|v_#length_21|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1480~0.base, ULTIMATE.start_main_~#t1480~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet17] because there is no mapped edge [2019-12-18 21:50:59,134 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L4-->L800: Formula: (and (= ~__unbuffered_p3_EAX~0_Out-565890772 ~a~0_In-565890772) (= ~z$r_buff1_thd3~0_Out-565890772 ~z$r_buff0_thd3~0_In-565890772) (= ~z$r_buff0_thd4~0_In-565890772 ~z$r_buff1_thd4~0_Out-565890772) (= ~z$r_buff1_thd2~0_Out-565890772 ~z$r_buff0_thd2~0_In-565890772) (= ~z$r_buff1_thd0~0_Out-565890772 ~z$r_buff0_thd0~0_In-565890772) (= ~z$r_buff0_thd1~0_In-565890772 ~z$r_buff1_thd1~0_Out-565890772) (not (= P3Thread1of1ForFork3___VERIFIER_assert_~expression_In-565890772 0)) (= ~z$r_buff0_thd4~0_Out-565890772 1)) InVars {~a~0=~a~0_In-565890772, P3Thread1of1ForFork3___VERIFIER_assert_~expression=P3Thread1of1ForFork3___VERIFIER_assert_~expression_In-565890772, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-565890772, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-565890772, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-565890772, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-565890772, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-565890772} OutVars{P3Thread1of1ForFork3___VERIFIER_assert_~expression=P3Thread1of1ForFork3___VERIFIER_assert_~expression_In-565890772, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_Out-565890772, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_Out-565890772, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out-565890772, ~a~0=~a~0_In-565890772, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-565890772, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out-565890772, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out-565890772, ~__unbuffered_p3_EAX~0=~__unbuffered_p3_EAX~0_Out-565890772, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-565890772, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-565890772, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-565890772, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-565890772} AuxVars[] AssignedVars[~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] because there is no mapped edge [2019-12-18 21:50:59,135 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [737] [737] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork0_~arg.base_5 |v_P0Thread1of1ForFork0_#in~arg.base_5|) (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= 1 v_~a~0_6) (= 1 v_~x~0_9) (= v_P0Thread1of1ForFork0_~arg.offset_5 |v_P0Thread1of1ForFork0_#in~arg.offset_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) 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_17} OutVars{~a~0=v_~a~0_6, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, 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_16, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_5, ~x~0=v_~x~0_9, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_5} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_~arg.base, ~x~0, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-18 21:50:59,135 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] P1ENTRY-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_22 1) v_~__unbuffered_cnt~0_21) (= v_~__unbuffered_p1_EAX~0_7 v_~y~0_7) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= |v_P1Thread1of1ForFork1_#in~arg.offset_5| v_P1Thread1of1ForFork1_~arg.offset_5) (= v_~x~0_10 2) (= v_P1Thread1of1ForFork1_~arg.base_5 |v_P1Thread1of1ForFork1_#in~arg.base_5|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_5|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, ~y~0=v_~y~0_7} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_5, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_7, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_5, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_5|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, ~y~0=v_~y~0_7, ~x~0=v_~x~0_10, 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-18 21:50:59,136 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L801-->L801-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In1925927120 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In1925927120 256)))) (or (and (= |P3Thread1of1ForFork3_#t~ite11_Out1925927120| ~z$w_buff0_used~0_In1925927120) (or .cse0 .cse1)) (and (= 0 |P3Thread1of1ForFork3_#t~ite11_Out1925927120|) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1925927120, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1925927120} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1925927120, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1925927120, P3Thread1of1ForFork3_#t~ite11=|P3Thread1of1ForFork3_#t~ite11_Out1925927120|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite11] because there is no mapped edge [2019-12-18 21:50:59,137 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L770-2-->L770-4: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd3~0_In1452738787 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In1452738787 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite3_Out1452738787| ~z$w_buff1~0_In1452738787) (not .cse1)) (and (or .cse0 .cse1) (= ~z~0_In1452738787 |P2Thread1of1ForFork2_#t~ite3_Out1452738787|)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1452738787, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1452738787, ~z$w_buff1~0=~z$w_buff1~0_In1452738787, ~z~0=~z~0_In1452738787} OutVars{P2Thread1of1ForFork2_#t~ite3=|P2Thread1of1ForFork2_#t~ite3_Out1452738787|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1452738787, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1452738787, ~z$w_buff1~0=~z$w_buff1~0_In1452738787, ~z~0=~z~0_In1452738787} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-18 21:50:59,137 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L770-4-->L771: Formula: (= v_~z~0_19 |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_19} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite4, P2Thread1of1ForFork2_#t~ite3, ~z~0] because there is no mapped edge [2019-12-18 21:50:59,138 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L802-->L802-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In-1560267941 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1560267941 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-1560267941 256))) (.cse2 (= (mod ~z$r_buff1_thd4~0_In-1560267941 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In-1560267941 |P3Thread1of1ForFork3_#t~ite12_Out-1560267941|)) (and (= 0 |P3Thread1of1ForFork3_#t~ite12_Out-1560267941|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1560267941, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1560267941, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1560267941, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1560267941} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1560267941, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1560267941, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1560267941, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1560267941, P3Thread1of1ForFork3_#t~ite12=|P3Thread1of1ForFork3_#t~ite12_Out-1560267941|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite12] because there is no mapped edge [2019-12-18 21:50:59,139 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L803-->L804: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd4~0_In-1954264111 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-1954264111 256) 0))) (or (and (= ~z$r_buff0_thd4~0_Out-1954264111 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~z$r_buff0_thd4~0_Out-1954264111 ~z$r_buff0_thd4~0_In-1954264111)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1954264111, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1954264111} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1954264111, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-1954264111, P3Thread1of1ForFork3_#t~ite13=|P3Thread1of1ForFork3_#t~ite13_Out-1954264111|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~ite13] because there is no mapped edge [2019-12-18 21:50:59,139 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L804-->L804-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff0_thd4~0_In-1328502906 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-1328502906 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd4~0_In-1328502906 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In-1328502906 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P3Thread1of1ForFork3_#t~ite14_Out-1328502906|)) (and (or .cse2 .cse3) (= ~z$r_buff1_thd4~0_In-1328502906 |P3Thread1of1ForFork3_#t~ite14_Out-1328502906|) (or .cse0 .cse1)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1328502906, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1328502906, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1328502906, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1328502906} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1328502906, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1328502906, P3Thread1of1ForFork3_#t~ite14=|P3Thread1of1ForFork3_#t~ite14_Out-1328502906|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1328502906, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1328502906} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite14] because there is no mapped edge [2019-12-18 21:50:59,140 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L804-2-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork3_#t~ite14_8| v_~z$r_buff1_thd4~0_16) (= 0 |v_P3Thread1of1ForFork3_#res.offset_5|) (= 0 |v_P3Thread1of1ForFork3_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_20 1) v_~__unbuffered_cnt~0_19)) InVars {P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_16, P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_7|, P3Thread1of1ForFork3_#res.base=|v_P3Thread1of1ForFork3_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19, 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-18 21:50:59,140 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L771-->L771-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1841222186 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-1841222186 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork2_#t~ite5_Out-1841222186|)) (and (= ~z$w_buff0_used~0_In-1841222186 |P2Thread1of1ForFork2_#t~ite5_Out-1841222186|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1841222186, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1841222186} OutVars{P2Thread1of1ForFork2_#t~ite5=|P2Thread1of1ForFork2_#t~ite5_Out-1841222186|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1841222186, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1841222186} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-18 21:50:59,141 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L772-->L772-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff0_thd3~0_In759362204 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In759362204 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd3~0_In759362204 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In759362204 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In759362204 |P2Thread1of1ForFork2_#t~ite6_Out759362204|) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |P2Thread1of1ForFork2_#t~ite6_Out759362204| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In759362204, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In759362204, ~z$w_buff1_used~0=~z$w_buff1_used~0_In759362204, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In759362204} OutVars{P2Thread1of1ForFork2_#t~ite6=|P2Thread1of1ForFork2_#t~ite6_Out759362204|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In759362204, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In759362204, ~z$w_buff1_used~0=~z$w_buff1_used~0_In759362204, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In759362204} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-18 21:50:59,142 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L773-->L773-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1008778789 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-1008778789 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork2_#t~ite7_Out-1008778789|)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork2_#t~ite7_Out-1008778789| ~z$r_buff0_thd3~0_In-1008778789)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1008778789, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1008778789} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1008778789, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1008778789, P2Thread1of1ForFork2_#t~ite7=|P2Thread1of1ForFork2_#t~ite7_Out-1008778789|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-18 21:50:59,143 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L774-->L774-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-2016335803 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-2016335803 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd3~0_In-2016335803 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-2016335803 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd3~0_In-2016335803 |P2Thread1of1ForFork2_#t~ite8_Out-2016335803|)) (and (= 0 |P2Thread1of1ForFork2_#t~ite8_Out-2016335803|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2016335803, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-2016335803, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2016335803, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2016335803} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-2016335803, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-2016335803, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2016335803, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2016335803, P2Thread1of1ForFork2_#t~ite8=|P2Thread1of1ForFork2_#t~ite8_Out-2016335803|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-18 21:50:59,143 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L774-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_24 1) v_~__unbuffered_cnt~0_23) (= v_~z$r_buff1_thd3~0_14 |v_P2Thread1of1ForFork2_#t~ite8_8|) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_24, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_8|} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_14, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_23, 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-18 21:50:59,144 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [652] [652] L833-->L835-2: Formula: (and (or (= 0 (mod v_~z$r_buff0_thd0~0_50 256)) (= 0 (mod v_~z$w_buff0_used~0_72 256))) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_50, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_72, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_50, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_72, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 21:50:59,144 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L835-2-->L835-4: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd0~0_In-423787523 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-423787523 256)))) (or (and (not .cse0) (not .cse1) (= ~z$w_buff1~0_In-423787523 |ULTIMATE.start_main_#t~ite19_Out-423787523|)) (and (= ~z~0_In-423787523 |ULTIMATE.start_main_#t~ite19_Out-423787523|) (or .cse1 .cse0)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-423787523, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-423787523, ~z$w_buff1~0=~z$w_buff1~0_In-423787523, ~z~0=~z~0_In-423787523} OutVars{ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-423787523|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-423787523, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-423787523, ~z$w_buff1~0=~z$w_buff1~0_In-423787523, ~z~0=~z~0_In-423787523} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-18 21:50:59,144 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L835-4-->L836: Formula: (= v_~z~0_18 |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_18, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19, ~z~0, ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-18 21:50:59,144 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L836-->L836-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In613752587 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In613752587 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite21_Out613752587| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite21_Out613752587| ~z$w_buff0_used~0_In613752587)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In613752587, ~z$w_buff0_used~0=~z$w_buff0_used~0_In613752587} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In613752587, ~z$w_buff0_used~0=~z$w_buff0_used~0_In613752587, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out613752587|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-18 21:50:59,145 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L837-->L837-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-647540794 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In-647540794 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd0~0_In-647540794 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In-647540794 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite22_Out-647540794|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$w_buff1_used~0_In-647540794 |ULTIMATE.start_main_#t~ite22_Out-647540794|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-647540794, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-647540794, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-647540794, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-647540794} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-647540794, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-647540794, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-647540794, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-647540794, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-647540794|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-18 21:50:59,146 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L838-->L838-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1468157527 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In1468157527 256) 0))) (or (and (= ~z$r_buff0_thd0~0_In1468157527 |ULTIMATE.start_main_#t~ite23_Out1468157527|) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite23_Out1468157527|) (not .cse1) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1468157527, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1468157527} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1468157527, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1468157527, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out1468157527|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-18 21:50:59,147 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L839-->L839-2: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd0~0_In-436065853 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In-436065853 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-436065853 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-436065853 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite24_Out-436065853|)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~z$r_buff1_thd0~0_In-436065853 |ULTIMATE.start_main_#t~ite24_Out-436065853|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-436065853, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-436065853, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-436065853, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-436065853} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-436065853, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-436065853, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-436065853, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-436065853|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-436065853} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24] because there is no mapped edge [2019-12-18 21:50:59,151 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L848-->L848-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-731703558 256)))) (or (and (= |ULTIMATE.start_main_#t~ite34_Out-731703558| |ULTIMATE.start_main_#t~ite33_Out-731703558|) (= ~z$w_buff1~0_In-731703558 |ULTIMATE.start_main_#t~ite33_Out-731703558|) .cse0 (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In-731703558 256) 0))) (or (and (= (mod ~z$r_buff1_thd0~0_In-731703558 256) 0) .cse1) (and (= (mod ~z$w_buff1_used~0_In-731703558 256) 0) .cse1) (= 0 (mod ~z$w_buff0_used~0_In-731703558 256))))) (and (= |ULTIMATE.start_main_#t~ite33_In-731703558| |ULTIMATE.start_main_#t~ite33_Out-731703558|) (not .cse0) (= |ULTIMATE.start_main_#t~ite34_Out-731703558| ~z$w_buff1~0_In-731703558)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-731703558, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-731703558, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-731703558, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-731703558, ~z$w_buff1~0=~z$w_buff1~0_In-731703558, ~weak$$choice2~0=~weak$$choice2~0_In-731703558, ULTIMATE.start_main_#t~ite33=|ULTIMATE.start_main_#t~ite33_In-731703558|} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-731703558, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-731703558, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-731703558, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-731703558, ~z$w_buff1~0=~z$w_buff1~0_In-731703558, ~weak$$choice2~0=~weak$$choice2~0_In-731703558, ULTIMATE.start_main_#t~ite33=|ULTIMATE.start_main_#t~ite33_Out-731703558|, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out-731703558|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite33, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-18 21:50:59,154 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L850-->L850-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-357177674 256) 0))) (or (and (= ~z$w_buff1_used~0_In-357177674 |ULTIMATE.start_main_#t~ite40_Out-357177674|) (= |ULTIMATE.start_main_#t~ite39_In-357177674| |ULTIMATE.start_main_#t~ite39_Out-357177674|) (not .cse0)) (and (= ~z$w_buff1_used~0_In-357177674 |ULTIMATE.start_main_#t~ite39_Out-357177674|) (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In-357177674 256) 0))) (or (and .cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-357177674 256))) (= (mod ~z$w_buff0_used~0_In-357177674 256) 0) (and .cse1 (= 0 (mod ~z$w_buff1_used~0_In-357177674 256))))) .cse0 (= |ULTIMATE.start_main_#t~ite40_Out-357177674| |ULTIMATE.start_main_#t~ite39_Out-357177674|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-357177674, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-357177674, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_In-357177674|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-357177674, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-357177674, ~weak$$choice2~0=~weak$$choice2~0_In-357177674} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-357177674, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-357177674|, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-357177674|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-357177674, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-357177674, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-357177674, ~weak$$choice2~0=~weak$$choice2~0_In-357177674} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-18 21:50:59,155 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L851-->L852: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_25 256))) (= v_~z$r_buff0_thd0~0_69 v_~z$r_buff0_thd0~0_70)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_70, ~weak$$choice2~0=v_~weak$$choice2~0_25} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_10|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_69, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_9|, ~weak$$choice2~0=v_~weak$$choice2~0_25, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_12|} 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-18 21:50:59,155 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L852-->L852-8: Formula: (let ((.cse2 (= |ULTIMATE.start_main_#t~ite46_Out-1128213231| |ULTIMATE.start_main_#t~ite45_Out-1128213231|)) (.cse3 (= (mod ~z$w_buff1_used~0_In-1128213231 256) 0)) (.cse5 (= 0 (mod ~z$w_buff0_used~0_In-1128213231 256))) (.cse6 (= 0 (mod ~z$r_buff0_thd0~0_In-1128213231 256))) (.cse0 (= (mod ~z$r_buff1_thd0~0_In-1128213231 256) 0)) (.cse4 (= 0 (mod ~weak$$choice2~0_In-1128213231 256)))) (or (let ((.cse1 (not .cse6))) (and (or (not .cse0) .cse1) .cse2 (or (not .cse3) .cse1) .cse4 (= |ULTIMATE.start_main_#t~ite45_Out-1128213231| |ULTIMATE.start_main_#t~ite44_Out-1128213231|) (= 0 |ULTIMATE.start_main_#t~ite44_Out-1128213231|) (not .cse5))) (and (or (and (= |ULTIMATE.start_main_#t~ite46_Out-1128213231| ~z$r_buff1_thd0~0_In-1128213231) (= |ULTIMATE.start_main_#t~ite45_Out-1128213231| |ULTIMATE.start_main_#t~ite45_In-1128213231|) (not .cse4)) (and (= |ULTIMATE.start_main_#t~ite45_Out-1128213231| ~z$r_buff1_thd0~0_In-1128213231) .cse2 (or (and .cse6 .cse3) .cse5 (and .cse6 .cse0)) .cse4)) (= |ULTIMATE.start_main_#t~ite44_In-1128213231| |ULTIMATE.start_main_#t~ite44_Out-1128213231|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1128213231, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1128213231, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1128213231, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1128213231, ~weak$$choice2~0=~weak$$choice2~0_In-1128213231, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_In-1128213231|, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_In-1128213231|} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1128213231, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1128213231, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1128213231, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1128213231, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-1128213231|, ~weak$$choice2~0=~weak$$choice2~0_In-1128213231, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1128213231|, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1128213231|} 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-18 21:50:59,156 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L854-->L4: Formula: (and (= 0 v_~z$flush_delayed~0_10) (= (mod v_~main$tmp_guard1~0_7 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|) (not (= (mod v_~z$flush_delayed~0_11 256) 0)) (= v_~z~0_22 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_11} 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_10|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~z$flush_delayed~0=v_~z$flush_delayed~0_10, ~z~0=v_~z~0_22, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} 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-18 21:50:59,156 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 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_10, 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-18 21:50:59,252 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 09:50:59 BasicIcfg [2019-12-18 21:50:59,253 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 21:50:59,254 INFO L168 Benchmark]: Toolchain (without parser) took 41449.72 ms. Allocated memory was 145.2 MB in the beginning and 1.9 GB in the end (delta: 1.8 GB). Free memory was 101.3 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 697.3 MB. Max. memory is 7.1 GB. [2019-12-18 21:50:59,260 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 145.2 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-18 21:50:59,261 INFO L168 Benchmark]: CACSL2BoogieTranslator took 815.78 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 100.9 MB in the beginning and 156.4 MB in the end (delta: -55.6 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. [2019-12-18 21:50:59,263 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.30 ms. Allocated memory is still 202.9 MB. Free memory was 156.4 MB in the beginning and 153.2 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2019-12-18 21:50:59,265 INFO L168 Benchmark]: Boogie Preprocessor took 44.76 ms. Allocated memory is still 202.9 MB. Free memory was 153.2 MB in the beginning and 150.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 21:50:59,266 INFO L168 Benchmark]: RCFGBuilder took 896.41 ms. Allocated memory is still 202.9 MB. Free memory was 150.5 MB in the beginning and 101.5 MB in the end (delta: 49.0 MB). Peak memory consumption was 49.0 MB. Max. memory is 7.1 GB. [2019-12-18 21:50:59,268 INFO L168 Benchmark]: TraceAbstraction took 39615.69 ms. Allocated memory was 202.9 MB in the beginning and 1.9 GB in the end (delta: 1.7 GB). Free memory was 100.9 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 639.2 MB. Max. memory is 7.1 GB. [2019-12-18 21:50:59,271 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.20 ms. Allocated memory is still 145.2 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 815.78 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 100.9 MB in the beginning and 156.4 MB in the end (delta: -55.6 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 72.30 ms. Allocated memory is still 202.9 MB. Free memory was 156.4 MB in the beginning and 153.2 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 44.76 ms. Allocated memory is still 202.9 MB. Free memory was 153.2 MB in the beginning and 150.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 896.41 ms. Allocated memory is still 202.9 MB. Free memory was 150.5 MB in the beginning and 101.5 MB in the end (delta: 49.0 MB). Peak memory consumption was 49.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 39615.69 ms. Allocated memory was 202.9 MB in the beginning and 1.9 GB in the end (delta: 1.7 GB). Free memory was 100.9 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 639.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.9s, 179 ProgramPointsBefore, 91 ProgramPointsAfterwards, 207 TransitionsBefore, 96 TransitionsAfterwards, 12668 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 28 ChoiceCompositions, 4854 VarBasedMoverChecksPositive, 171 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 51526 CheckedPairsTotal, 119 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L823] FCALL, FORK 0 pthread_create(&t1477, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0: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] [L825] FCALL, FORK 0 pthread_create(&t1478, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0: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] [L827] FCALL, FORK 0 pthread_create(&t1479, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0: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] [L829] FCALL, FORK 0 pthread_create(&t1480, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0: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] [L784] 4 z$w_buff1 = z$w_buff0 [L785] 4 z$w_buff0 = 2 [L786] 4 z$w_buff1_used = z$w_buff0_used [L787] 4 z$w_buff0_used = (_Bool)1 [L800] 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 [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0: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=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] [L764] 3 y = 1 [L767] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, 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] [L800] 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) [L770] 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=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, 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] [L801] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L802] 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 [L771] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L772] 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 [L773] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L831] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, 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] [L836] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L837] 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 [L838] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L839] 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 [L842] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L843] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L844] 0 z$flush_delayed = weak$$choice2 [L845] 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=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, 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] [L846] 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=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, 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] [L846] 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) [L847] 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=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, 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] [L847] 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)) [L848] 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)) [L849] 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=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, 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] [L849] 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)) [L850] 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)) [L852] 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)) [L853] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 0) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, 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, 167 locations, 2 error locations. Result: UNSAFE, OverallTime: 39.3s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 12.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2106 SDtfs, 2772 SDslu, 5108 SDs, 0 SdLazy, 2584 SolverSat, 226 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 182 GetRequests, 34 SyntacticMatches, 11 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 407 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56294occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 16.9s AutomataMinimizationTime, 18 MinimizatonAttempts, 40642 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 813 NumberOfCodeBlocks, 813 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 735 ConstructedInterpolants, 0 QuantifiedInterpolants, 151123 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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...