/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/safe017_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 22:41:07,581 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 22:41:07,583 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 22:41:07,601 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 22:41:07,602 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 22:41:07,604 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 22:41:07,606 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 22:41:07,618 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 22:41:07,620 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 22:41:07,621 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 22:41:07,624 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 22:41:07,625 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 22:41:07,625 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 22:41:07,626 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 22:41:07,630 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 22:41:07,632 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 22:41:07,634 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 22:41:07,638 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 22:41:07,639 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 22:41:07,645 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 22:41:07,648 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 22:41:07,649 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 22:41:07,651 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 22:41:07,652 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 22:41:07,655 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 22:41:07,655 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 22:41:07,656 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 22:41:07,657 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 22:41:07,659 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 22:41:07,660 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 22:41:07,660 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 22:41:07,662 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 22:41:07,663 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 22:41:07,663 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 22:41:07,665 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 22:41:07,666 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 22:41:07,666 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 22:41:07,666 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 22:41:07,667 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 22:41:07,670 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 22:41:07,671 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 22:41:07,671 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 22:41:07,685 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 22:41:07,685 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 22:41:07,686 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 22:41:07,687 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 22:41:07,687 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 22:41:07,687 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 22:41:07,687 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 22:41:07,688 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 22:41:07,688 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 22:41:07,688 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 22:41:07,688 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 22:41:07,688 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 22:41:07,689 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 22:41:07,689 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 22:41:07,689 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 22:41:07,689 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 22:41:07,689 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 22:41:07,690 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 22:41:07,690 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 22:41:07,690 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 22:41:07,690 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 22:41:07,690 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 22:41:07,691 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 22:41:07,691 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 22:41:07,691 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 22:41:07,691 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 22:41:07,691 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 22:41:07,692 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 22:41:07,692 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 22:41:07,692 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 22:41:07,967 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 22:41:07,981 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 22:41:07,984 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 22:41:07,986 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 22:41:07,986 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 22:41:07,987 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe017_rmo.oepc.i [2019-12-18 22:41:08,065 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2339bf76d/0fd7eba1642c4db79dfb04a1885f0e59/FLAGd5e81c4ae [2019-12-18 22:41:08,644 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 22:41:08,645 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe017_rmo.oepc.i [2019-12-18 22:41:08,665 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2339bf76d/0fd7eba1642c4db79dfb04a1885f0e59/FLAGd5e81c4ae [2019-12-18 22:41:08,833 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2339bf76d/0fd7eba1642c4db79dfb04a1885f0e59 [2019-12-18 22:41:08,843 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 22:41:08,845 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 22:41:08,846 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 22:41:08,847 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 22:41:08,850 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 22:41:08,851 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 10:41:08" (1/1) ... [2019-12-18 22:41:08,854 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4af28205 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:41:08, skipping insertion in model container [2019-12-18 22:41:08,854 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 10:41:08" (1/1) ... [2019-12-18 22:41:08,862 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 22:41:08,913 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 22:41:09,416 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 22:41:09,431 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 22:41:09,541 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 22:41:09,618 INFO L208 MainTranslator]: Completed translation [2019-12-18 22:41:09,618 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:41:09 WrapperNode [2019-12-18 22:41:09,619 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 22:41:09,619 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 22:41:09,619 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 22:41:09,620 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 22:41:09,629 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:41:09" (1/1) ... [2019-12-18 22:41:09,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 10:41:09" (1/1) ... [2019-12-18 22:41:09,689 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 22:41:09,690 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 22:41:09,690 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 22:41:09,690 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 22:41:09,698 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:41:09" (1/1) ... [2019-12-18 22:41:09,698 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:41:09" (1/1) ... [2019-12-18 22:41:09,704 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:41:09" (1/1) ... [2019-12-18 22:41:09,704 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:41:09" (1/1) ... [2019-12-18 22:41:09,714 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:41:09" (1/1) ... [2019-12-18 22:41:09,719 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:41:09" (1/1) ... [2019-12-18 22:41:09,723 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:41:09" (1/1) ... [2019-12-18 22:41:09,728 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 22:41:09,729 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 22:41:09,729 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 22:41:09,729 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 22:41:09,730 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:41:09" (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 22:41:09,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 22:41:09,806 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 22:41:09,806 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 22:41:09,806 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 22:41:09,806 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 22:41:09,807 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 22:41:09,807 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 22:41:09,807 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 22:41:09,807 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 22:41:09,807 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 22:41:09,807 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 22:41:09,808 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 22:41:09,808 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 22:41:09,809 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 22:41:10,518 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 22:41:10,518 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 22:41:10,520 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 10:41:10 BoogieIcfgContainer [2019-12-18 22:41:10,520 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 22:41:10,521 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 22:41:10,521 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 22:41:10,525 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 22:41:10,525 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 10:41:08" (1/3) ... [2019-12-18 22:41:10,526 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f39ac32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 10:41:10, skipping insertion in model container [2019-12-18 22:41:10,526 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:41:09" (2/3) ... [2019-12-18 22:41:10,527 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f39ac32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 10:41:10, skipping insertion in model container [2019-12-18 22:41:10,527 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 10:41:10" (3/3) ... [2019-12-18 22:41:10,529 INFO L109 eAbstractionObserver]: Analyzing ICFG safe017_rmo.oepc.i [2019-12-18 22:41:10,540 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 22:41:10,541 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 22:41:10,549 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 22:41:10,551 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 22:41:10,595 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:41:10,595 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:41:10,595 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:41:10,596 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:41:10,596 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:41:10,596 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:41:10,597 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:41:10,597 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:41:10,597 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:41:10,598 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:41:10,598 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:41:10,598 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:41:10,598 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:41:10,599 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:41:10,599 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:41:10,600 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:41:10,600 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:41:10,601 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:41:10,601 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:41:10,601 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:41:10,602 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:41:10,602 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:41:10,602 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:41:10,603 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:41:10,603 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:41:10,603 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:41:10,604 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:41:10,604 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:41:10,604 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:41:10,605 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:41:10,605 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:41:10,605 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:41:10,605 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:41:10,606 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:41:10,608 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:41:10,608 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:41:10,609 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:41:10,609 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:41:10,610 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:41:10,611 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:41:10,612 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:41:10,612 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:41:10,612 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:41:10,613 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:41:10,613 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:41:10,613 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:41:10,613 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:41:10,614 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:41:10,614 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:41:10,614 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:41:10,614 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:41:10,615 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:41:10,615 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:41:10,615 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:41:10,615 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:41:10,616 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:41:10,633 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:41:10,634 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:41:10,634 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:41:10,635 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:41:10,635 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:41:10,635 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:41:10,635 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:41:10,635 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:41:10,637 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:41:10,637 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:41:10,637 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:41:10,638 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:41:10,638 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:41:10,639 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:41:10,639 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:41:10,639 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:41:10,640 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:41:10,640 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:41:10,640 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:41:10,641 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:41:10,641 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:41:10,641 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:41:10,641 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:41:10,642 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:41:10,642 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:41:10,643 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:41:10,643 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:41:10,643 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:41:10,643 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:41:10,644 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:41:10,644 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:41:10,644 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:41:10,644 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:41:10,645 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:41:10,645 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:41:10,645 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:41:10,645 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:41:10,645 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:41:10,650 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:41:10,651 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:41:10,652 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:41:10,652 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:41:10,652 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:41:10,652 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:41:10,652 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:41:10,653 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:41:10,656 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:41:10,656 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:41:10,656 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:41:10,657 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:41:10,669 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:41:10,670 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:41:10,670 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:41:10,670 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:41:10,671 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:41:10,671 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:41:10,671 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:41:10,671 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:41:10,672 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:41:10,672 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:41:10,674 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:41:10,674 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:41:10,675 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:41:10,675 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:41:10,675 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:41:10,675 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:41:10,675 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:41:10,676 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:41:10,676 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:41:10,676 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:41:10,692 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 22:41:10,716 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 22:41:10,716 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 22:41:10,716 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 22:41:10,716 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 22:41:10,716 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 22:41:10,716 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 22:41:10,717 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 22:41:10,717 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 22:41:10,740 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 173 places, 210 transitions [2019-12-18 22:41:10,742 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 173 places, 210 transitions [2019-12-18 22:41:10,848 INFO L126 PetriNetUnfolder]: 47/207 cut-off events. [2019-12-18 22:41:10,848 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 22:41:10,866 INFO L76 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 207 events. 47/207 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 331 event pairs. 9/167 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 22:41:10,894 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 173 places, 210 transitions [2019-12-18 22:41:10,939 INFO L126 PetriNetUnfolder]: 47/207 cut-off events. [2019-12-18 22:41:10,939 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 22:41:10,947 INFO L76 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 207 events. 47/207 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 331 event pairs. 9/167 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 22:41:10,967 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 17114 [2019-12-18 22:41:10,968 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 22:41:14,504 WARN L192 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-18 22:41:14,617 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-18 22:41:14,650 INFO L206 etLargeBlockEncoding]: Checked pairs total: 81965 [2019-12-18 22:41:14,650 INFO L214 etLargeBlockEncoding]: Total number of compositions: 110 [2019-12-18 22:41:14,654 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 96 places, 107 transitions [2019-12-18 22:41:32,825 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 123932 states. [2019-12-18 22:41:32,827 INFO L276 IsEmpty]: Start isEmpty. Operand 123932 states. [2019-12-18 22:41:32,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 22:41:32,833 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:41:32,834 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 22:41:32,835 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:41:32,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:41:32,841 INFO L82 PathProgramCache]: Analyzing trace with hash 840548, now seen corresponding path program 1 times [2019-12-18 22:41:32,851 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:41:32,851 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392237186] [2019-12-18 22:41:32,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:41:32,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:41:33,041 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 22:41:33,042 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392237186] [2019-12-18 22:41:33,043 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:41:33,043 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 22:41:33,044 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200680708] [2019-12-18 22:41:33,049 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:41:33,049 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:41:33,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:41:33,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:41:33,069 INFO L87 Difference]: Start difference. First operand 123932 states. Second operand 3 states. [2019-12-18 22:41:35,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:41:35,853 INFO L93 Difference]: Finished difference Result 123232 states and 527355 transitions. [2019-12-18 22:41:35,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:41:35,854 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 22:41:35,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:41:36,717 INFO L225 Difference]: With dead ends: 123232 [2019-12-18 22:41:36,718 INFO L226 Difference]: Without dead ends: 120684 [2019-12-18 22:41:36,719 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 22:41:43,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120684 states. [2019-12-18 22:41:46,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120684 to 120684. [2019-12-18 22:41:46,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120684 states. [2019-12-18 22:41:47,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120684 states to 120684 states and 516967 transitions. [2019-12-18 22:41:47,207 INFO L78 Accepts]: Start accepts. Automaton has 120684 states and 516967 transitions. Word has length 3 [2019-12-18 22:41:47,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:41:47,208 INFO L462 AbstractCegarLoop]: Abstraction has 120684 states and 516967 transitions. [2019-12-18 22:41:47,208 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:41:47,208 INFO L276 IsEmpty]: Start isEmpty. Operand 120684 states and 516967 transitions. [2019-12-18 22:41:47,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 22:41:47,212 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:41:47,212 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:41:47,213 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:41:47,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:41:47,213 INFO L82 PathProgramCache]: Analyzing trace with hash -693264508, now seen corresponding path program 1 times [2019-12-18 22:41:47,214 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:41:47,214 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207449951] [2019-12-18 22:41:47,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:41:47,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:41:47,338 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 22:41:47,338 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207449951] [2019-12-18 22:41:47,339 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:41:47,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:41:47,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332983220] [2019-12-18 22:41:47,341 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:41:47,341 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:41:47,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:41:47,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:41:47,342 INFO L87 Difference]: Start difference. First operand 120684 states and 516967 transitions. Second operand 4 states. [2019-12-18 22:41:52,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:41:52,881 INFO L93 Difference]: Finished difference Result 188314 states and 770960 transitions. [2019-12-18 22:41:52,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 22:41:52,882 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 22:41:52,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:41:54,180 INFO L225 Difference]: With dead ends: 188314 [2019-12-18 22:41:54,180 INFO L226 Difference]: Without dead ends: 188265 [2019-12-18 22:41:54,181 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 22:42:03,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188265 states. [2019-12-18 22:42:07,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188265 to 173329. [2019-12-18 22:42:07,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173329 states. [2019-12-18 22:42:07,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173329 states to 173329 states and 717928 transitions. [2019-12-18 22:42:07,855 INFO L78 Accepts]: Start accepts. Automaton has 173329 states and 717928 transitions. Word has length 11 [2019-12-18 22:42:07,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:42:07,855 INFO L462 AbstractCegarLoop]: Abstraction has 173329 states and 717928 transitions. [2019-12-18 22:42:07,855 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:42:07,855 INFO L276 IsEmpty]: Start isEmpty. Operand 173329 states and 717928 transitions. [2019-12-18 22:42:07,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 22:42:07,862 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:42:07,862 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:42:07,863 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:42:07,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:42:07,863 INFO L82 PathProgramCache]: Analyzing trace with hash -1884384651, now seen corresponding path program 1 times [2019-12-18 22:42:07,863 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:42:07,864 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444369099] [2019-12-18 22:42:07,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:42:07,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:42:07,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 22:42:07,944 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444369099] [2019-12-18 22:42:07,944 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:42:07,944 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:42:07,944 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832016496] [2019-12-18 22:42:07,944 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:42:07,945 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:42:07,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:42:07,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:42:07,945 INFO L87 Difference]: Start difference. First operand 173329 states and 717928 transitions. Second operand 3 states. [2019-12-18 22:42:13,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:42:13,007 INFO L93 Difference]: Finished difference Result 34664 states and 112616 transitions. [2019-12-18 22:42:13,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:42:13,007 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 22:42:13,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:42:13,100 INFO L225 Difference]: With dead ends: 34664 [2019-12-18 22:42:13,101 INFO L226 Difference]: Without dead ends: 34664 [2019-12-18 22:42:13,101 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:42:13,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34664 states. [2019-12-18 22:42:13,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34664 to 34664. [2019-12-18 22:42:13,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34664 states. [2019-12-18 22:42:13,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34664 states to 34664 states and 112616 transitions. [2019-12-18 22:42:13,733 INFO L78 Accepts]: Start accepts. Automaton has 34664 states and 112616 transitions. Word has length 13 [2019-12-18 22:42:13,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:42:13,734 INFO L462 AbstractCegarLoop]: Abstraction has 34664 states and 112616 transitions. [2019-12-18 22:42:13,734 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:42:13,734 INFO L276 IsEmpty]: Start isEmpty. Operand 34664 states and 112616 transitions. [2019-12-18 22:42:13,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 22:42:13,735 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:42:13,735 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:42:13,735 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:42:13,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:42:13,736 INFO L82 PathProgramCache]: Analyzing trace with hash -2074529167, now seen corresponding path program 1 times [2019-12-18 22:42:13,736 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:42:13,736 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557796295] [2019-12-18 22:42:13,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:42:13,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:42:13,809 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 22:42:13,810 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557796295] [2019-12-18 22:42:13,810 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:42:13,810 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:42:13,811 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129442362] [2019-12-18 22:42:13,814 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:42:13,814 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:42:13,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:42:13,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:42:13,815 INFO L87 Difference]: Start difference. First operand 34664 states and 112616 transitions. Second operand 4 states. [2019-12-18 22:42:14,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:42:14,271 INFO L93 Difference]: Finished difference Result 46077 states and 146183 transitions. [2019-12-18 22:42:14,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 22:42:14,271 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 22:42:14,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:42:14,363 INFO L225 Difference]: With dead ends: 46077 [2019-12-18 22:42:14,363 INFO L226 Difference]: Without dead ends: 46070 [2019-12-18 22:42:14,364 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 22:42:14,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46070 states. [2019-12-18 22:42:15,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46070 to 40619. [2019-12-18 22:42:15,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40619 states. [2019-12-18 22:42:15,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40619 states to 40619 states and 130997 transitions. [2019-12-18 22:42:15,418 INFO L78 Accepts]: Start accepts. Automaton has 40619 states and 130997 transitions. Word has length 13 [2019-12-18 22:42:15,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:42:15,418 INFO L462 AbstractCegarLoop]: Abstraction has 40619 states and 130997 transitions. [2019-12-18 22:42:15,418 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:42:15,418 INFO L276 IsEmpty]: Start isEmpty. Operand 40619 states and 130997 transitions. [2019-12-18 22:42:15,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 22:42:15,422 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:42:15,422 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:42:15,422 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:42:15,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:42:15,422 INFO L82 PathProgramCache]: Analyzing trace with hash 1372726712, now seen corresponding path program 1 times [2019-12-18 22:42:15,422 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:42:15,423 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103373030] [2019-12-18 22:42:15,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:42:15,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:42:15,504 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 22:42:15,504 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103373030] [2019-12-18 22:42:15,504 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:42:15,504 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:42:15,505 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540099579] [2019-12-18 22:42:15,505 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:42:15,506 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:42:15,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:42:15,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:42:15,506 INFO L87 Difference]: Start difference. First operand 40619 states and 130997 transitions. Second operand 5 states. [2019-12-18 22:42:16,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:42:16,272 INFO L93 Difference]: Finished difference Result 54297 states and 171188 transitions. [2019-12-18 22:42:16,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 22:42:16,275 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-18 22:42:16,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:42:16,364 INFO L225 Difference]: With dead ends: 54297 [2019-12-18 22:42:16,364 INFO L226 Difference]: Without dead ends: 54284 [2019-12-18 22:42:16,365 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 22:42:16,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54284 states. [2019-12-18 22:42:17,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54284 to 40933. [2019-12-18 22:42:17,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40933 states. [2019-12-18 22:42:17,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40933 states to 40933 states and 131862 transitions. [2019-12-18 22:42:17,445 INFO L78 Accepts]: Start accepts. Automaton has 40933 states and 131862 transitions. Word has length 19 [2019-12-18 22:42:17,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:42:17,445 INFO L462 AbstractCegarLoop]: Abstraction has 40933 states and 131862 transitions. [2019-12-18 22:42:17,445 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:42:17,445 INFO L276 IsEmpty]: Start isEmpty. Operand 40933 states and 131862 transitions. [2019-12-18 22:42:17,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 22:42:17,458 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:42:17,459 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:42:17,459 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:42:17,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:42:17,459 INFO L82 PathProgramCache]: Analyzing trace with hash -1682135623, now seen corresponding path program 1 times [2019-12-18 22:42:17,460 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:42:17,460 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218200925] [2019-12-18 22:42:17,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:42:17,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:42:17,515 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 22:42:17,516 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218200925] [2019-12-18 22:42:17,516 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:42:17,516 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:42:17,516 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74917097] [2019-12-18 22:42:17,517 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:42:17,517 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:42:17,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:42:17,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:42:17,517 INFO L87 Difference]: Start difference. First operand 40933 states and 131862 transitions. Second operand 4 states. [2019-12-18 22:42:17,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:42:17,566 INFO L93 Difference]: Finished difference Result 7502 states and 20469 transitions. [2019-12-18 22:42:17,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 22:42:17,567 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 22:42:17,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:42:17,579 INFO L225 Difference]: With dead ends: 7502 [2019-12-18 22:42:17,579 INFO L226 Difference]: Without dead ends: 7502 [2019-12-18 22:42:17,579 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:42:17,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7502 states. [2019-12-18 22:42:17,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7502 to 7390. [2019-12-18 22:42:17,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7390 states. [2019-12-18 22:42:17,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7390 states to 7390 states and 20149 transitions. [2019-12-18 22:42:17,684 INFO L78 Accepts]: Start accepts. Automaton has 7390 states and 20149 transitions. Word has length 25 [2019-12-18 22:42:17,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:42:17,684 INFO L462 AbstractCegarLoop]: Abstraction has 7390 states and 20149 transitions. [2019-12-18 22:42:17,684 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:42:17,685 INFO L276 IsEmpty]: Start isEmpty. Operand 7390 states and 20149 transitions. [2019-12-18 22:42:17,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-18 22:42:17,697 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:42:17,697 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] [2019-12-18 22:42:17,697 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:42:17,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:42:17,698 INFO L82 PathProgramCache]: Analyzing trace with hash -2147477439, now seen corresponding path program 1 times [2019-12-18 22:42:17,698 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:42:17,698 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246521378] [2019-12-18 22:42:17,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:42:17,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:42:17,779 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 22:42:17,779 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246521378] [2019-12-18 22:42:17,780 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:42:17,780 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 22:42:17,780 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957251101] [2019-12-18 22:42:17,780 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:42:17,781 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:42:17,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:42:17,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:42:17,781 INFO L87 Difference]: Start difference. First operand 7390 states and 20149 transitions. Second operand 5 states. [2019-12-18 22:42:17,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:42:17,829 INFO L93 Difference]: Finished difference Result 5312 states and 15267 transitions. [2019-12-18 22:42:17,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 22:42:17,830 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-18 22:42:17,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:42:17,838 INFO L225 Difference]: With dead ends: 5312 [2019-12-18 22:42:17,839 INFO L226 Difference]: Without dead ends: 5312 [2019-12-18 22:42:17,839 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:42:17,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5312 states. [2019-12-18 22:42:17,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5312 to 4948. [2019-12-18 22:42:17,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4948 states. [2019-12-18 22:42:17,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4948 states to 4948 states and 14283 transitions. [2019-12-18 22:42:17,944 INFO L78 Accepts]: Start accepts. Automaton has 4948 states and 14283 transitions. Word has length 37 [2019-12-18 22:42:17,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:42:17,945 INFO L462 AbstractCegarLoop]: Abstraction has 4948 states and 14283 transitions. [2019-12-18 22:42:17,945 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:42:17,945 INFO L276 IsEmpty]: Start isEmpty. Operand 4948 states and 14283 transitions. [2019-12-18 22:42:17,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 22:42:17,956 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:42:17,956 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, 1, 1, 1, 1, 1] [2019-12-18 22:42:17,956 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:42:17,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:42:17,957 INFO L82 PathProgramCache]: Analyzing trace with hash -314622142, now seen corresponding path program 1 times [2019-12-18 22:42:17,957 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:42:17,957 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523618306] [2019-12-18 22:42:17,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:42:17,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:42:18,059 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 22:42:18,059 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523618306] [2019-12-18 22:42:18,059 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:42:18,060 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:42:18,060 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794518420] [2019-12-18 22:42:18,060 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:42:18,061 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:42:18,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:42:18,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:42:18,062 INFO L87 Difference]: Start difference. First operand 4948 states and 14283 transitions. Second operand 3 states. [2019-12-18 22:42:18,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:42:18,118 INFO L93 Difference]: Finished difference Result 4959 states and 14299 transitions. [2019-12-18 22:42:18,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:42:18,119 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 22:42:18,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:42:18,126 INFO L225 Difference]: With dead ends: 4959 [2019-12-18 22:42:18,126 INFO L226 Difference]: Without dead ends: 4959 [2019-12-18 22:42:18,126 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:42:18,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4959 states. [2019-12-18 22:42:18,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4959 to 4955. [2019-12-18 22:42:18,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4955 states. [2019-12-18 22:42:18,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4955 states to 4955 states and 14295 transitions. [2019-12-18 22:42:18,190 INFO L78 Accepts]: Start accepts. Automaton has 4955 states and 14295 transitions. Word has length 65 [2019-12-18 22:42:18,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:42:18,191 INFO L462 AbstractCegarLoop]: Abstraction has 4955 states and 14295 transitions. [2019-12-18 22:42:18,192 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:42:18,192 INFO L276 IsEmpty]: Start isEmpty. Operand 4955 states and 14295 transitions. [2019-12-18 22:42:18,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 22:42:18,199 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:42:18,199 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, 1, 1, 1, 1, 1] [2019-12-18 22:42:18,199 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:42:18,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:42:18,200 INFO L82 PathProgramCache]: Analyzing trace with hash 143495123, now seen corresponding path program 1 times [2019-12-18 22:42:18,200 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:42:18,200 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619413268] [2019-12-18 22:42:18,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:42:18,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:42:18,309 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 22:42:18,310 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619413268] [2019-12-18 22:42:18,310 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:42:18,310 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 22:42:18,311 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173481743] [2019-12-18 22:42:18,311 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:42:18,311 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:42:18,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:42:18,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:42:18,312 INFO L87 Difference]: Start difference. First operand 4955 states and 14295 transitions. Second operand 5 states. [2019-12-18 22:42:18,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:42:18,635 INFO L93 Difference]: Finished difference Result 7546 states and 21560 transitions. [2019-12-18 22:42:18,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 22:42:18,636 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-18 22:42:18,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:42:18,647 INFO L225 Difference]: With dead ends: 7546 [2019-12-18 22:42:18,647 INFO L226 Difference]: Without dead ends: 7546 [2019-12-18 22:42:18,647 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 22:42:18,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7546 states. [2019-12-18 22:42:18,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7546 to 6352. [2019-12-18 22:42:18,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6352 states. [2019-12-18 22:42:18,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6352 states to 6352 states and 18330 transitions. [2019-12-18 22:42:18,746 INFO L78 Accepts]: Start accepts. Automaton has 6352 states and 18330 transitions. Word has length 65 [2019-12-18 22:42:18,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:42:18,746 INFO L462 AbstractCegarLoop]: Abstraction has 6352 states and 18330 transitions. [2019-12-18 22:42:18,747 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:42:18,747 INFO L276 IsEmpty]: Start isEmpty. Operand 6352 states and 18330 transitions. [2019-12-18 22:42:18,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 22:42:18,755 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:42:18,756 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, 1, 1, 1, 1, 1] [2019-12-18 22:42:18,756 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:42:18,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:42:18,756 INFO L82 PathProgramCache]: Analyzing trace with hash 1279878861, now seen corresponding path program 2 times [2019-12-18 22:42:18,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:42:18,757 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152350875] [2019-12-18 22:42:18,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:42:18,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:42:18,963 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 22:42:18,964 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152350875] [2019-12-18 22:42:18,964 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:42:18,964 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 22:42:18,965 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576639531] [2019-12-18 22:42:18,965 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 22:42:18,965 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:42:18,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 22:42:18,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 22:42:18,966 INFO L87 Difference]: Start difference. First operand 6352 states and 18330 transitions. Second operand 6 states. [2019-12-18 22:42:19,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:42:19,459 INFO L93 Difference]: Finished difference Result 10887 states and 31211 transitions. [2019-12-18 22:42:19,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 22:42:19,460 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-18 22:42:19,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:42:19,475 INFO L225 Difference]: With dead ends: 10887 [2019-12-18 22:42:19,475 INFO L226 Difference]: Without dead ends: 10887 [2019-12-18 22:42:19,475 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-18 22:42:19,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10887 states. [2019-12-18 22:42:19,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10887 to 7014. [2019-12-18 22:42:19,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7014 states. [2019-12-18 22:42:19,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7014 states to 7014 states and 20308 transitions. [2019-12-18 22:42:19,602 INFO L78 Accepts]: Start accepts. Automaton has 7014 states and 20308 transitions. Word has length 65 [2019-12-18 22:42:19,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:42:19,602 INFO L462 AbstractCegarLoop]: Abstraction has 7014 states and 20308 transitions. [2019-12-18 22:42:19,602 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 22:42:19,602 INFO L276 IsEmpty]: Start isEmpty. Operand 7014 states and 20308 transitions. [2019-12-18 22:42:19,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 22:42:19,612 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:42:19,612 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, 1, 1, 1, 1, 1] [2019-12-18 22:42:19,612 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:42:19,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:42:19,612 INFO L82 PathProgramCache]: Analyzing trace with hash -817749225, now seen corresponding path program 3 times [2019-12-18 22:42:19,613 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:42:19,613 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576834840] [2019-12-18 22:42:19,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:42:19,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:42:19,747 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 22:42:19,748 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576834840] [2019-12-18 22:42:19,748 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:42:19,748 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 22:42:19,748 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105407316] [2019-12-18 22:42:19,749 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 22:42:19,749 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:42:19,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 22:42:19,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:42:19,750 INFO L87 Difference]: Start difference. First operand 7014 states and 20308 transitions. Second operand 7 states. [2019-12-18 22:42:20,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:42:20,585 INFO L93 Difference]: Finished difference Result 10694 states and 30653 transitions. [2019-12-18 22:42:20,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 22:42:20,586 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-18 22:42:20,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:42:20,602 INFO L225 Difference]: With dead ends: 10694 [2019-12-18 22:42:20,602 INFO L226 Difference]: Without dead ends: 10694 [2019-12-18 22:42:20,602 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2019-12-18 22:42:20,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10694 states. [2019-12-18 22:42:20,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10694 to 6618. [2019-12-18 22:42:20,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6618 states. [2019-12-18 22:42:20,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6618 states to 6618 states and 19145 transitions. [2019-12-18 22:42:20,718 INFO L78 Accepts]: Start accepts. Automaton has 6618 states and 19145 transitions. Word has length 65 [2019-12-18 22:42:20,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:42:20,718 INFO L462 AbstractCegarLoop]: Abstraction has 6618 states and 19145 transitions. [2019-12-18 22:42:20,718 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 22:42:20,719 INFO L276 IsEmpty]: Start isEmpty. Operand 6618 states and 19145 transitions. [2019-12-18 22:42:20,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 22:42:20,728 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:42:20,728 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:42:20,728 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:42:20,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:42:20,729 INFO L82 PathProgramCache]: Analyzing trace with hash 976501587, now seen corresponding path program 4 times [2019-12-18 22:42:20,729 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:42:20,729 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129382324] [2019-12-18 22:42:20,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:42:20,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:42:20,853 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 22:42:20,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129382324] [2019-12-18 22:42:20,854 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:42:20,854 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 22:42:20,854 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545551291] [2019-12-18 22:42:20,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 22:42:20,855 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:42:20,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 22:42:20,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:42:20,855 INFO L87 Difference]: Start difference. First operand 6618 states and 19145 transitions. Second operand 7 states. [2019-12-18 22:42:21,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:42:21,531 INFO L93 Difference]: Finished difference Result 9282 states and 26363 transitions. [2019-12-18 22:42:21,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 22:42:21,532 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-18 22:42:21,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:42:21,544 INFO L225 Difference]: With dead ends: 9282 [2019-12-18 22:42:21,544 INFO L226 Difference]: Without dead ends: 9282 [2019-12-18 22:42:21,545 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-12-18 22:42:21,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9282 states. [2019-12-18 22:42:21,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9282 to 6875. [2019-12-18 22:42:21,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6875 states. [2019-12-18 22:42:21,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6875 states to 6875 states and 19889 transitions. [2019-12-18 22:42:21,649 INFO L78 Accepts]: Start accepts. Automaton has 6875 states and 19889 transitions. Word has length 65 [2019-12-18 22:42:21,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:42:21,649 INFO L462 AbstractCegarLoop]: Abstraction has 6875 states and 19889 transitions. [2019-12-18 22:42:21,650 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 22:42:21,650 INFO L276 IsEmpty]: Start isEmpty. Operand 6875 states and 19889 transitions. [2019-12-18 22:42:21,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 22:42:21,659 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:42:21,659 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, 1, 1, 1, 1, 1] [2019-12-18 22:42:21,659 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:42:21,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:42:21,659 INFO L82 PathProgramCache]: Analyzing trace with hash -514720539, now seen corresponding path program 5 times [2019-12-18 22:42:21,660 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:42:21,660 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534160588] [2019-12-18 22:42:21,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:42:21,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:42:21,772 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 22:42:21,773 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534160588] [2019-12-18 22:42:21,773 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:42:21,773 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 22:42:21,773 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807908728] [2019-12-18 22:42:21,774 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 22:42:21,774 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:42:21,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 22:42:21,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 22:42:21,775 INFO L87 Difference]: Start difference. First operand 6875 states and 19889 transitions. Second operand 6 states. [2019-12-18 22:42:22,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:42:22,338 INFO L93 Difference]: Finished difference Result 11086 states and 31830 transitions. [2019-12-18 22:42:22,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 22:42:22,338 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-18 22:42:22,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:42:22,356 INFO L225 Difference]: With dead ends: 11086 [2019-12-18 22:42:22,357 INFO L226 Difference]: Without dead ends: 11086 [2019-12-18 22:42:22,357 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-18 22:42:22,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11086 states. [2019-12-18 22:42:22,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11086 to 7343. [2019-12-18 22:42:22,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7343 states. [2019-12-18 22:42:22,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7343 states to 7343 states and 21315 transitions. [2019-12-18 22:42:22,497 INFO L78 Accepts]: Start accepts. Automaton has 7343 states and 21315 transitions. Word has length 65 [2019-12-18 22:42:22,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:42:22,497 INFO L462 AbstractCegarLoop]: Abstraction has 7343 states and 21315 transitions. [2019-12-18 22:42:22,497 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 22:42:22,497 INFO L276 IsEmpty]: Start isEmpty. Operand 7343 states and 21315 transitions. [2019-12-18 22:42:22,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 22:42:22,507 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:42:22,507 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, 1, 1, 1, 1, 1] [2019-12-18 22:42:22,507 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:42:22,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:42:22,508 INFO L82 PathProgramCache]: Analyzing trace with hash -508911177, now seen corresponding path program 6 times [2019-12-18 22:42:22,508 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:42:22,508 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692737938] [2019-12-18 22:42:22,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:42:22,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:42:22,568 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 22:42:22,569 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692737938] [2019-12-18 22:42:22,569 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:42:22,569 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:42:22,569 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788986378] [2019-12-18 22:42:22,570 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:42:22,570 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:42:22,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:42:22,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:42:22,570 INFO L87 Difference]: Start difference. First operand 7343 states and 21315 transitions. Second operand 3 states. [2019-12-18 22:42:22,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:42:22,720 INFO L93 Difference]: Finished difference Result 7343 states and 21314 transitions. [2019-12-18 22:42:22,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:42:22,720 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 22:42:22,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:42:22,732 INFO L225 Difference]: With dead ends: 7343 [2019-12-18 22:42:22,732 INFO L226 Difference]: Without dead ends: 7343 [2019-12-18 22:42:22,732 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 22:42:22,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7343 states. [2019-12-18 22:42:22,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7343 to 4790. [2019-12-18 22:42:22,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4790 states. [2019-12-18 22:42:22,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4790 states to 4790 states and 14187 transitions. [2019-12-18 22:42:22,861 INFO L78 Accepts]: Start accepts. Automaton has 4790 states and 14187 transitions. Word has length 65 [2019-12-18 22:42:22,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:42:22,862 INFO L462 AbstractCegarLoop]: Abstraction has 4790 states and 14187 transitions. [2019-12-18 22:42:22,862 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:42:22,862 INFO L276 IsEmpty]: Start isEmpty. Operand 4790 states and 14187 transitions. [2019-12-18 22:42:22,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 22:42:22,874 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:42:22,874 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, 1, 1, 1, 1, 1, 1] [2019-12-18 22:42:22,875 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:42:22,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:42:22,875 INFO L82 PathProgramCache]: Analyzing trace with hash -1536074806, now seen corresponding path program 1 times [2019-12-18 22:42:22,875 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:42:22,875 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031979654] [2019-12-18 22:42:22,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:42:22,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:42:23,021 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 22:42:23,022 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031979654] [2019-12-18 22:42:23,022 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:42:23,022 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:42:23,023 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655840265] [2019-12-18 22:42:23,023 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:42:23,023 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:42:23,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:42:23,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:42:23,024 INFO L87 Difference]: Start difference. First operand 4790 states and 14187 transitions. Second operand 3 states. [2019-12-18 22:42:23,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:42:23,060 INFO L93 Difference]: Finished difference Result 4352 states and 12594 transitions. [2019-12-18 22:42:23,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:42:23,061 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 22:42:23,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:42:23,068 INFO L225 Difference]: With dead ends: 4352 [2019-12-18 22:42:23,069 INFO L226 Difference]: Without dead ends: 4352 [2019-12-18 22:42:23,071 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 22:42:23,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4352 states. [2019-12-18 22:42:23,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4352 to 3628. [2019-12-18 22:42:23,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3628 states. [2019-12-18 22:42:23,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3628 states to 3628 states and 10542 transitions. [2019-12-18 22:42:23,158 INFO L78 Accepts]: Start accepts. Automaton has 3628 states and 10542 transitions. Word has length 66 [2019-12-18 22:42:23,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:42:23,159 INFO L462 AbstractCegarLoop]: Abstraction has 3628 states and 10542 transitions. [2019-12-18 22:42:23,159 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:42:23,159 INFO L276 IsEmpty]: Start isEmpty. Operand 3628 states and 10542 transitions. [2019-12-18 22:42:23,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 22:42:23,169 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:42:23,169 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, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:42:23,169 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:42:23,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:42:23,170 INFO L82 PathProgramCache]: Analyzing trace with hash -197832194, now seen corresponding path program 1 times [2019-12-18 22:42:23,170 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:42:23,170 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692731746] [2019-12-18 22:42:23,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:42:23,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:42:23,242 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 22:42:23,243 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692731746] [2019-12-18 22:42:23,243 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:42:23,243 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:42:23,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59582239] [2019-12-18 22:42:23,244 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:42:23,244 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:42:23,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:42:23,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:42:23,244 INFO L87 Difference]: Start difference. First operand 3628 states and 10542 transitions. Second operand 3 states. [2019-12-18 22:42:23,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:42:23,271 INFO L93 Difference]: Finished difference Result 3386 states and 9570 transitions. [2019-12-18 22:42:23,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:42:23,271 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-18 22:42:23,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:42:23,277 INFO L225 Difference]: With dead ends: 3386 [2019-12-18 22:42:23,278 INFO L226 Difference]: Without dead ends: 3386 [2019-12-18 22:42:23,278 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 22:42:23,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3386 states. [2019-12-18 22:42:23,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3386 to 2990. [2019-12-18 22:42:23,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2990 states. [2019-12-18 22:42:23,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2990 states to 2990 states and 8464 transitions. [2019-12-18 22:42:23,345 INFO L78 Accepts]: Start accepts. Automaton has 2990 states and 8464 transitions. Word has length 67 [2019-12-18 22:42:23,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:42:23,346 INFO L462 AbstractCegarLoop]: Abstraction has 2990 states and 8464 transitions. [2019-12-18 22:42:23,346 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:42:23,346 INFO L276 IsEmpty]: Start isEmpty. Operand 2990 states and 8464 transitions. [2019-12-18 22:42:23,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 22:42:23,350 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:42:23,350 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:42:23,351 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:42:23,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:42:23,351 INFO L82 PathProgramCache]: Analyzing trace with hash -1708175791, now seen corresponding path program 1 times [2019-12-18 22:42:23,351 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:42:23,352 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835620785] [2019-12-18 22:42:23,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:42:23,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:42:23,619 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 22:42:23,620 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835620785] [2019-12-18 22:42:23,620 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:42:23,620 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 22:42:23,620 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663403510] [2019-12-18 22:42:23,621 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 22:42:23,621 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:42:23,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 22:42:23,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-12-18 22:42:23,622 INFO L87 Difference]: Start difference. First operand 2990 states and 8464 transitions. Second operand 12 states. [2019-12-18 22:42:24,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:42:24,075 INFO L93 Difference]: Finished difference Result 5704 states and 16076 transitions. [2019-12-18 22:42:24,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 22:42:24,076 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 68 [2019-12-18 22:42:24,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:42:24,083 INFO L225 Difference]: With dead ends: 5704 [2019-12-18 22:42:24,083 INFO L226 Difference]: Without dead ends: 5671 [2019-12-18 22:42:24,084 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2019-12-18 22:42:24,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5671 states. [2019-12-18 22:42:24,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5671 to 4145. [2019-12-18 22:42:24,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4145 states. [2019-12-18 22:42:24,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4145 states to 4145 states and 11627 transitions. [2019-12-18 22:42:24,147 INFO L78 Accepts]: Start accepts. Automaton has 4145 states and 11627 transitions. Word has length 68 [2019-12-18 22:42:24,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:42:24,147 INFO L462 AbstractCegarLoop]: Abstraction has 4145 states and 11627 transitions. [2019-12-18 22:42:24,147 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 22:42:24,147 INFO L276 IsEmpty]: Start isEmpty. Operand 4145 states and 11627 transitions. [2019-12-18 22:42:24,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 22:42:24,151 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:42:24,151 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:42:24,151 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:42:24,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:42:24,152 INFO L82 PathProgramCache]: Analyzing trace with hash 947098105, now seen corresponding path program 2 times [2019-12-18 22:42:24,152 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:42:24,152 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999594260] [2019-12-18 22:42:24,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:42:24,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 22:42:24,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 22:42:24,268 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 22:42:24,268 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 22:42:24,272 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] ULTIMATE.startENTRY-->L800: Formula: (let ((.cse0 (store |v_#valid_65| 0 0))) (and (= v_~y$r_buff0_thd3~0_18 0) (= 0 v_~y$w_buff1~0_28) (= 0 v_~weak$$choice0~0_8) (= 0 v_~y$r_buff1_thd3~0_17) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y$w_buff0_used~0_123 0) (= 0 v_~y$r_buff1_thd0~0_49) (= 0 v_~__unbuffered_cnt~0_20) (= v_~y$r_buff0_thd2~0_20 0) (= (store |v_#length_26| |v_ULTIMATE.start_main_~#t2189~0.base_27| 4) |v_#length_25|) (= v_~y$read_delayed~0_7 0) (= v_~y$w_buff1_used~0_75 0) (= |v_#valid_63| (store .cse0 |v_ULTIMATE.start_main_~#t2189~0.base_27| 1)) (= v_~y~0_30 0) (= v_~x~0_13 0) (< 0 |v_#StackHeapBarrier_17|) (= v_~y$r_buff0_thd1~0_26 0) (= v_~main$tmp_guard0~0_6 0) (= v_~y$mem_tmp~0_11 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2189~0.base_27| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2189~0.base_27|) |v_ULTIMATE.start_main_~#t2189~0.offset_20| 0)) |v_#memory_int_21|) (= 0 v_~weak$$choice2~0_33) (= 0 v_~y$r_buff1_thd1~0_18) (= v_~y$r_buff0_thd0~0_83 0) (= 0 v_~y$w_buff0~0_30) (= 0 v_~y$read_delayed_var~0.base_7) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2189~0.base_27|)) (= 0 v_~y$r_buff1_thd2~0_17) (= |v_#NULL.offset_5| 0) (= v_~__unbuffered_p2_EAX~0_9 0) (= |v_ULTIMATE.start_main_~#t2189~0.offset_20| 0) (= v_~main$tmp_guard1~0_12 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t2189~0.base_27|) (= 0 |v_#NULL.base_5|) (= 0 v_~y$flush_delayed~0_16))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_65|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet30=|v_ULTIMATE.start_main_#t~nondet30_9|, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_11|, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_13|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_17|, ULTIMATE.start_main_~#t2191~0.base=|v_ULTIMATE.start_main_~#t2191~0.base_19|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_11|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_14|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_14|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_13|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_16|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_16|, ~y$mem_tmp~0=v_~y$mem_tmp~0_11, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_17, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_26, ~y$flush_delayed~0=v_~y$flush_delayed~0_16, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_9, ULTIMATE.start_main_~#t2190~0.offset=|v_ULTIMATE.start_main_~#t2190~0.offset_18|, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_9|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_14|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_16|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_14|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_13|, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_14|, ~y$w_buff1~0=v_~y$w_buff1~0_28, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_20, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_49, ~x~0=v_~x~0_13, ULTIMATE.start_main_#t~nondet31=|v_ULTIMATE.start_main_#t~nondet31_9|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_123, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_11|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_13|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_15|, ULTIMATE.start_main_~#t2189~0.offset=|v_ULTIMATE.start_main_~#t2189~0.offset_20|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_11|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_16|, ULTIMATE.start_main_~#t2191~0.offset=|v_ULTIMATE.start_main_~#t2191~0.offset_16|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_15|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_16|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_18, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_13|, ~y$w_buff0~0=v_~y$w_buff0~0_30, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_18, ~y~0=v_~y~0_30, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_10|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_9|, ULTIMATE.start_main_~#t2189~0.base=|v_ULTIMATE.start_main_~#t2189~0.base_27|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_13|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_16|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_13|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_14|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_17, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_17|, ULTIMATE.start_main_~#t2190~0.base=|v_ULTIMATE.start_main_~#t2190~0.base_23|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_83, #valid=|v_#valid_63|, #memory_int=|v_#memory_int_21|, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_75} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet30, ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_~#t2191~0.base, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite50, ~y$read_delayed~0, ULTIMATE.start_main_#t~ite52, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t2190~0.offset, ULTIMATE.start_main_#t~nondet22, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_#t~nondet31, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_~#t2189~0.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_~#t2191~0.offset, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite51, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_~#t2189~0.base, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_~#t2190~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 22:42:24,273 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [800] [800] L800-1-->L802: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t2190~0.offset_10|) (= |v_#memory_int_11| (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2190~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2190~0.base_11|) |v_ULTIMATE.start_main_~#t2190~0.offset_10| 1))) (= (store |v_#valid_38| |v_ULTIMATE.start_main_~#t2190~0.base_11| 1) |v_#valid_37|) (= 0 (select |v_#valid_38| |v_ULTIMATE.start_main_~#t2190~0.base_11|)) (not (= |v_ULTIMATE.start_main_~#t2190~0.base_11| 0)) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2190~0.base_11| 4)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t2190~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_6|, ULTIMATE.start_main_~#t2190~0.base=|v_ULTIMATE.start_main_~#t2190~0.base_11|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2190~0.offset=|v_ULTIMATE.start_main_~#t2190~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_~#t2190~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_~#t2190~0.offset] because there is no mapped edge [2019-12-18 22:42:24,273 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [691] [691] P0ENTRY-->L4-3: Formula: (and (= 1 v_~y$w_buff0_used~0_85) (= 2 v_~y$w_buff0~0_16) (= 1 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|) (= v_~y$w_buff1_used~0_48 v_~y$w_buff0_used~0_86) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_6 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|) (= v_~y$w_buff0~0_17 v_~y$w_buff1~0_13) (= v_P0Thread1of1ForFork0_~arg.offset_4 |v_P0Thread1of1ForFork0_#in~arg.offset_4|) (= 0 (mod v_~y$w_buff1_used~0_48 256)) (= v_P0Thread1of1ForFork0_~arg.base_4 |v_P0Thread1of1ForFork0_#in~arg.base_4|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_4|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_86, ~y$w_buff0~0=v_~y$w_buff0~0_17, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_4|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_4|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_85, ~y$w_buff1~0=v_~y$w_buff1~0_13, ~y$w_buff0~0=v_~y$w_buff0~0_16, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_6, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_4|, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_4, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_4, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_48} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 22:42:24,275 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [801] [801] L802-1-->L804: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t2191~0.offset_11|) (= |v_#valid_39| (store |v_#valid_40| |v_ULTIMATE.start_main_~#t2191~0.base_13| 1)) (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2191~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2191~0.base_13|) |v_ULTIMATE.start_main_~#t2191~0.offset_11| 2))) (= (select |v_#valid_40| |v_ULTIMATE.start_main_~#t2191~0.base_13|) 0) (not (= |v_ULTIMATE.start_main_~#t2191~0.base_13| 0)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2191~0.base_13|) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t2191~0.base_13| 4) |v_#length_17|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_5|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t2191~0.base=|v_ULTIMATE.start_main_~#t2191~0.base_13|, #length=|v_#length_17|, ULTIMATE.start_main_~#t2191~0.offset=|v_ULTIMATE.start_main_~#t2191~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet22, #valid, #memory_int, ULTIMATE.start_main_~#t2191~0.base, #length, ULTIMATE.start_main_~#t2191~0.offset] because there is no mapped edge [2019-12-18 22:42:24,276 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L741-->L741-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In2097244291 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In2097244291 256) 0))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite5_Out2097244291|) (not .cse0) (not .cse1)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out2097244291| ~y$w_buff0_used~0_In2097244291) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2097244291, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2097244291} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out2097244291|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2097244291, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2097244291} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 22:42:24,277 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L757-2-->L757-4: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In-98207341 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-98207341 256)))) (or (and (= ~y~0_In-98207341 |P1Thread1of1ForFork1_#t~ite9_Out-98207341|) (or .cse0 .cse1)) (and (not .cse0) (= ~y$w_buff1~0_In-98207341 |P1Thread1of1ForFork1_#t~ite9_Out-98207341|) (not .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-98207341, ~y$w_buff1~0=~y$w_buff1~0_In-98207341, ~y~0=~y~0_In-98207341, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-98207341} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-98207341, ~y$w_buff1~0=~y$w_buff1~0_In-98207341, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out-98207341|, ~y~0=~y~0_In-98207341, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-98207341} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9] because there is no mapped edge [2019-12-18 22:42:24,278 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L742-->L742-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd1~0_In-1309905689 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-1309905689 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In-1309905689 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd1~0_In-1309905689 256) 0))) (or (and (= ~y$w_buff1_used~0_In-1309905689 |P0Thread1of1ForFork0_#t~ite6_Out-1309905689|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-1309905689|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1309905689, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1309905689, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1309905689, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1309905689} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1309905689|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1309905689, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1309905689, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1309905689, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1309905689} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 22:42:24,278 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L743-->L744: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In-1395713635 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-1395713635 256) 0))) (or (and (not .cse0) (= ~y$r_buff0_thd1~0_Out-1395713635 0) (not .cse1)) (and (or .cse0 .cse1) (= ~y$r_buff0_thd1~0_In-1395713635 ~y$r_buff0_thd1~0_Out-1395713635)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1395713635, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1395713635} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1395713635, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1395713635|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-1395713635} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 22:42:24,279 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L744-->L744-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In-782501428 256))) (.cse0 (= (mod ~y$r_buff1_thd1~0_In-782501428 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-782501428 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd1~0_In-782501428 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out-782501428| ~y$r_buff1_thd1~0_In-782501428) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork0_#t~ite8_Out-782501428| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-782501428, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-782501428, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-782501428, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-782501428} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-782501428, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-782501428, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-782501428|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-782501428, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-782501428} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 22:42:24,279 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L744-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= |v_P0Thread1of1ForFork0_#t~ite8_8| v_~y$r_buff1_thd1~0_14)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_14, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 22:42:24,280 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L777-2-->L777-4: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In832422284 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd3~0_In832422284 256) 0))) (or (and (not .cse0) (= ~y$w_buff1~0_In832422284 |P2Thread1of1ForFork2_#t~ite15_Out832422284|) (not .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite15_Out832422284| ~y~0_In832422284) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In832422284, ~y$w_buff1~0=~y$w_buff1~0_In832422284, ~y~0=~y~0_In832422284, ~y$w_buff1_used~0=~y$w_buff1_used~0_In832422284} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In832422284, P2Thread1of1ForFork2_#t~ite15=|P2Thread1of1ForFork2_#t~ite15_Out832422284|, ~y$w_buff1~0=~y$w_buff1~0_In832422284, ~y~0=~y~0_In832422284, ~y$w_buff1_used~0=~y$w_buff1_used~0_In832422284} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-18 22:42:24,280 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L777-4-->L778: Formula: (= |v_P2Thread1of1ForFork2_#t~ite15_8| v_~y~0_20) InVars {P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_8|} OutVars{P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_7|, ~y~0=v_~y~0_20, P2Thread1of1ForFork2_#t~ite16=|v_P2Thread1of1ForFork2_#t~ite16_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15, ~y~0, P2Thread1of1ForFork2_#t~ite16] because there is no mapped edge [2019-12-18 22:42:24,280 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L757-4-->L758: Formula: (= |v_P1Thread1of1ForFork1_#t~ite9_8| v_~y~0_21) InVars {P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_8|} OutVars{P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_7|, P1Thread1of1ForFork1_#t~ite10=|v_P1Thread1of1ForFork1_#t~ite10_7|, ~y~0=v_~y~0_21} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10, ~y~0] because there is no mapped edge [2019-12-18 22:42:24,280 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L758-->L758-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In-1638086158 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-1638086158 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite11_Out-1638086158| ~y$w_buff0_used~0_In-1638086158)) (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite11_Out-1638086158| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1638086158, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1638086158} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1638086158, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1638086158, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-1638086158|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-18 22:42:24,281 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L759-->L759-2: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd2~0_In-1941162871 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In-1941162871 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-1941162871 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In-1941162871 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In-1941162871 |P1Thread1of1ForFork1_#t~ite12_Out-1941162871|)) (and (= 0 |P1Thread1of1ForFork1_#t~ite12_Out-1941162871|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1941162871, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1941162871, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1941162871, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1941162871} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1941162871, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1941162871, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1941162871, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-1941162871|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1941162871} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-18 22:42:24,281 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L760-->L760-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-1468128171 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1468128171 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite13_Out-1468128171| ~y$r_buff0_thd2~0_In-1468128171)) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite13_Out-1468128171| 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1468128171, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1468128171} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1468128171, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1468128171, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-1468128171|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-18 22:42:24,282 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L761-->L761-2: Formula: (let ((.cse2 (= (mod ~y$w_buff1_used~0_In-685255054 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd2~0_In-685255054 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-685255054 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-685255054 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite14_Out-685255054| ~y$r_buff1_thd2~0_In-685255054) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |P1Thread1of1ForFork1_#t~ite14_Out-685255054|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-685255054, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-685255054, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-685255054, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-685255054} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-685255054, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-685255054, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-685255054, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-685255054|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-685255054} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-18 22:42:24,282 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [794] [794] L761-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~y$r_buff1_thd2~0_13 |v_P1Thread1of1ForFork1_#t~ite14_8|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_8|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_13, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_7|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 22:42:24,282 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L778-->L778-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1234234698 256))) (.cse1 (= (mod ~y$r_buff0_thd3~0_In1234234698 256) 0))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite17_Out1234234698|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In1234234698 |P2Thread1of1ForFork2_#t~ite17_Out1234234698|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1234234698, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1234234698} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1234234698, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1234234698, P2Thread1of1ForFork2_#t~ite17=|P2Thread1of1ForFork2_#t~ite17_Out1234234698|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-18 22:42:24,283 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L779-->L779-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd3~0_In-352580201 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In-352580201 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd3~0_In-352580201 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In-352580201 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite18_Out-352580201| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~y$w_buff1_used~0_In-352580201 |P2Thread1of1ForFork2_#t~ite18_Out-352580201|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-352580201, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-352580201, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-352580201, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-352580201} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-352580201, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-352580201, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-352580201, P2Thread1of1ForFork2_#t~ite18=|P2Thread1of1ForFork2_#t~ite18_Out-352580201|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-352580201} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite18] because there is no mapped edge [2019-12-18 22:42:24,284 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L780-->L780-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-417327330 256))) (.cse0 (= (mod ~y$r_buff0_thd3~0_In-417327330 256) 0))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite19_Out-417327330|) (not .cse0) (not .cse1)) (and (= ~y$r_buff0_thd3~0_In-417327330 |P2Thread1of1ForFork2_#t~ite19_Out-417327330|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-417327330, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-417327330} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-417327330, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-417327330, P2Thread1of1ForFork2_#t~ite19=|P2Thread1of1ForFork2_#t~ite19_Out-417327330|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite19] because there is no mapped edge [2019-12-18 22:42:24,284 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L781-->L781-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff0_used~0_In1381537907 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd3~0_In1381537907 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd3~0_In1381537907 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In1381537907 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork2_#t~ite20_Out1381537907| 0)) (and (or .cse2 .cse3) (= ~y$r_buff1_thd3~0_In1381537907 |P2Thread1of1ForFork2_#t~ite20_Out1381537907|) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1381537907, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1381537907, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1381537907, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1381537907} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1381537907, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1381537907, P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_Out1381537907|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1381537907, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1381537907} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20] because there is no mapped edge [2019-12-18 22:42:24,284 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L781-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= |v_P2Thread1of1ForFork2_#t~ite20_8| v_~y$r_buff1_thd3~0_12)) InVars {P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_12, P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_7|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite20, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-18 22:42:24,284 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [733] [733] L804-1-->L810: Formula: (and (= 3 v_~__unbuffered_cnt~0_10) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet23, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 22:42:24,285 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L810-2-->L810-5: Formula: (let ((.cse1 (= |ULTIMATE.start_main_#t~ite25_Out-72206140| |ULTIMATE.start_main_#t~ite24_Out-72206140|)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-72206140 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-72206140 256)))) (or (and (not .cse0) .cse1 (= ~y$w_buff1~0_In-72206140 |ULTIMATE.start_main_#t~ite24_Out-72206140|) (not .cse2)) (and (= ~y~0_In-72206140 |ULTIMATE.start_main_#t~ite24_Out-72206140|) .cse1 (or .cse2 .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-72206140, ~y~0=~y~0_In-72206140, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-72206140, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-72206140} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-72206140, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-72206140|, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out-72206140|, ~y~0=~y~0_In-72206140, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-72206140, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-72206140} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25] because there is no mapped edge [2019-12-18 22:42:24,286 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L811-->L811-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In-1149569791 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-1149569791 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite26_Out-1149569791| 0)) (and (= |ULTIMATE.start_main_#t~ite26_Out-1149569791| ~y$w_buff0_used~0_In-1149569791) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1149569791, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1149569791} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1149569791, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1149569791, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out-1149569791|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite26] because there is no mapped edge [2019-12-18 22:42:24,287 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L812-->L812-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1808029712 256))) (.cse3 (= (mod ~y$r_buff1_thd0~0_In-1808029712 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1808029712 256))) (.cse1 (= (mod ~y$r_buff0_thd0~0_In-1808029712 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite27_Out-1808029712| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite27_Out-1808029712| ~y$w_buff1_used~0_In-1808029712) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1808029712, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1808029712, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1808029712, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1808029712} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1808029712, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1808029712, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out-1808029712|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1808029712, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1808029712} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite27] because there is no mapped edge [2019-12-18 22:42:24,287 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L813-->L813-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In2113034413 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In2113034413 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite28_Out2113034413|) (not .cse1)) (and (or .cse0 .cse1) (= ~y$r_buff0_thd0~0_In2113034413 |ULTIMATE.start_main_#t~ite28_Out2113034413|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2113034413, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2113034413} OutVars{ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out2113034413|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2113034413, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2113034413} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28] because there is no mapped edge [2019-12-18 22:42:24,288 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L814-->L814-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1510233316 256))) (.cse1 (= (mod ~y$r_buff0_thd0~0_In-1510233316 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd0~0_In-1510233316 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In-1510233316 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite29_Out-1510233316|)) (and (= ~y$r_buff1_thd0~0_In-1510233316 |ULTIMATE.start_main_#t~ite29_Out-1510233316|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1510233316, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1510233316, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1510233316, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1510233316} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1510233316, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out-1510233316|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1510233316, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1510233316, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1510233316} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-18 22:42:24,291 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [806] [806] L823-->L823-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-1856201220 256)))) (or (and (= |ULTIMATE.start_main_#t~ite39_Out-1856201220| |ULTIMATE.start_main_#t~ite38_Out-1856201220|) (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-1856201220 256)))) (or (and .cse0 (= (mod ~y$r_buff1_thd0~0_In-1856201220 256) 0)) (= 0 (mod ~y$w_buff0_used~0_In-1856201220 256)) (and .cse0 (= 0 (mod ~y$w_buff1_used~0_In-1856201220 256))))) (= ~y$w_buff1~0_In-1856201220 |ULTIMATE.start_main_#t~ite38_Out-1856201220|) .cse1) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite38_In-1856201220| |ULTIMATE.start_main_#t~ite38_Out-1856201220|) (= ~y$w_buff1~0_In-1856201220 |ULTIMATE.start_main_#t~ite39_Out-1856201220|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1856201220, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1856201220, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1856201220, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_In-1856201220|, ~weak$$choice2~0=~weak$$choice2~0_In-1856201220, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1856201220, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1856201220} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-1856201220, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1856201220, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-1856201220|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1856201220, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-1856201220|, ~weak$$choice2~0=~weak$$choice2~0_In-1856201220, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1856201220, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1856201220} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-18 22:42:24,291 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [805] [805] L824-->L824-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In134015811 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite41_In134015811| |ULTIMATE.start_main_#t~ite41_Out134015811|) (= ~y$w_buff0_used~0_In134015811 |ULTIMATE.start_main_#t~ite42_Out134015811|)) (and (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In134015811 256)))) (or (and (= (mod ~y$r_buff1_thd0~0_In134015811 256) 0) .cse1) (= (mod ~y$w_buff0_used~0_In134015811 256) 0) (and (= 0 (mod ~y$w_buff1_used~0_In134015811 256)) .cse1))) .cse0 (= |ULTIMATE.start_main_#t~ite41_Out134015811| ~y$w_buff0_used~0_In134015811) (= |ULTIMATE.start_main_#t~ite41_Out134015811| |ULTIMATE.start_main_#t~ite42_Out134015811|)))) InVars {ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_In134015811|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In134015811, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In134015811, ~weak$$choice2~0=~weak$$choice2~0_In134015811, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In134015811, ~y$w_buff1_used~0=~y$w_buff1_used~0_In134015811} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out134015811|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In134015811, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In134015811, ~weak$$choice2~0=~weak$$choice2~0_In134015811, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out134015811|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In134015811, ~y$w_buff1_used~0=~y$w_buff1_used~0_In134015811} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 22:42:24,293 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [736] [736] L826-->L827: Formula: (and (not (= (mod v_~weak$$choice2~0_19 256) 0)) (= v_~y$r_buff0_thd0~0_65 v_~y$r_buff0_thd0~0_64)) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_65, ~weak$$choice2~0=v_~weak$$choice2~0_19} OutVars{~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_64, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_10|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_9|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_8|, ~weak$$choice2~0=v_~weak$$choice2~0_19} AuxVars[] AssignedVars[~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-18 22:42:24,294 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L829-->L832-1: Formula: (and (= 0 v_~y$flush_delayed~0_10) (= v_~y~0_25 v_~y$mem_tmp~0_7) (not (= 0 (mod v_~y$flush_delayed~0_11 256))) (= (mod v_~main$tmp_guard1~0_7 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_11, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_10|, ~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_10, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~y~0=v_~y~0_25, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ~y$flush_delayed~0, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 22:42:24,294 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] L832-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 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_11, 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 22:42:24,377 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 10:42:24 BasicIcfg [2019-12-18 22:42:24,378 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 22:42:24,383 INFO L168 Benchmark]: Toolchain (without parser) took 75534.81 ms. Allocated memory was 138.9 MB in the beginning and 3.2 GB in the end (delta: 3.1 GB). Free memory was 102.0 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-12-18 22:42:24,384 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-18 22:42:24,385 INFO L168 Benchmark]: CACSL2BoogieTranslator took 772.57 ms. Allocated memory was 138.9 MB in the beginning and 203.9 MB in the end (delta: 65.0 MB). Free memory was 101.6 MB in the beginning and 157.8 MB in the end (delta: -56.3 MB). Peak memory consumption was 26.7 MB. Max. memory is 7.1 GB. [2019-12-18 22:42:24,386 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.01 ms. Allocated memory is still 203.9 MB. Free memory was 157.8 MB in the beginning and 155.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 22:42:24,391 INFO L168 Benchmark]: Boogie Preprocessor took 39.14 ms. Allocated memory is still 203.9 MB. Free memory was 155.2 MB in the beginning and 152.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 22:42:24,392 INFO L168 Benchmark]: RCFGBuilder took 791.16 ms. Allocated memory is still 203.9 MB. Free memory was 152.6 MB in the beginning and 103.1 MB in the end (delta: 49.4 MB). Peak memory consumption was 49.4 MB. Max. memory is 7.1 GB. [2019-12-18 22:42:24,393 INFO L168 Benchmark]: TraceAbstraction took 73856.43 ms. Allocated memory was 203.9 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 102.5 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-12-18 22:42:24,400 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.21 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 772.57 ms. Allocated memory was 138.9 MB in the beginning and 203.9 MB in the end (delta: 65.0 MB). Free memory was 101.6 MB in the beginning and 157.8 MB in the end (delta: -56.3 MB). Peak memory consumption was 26.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 70.01 ms. Allocated memory is still 203.9 MB. Free memory was 157.8 MB in the beginning and 155.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.14 ms. Allocated memory is still 203.9 MB. Free memory was 155.2 MB in the beginning and 152.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 791.16 ms. Allocated memory is still 203.9 MB. Free memory was 152.6 MB in the beginning and 103.1 MB in the end (delta: 49.4 MB). Peak memory consumption was 49.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 73856.43 ms. Allocated memory was 203.9 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 102.5 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.9s, 173 ProgramPointsBefore, 96 ProgramPointsAfterwards, 210 TransitionsBefore, 107 TransitionsAfterwards, 17114 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 38 ConcurrentYvCompositions, 30 ChoiceCompositions, 5662 VarBasedMoverChecksPositive, 190 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 81965 CheckedPairsTotal, 110 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L800] FCALL, FORK 0 pthread_create(&t2189, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L730] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L731] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L732] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L733] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L734] 1 y$r_buff0_thd1 = (_Bool)1 [L737] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L740] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L802] FCALL, FORK 0 pthread_create(&t2190, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L740] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L804] FCALL, FORK 0 pthread_create(&t2191, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L754] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L757] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L741] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L742] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L771] 3 __unbuffered_p2_EAX = x [L774] 3 y = 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=2, 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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2] [L777] 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=2, 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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2] [L758] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L759] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L760] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L778] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L779] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L780] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L810] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, 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=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L810] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L811] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L812] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L813] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L814] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L817] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L818] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L819] 0 y$flush_delayed = weak$$choice2 [L820] 0 y$mem_tmp = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L821] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L821] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L822] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L822] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L823] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L824] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L825] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L825] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L827] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L827] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L828] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 164 locations, 2 error locations. Result: UNSAFE, OverallTime: 73.5s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 20.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2697 SDtfs, 2245 SDslu, 4864 SDs, 0 SdLazy, 3565 SolverSat, 151 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 140 GetRequests, 39 SyntacticMatches, 15 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=173329occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 28.1s AutomataMinimizationTime, 17 MinimizatonAttempts, 54710 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 845 NumberOfCodeBlocks, 845 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 760 ConstructedInterpolants, 0 QuantifiedInterpolants, 126775 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...