/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/podwr001_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 07:00:39,574 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 07:00:39,577 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 07:00:39,595 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 07:00:39,595 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 07:00:39,597 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 07:00:39,599 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 07:00:39,609 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 07:00:39,613 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 07:00:39,616 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 07:00:39,618 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 07:00:39,619 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 07:00:39,620 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 07:00:39,621 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 07:00:39,624 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 07:00:39,625 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 07:00:39,627 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 07:00:39,627 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 07:00:39,629 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 07:00:39,633 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 07:00:39,638 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 07:00:39,642 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 07:00:39,643 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 07:00:39,644 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 07:00:39,646 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 07:00:39,647 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 07:00:39,647 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 07:00:39,649 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 07:00:39,650 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 07:00:39,651 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 07:00:39,651 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 07:00:39,652 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 07:00:39,652 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 07:00:39,654 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 07:00:39,655 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 07:00:39,655 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 07:00:39,656 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 07:00:39,656 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 07:00:39,656 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 07:00:39,657 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 07:00:39,658 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 07:00:39,659 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-27 07:00:39,687 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 07:00:39,687 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 07:00:39,690 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 07:00:39,690 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 07:00:39,691 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 07:00:39,691 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 07:00:39,691 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 07:00:39,692 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 07:00:39,692 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 07:00:39,692 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 07:00:39,693 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 07:00:39,693 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 07:00:39,694 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 07:00:39,694 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 07:00:39,694 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 07:00:39,694 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 07:00:39,695 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 07:00:39,695 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 07:00:39,695 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 07:00:39,696 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 07:00:39,696 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 07:00:39,696 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 07:00:39,697 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 07:00:39,697 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 07:00:39,697 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 07:00:39,697 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 07:00:39,697 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 07:00:39,698 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 07:00:39,698 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 07:00:39,698 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 07:00:39,991 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 07:00:39,999 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 07:00:40,004 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 07:00:40,011 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 07:00:40,011 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 07:00:40,012 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/podwr001_rmo.oepc.i [2019-12-27 07:00:40,073 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b34a8a049/953893672876449a9e7ce820934e53ba/FLAG5baf43751 [2019-12-27 07:00:40,602 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 07:00:40,602 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/podwr001_rmo.oepc.i [2019-12-27 07:00:40,627 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b34a8a049/953893672876449a9e7ce820934e53ba/FLAG5baf43751 [2019-12-27 07:00:40,930 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b34a8a049/953893672876449a9e7ce820934e53ba [2019-12-27 07:00:40,941 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 07:00:40,942 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 07:00:40,943 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 07:00:40,944 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 07:00:40,947 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 07:00:40,948 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:00:40" (1/1) ... [2019-12-27 07:00:40,951 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51159066 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:00:40, skipping insertion in model container [2019-12-27 07:00:40,951 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:00:40" (1/1) ... [2019-12-27 07:00:40,958 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 07:00:40,999 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 07:00:41,508 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 07:00:41,520 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 07:00:41,584 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 07:00:41,655 INFO L208 MainTranslator]: Completed translation [2019-12-27 07:00:41,655 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:00:41 WrapperNode [2019-12-27 07:00:41,655 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 07:00:41,656 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 07:00:41,656 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 07:00:41,656 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 07:00:41,665 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:00:41" (1/1) ... [2019-12-27 07:00:41,686 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:00:41" (1/1) ... [2019-12-27 07:00:41,718 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 07:00:41,718 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 07:00:41,718 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 07:00:41,718 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 07:00:41,728 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:00:41" (1/1) ... [2019-12-27 07:00:41,728 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:00:41" (1/1) ... [2019-12-27 07:00:41,734 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:00:41" (1/1) ... [2019-12-27 07:00:41,735 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:00:41" (1/1) ... [2019-12-27 07:00:41,746 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:00:41" (1/1) ... [2019-12-27 07:00:41,750 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:00:41" (1/1) ... [2019-12-27 07:00:41,754 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:00:41" (1/1) ... [2019-12-27 07:00:41,760 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 07:00:41,760 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 07:00:41,760 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 07:00:41,761 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 07:00:41,761 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:00:41" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 07:00:41,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 07:00:41,838 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 07:00:41,838 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 07:00:41,838 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 07:00:41,838 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 07:00:41,838 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 07:00:41,838 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 07:00:41,839 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 07:00:41,839 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 07:00:41,839 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 07:00:41,839 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 07:00:41,839 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 07:00:41,839 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 07:00:41,841 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 07:00:42,572 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 07:00:42,573 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 07:00:42,574 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:00:42 BoogieIcfgContainer [2019-12-27 07:00:42,574 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 07:00:42,575 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 07:00:42,576 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 07:00:42,579 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 07:00:42,579 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 07:00:40" (1/3) ... [2019-12-27 07:00:42,580 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7eaf712 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:00:42, skipping insertion in model container [2019-12-27 07:00:42,580 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:00:41" (2/3) ... [2019-12-27 07:00:42,581 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7eaf712 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:00:42, skipping insertion in model container [2019-12-27 07:00:42,581 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:00:42" (3/3) ... [2019-12-27 07:00:42,583 INFO L109 eAbstractionObserver]: Analyzing ICFG podwr001_rmo.oepc.i [2019-12-27 07:00:42,594 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 07:00:42,594 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 07:00:42,602 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 07:00:42,603 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 07:00:42,648 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,649 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,649 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,649 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,650 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,650 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,650 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,651 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,651 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,652 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,652 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,652 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,652 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,653 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,653 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,653 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,653 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,654 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,654 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,654 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,655 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,655 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,655 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,656 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,656 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,656 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,656 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,657 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,657 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,657 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,657 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,658 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,658 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,658 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,659 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,659 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,659 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,659 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,660 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,660 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,660 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,661 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,681 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,681 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,681 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,681 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,681 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,682 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,682 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,682 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,682 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,683 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,683 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,683 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,683 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,684 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,684 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,684 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,685 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,685 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,685 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,686 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,686 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,686 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,687 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,687 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,687 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,688 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,688 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,688 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,688 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,688 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,688 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,689 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,689 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,689 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,689 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,690 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,690 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,690 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,690 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,690 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,691 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,691 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,691 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,691 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,692 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,692 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,692 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,692 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,692 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,693 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,693 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,693 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,693 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,693 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,694 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,694 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,694 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,694 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,694 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,695 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,695 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,695 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,695 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,695 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,696 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,696 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,696 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,696 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,697 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,697 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,697 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,697 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,697 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,698 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,698 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,698 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,698 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,698 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,699 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,699 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,699 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,699 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,699 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,700 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,700 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,700 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,700 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,700 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,700 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,701 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,701 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,701 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,701 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,702 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,702 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,702 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,702 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,702 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,703 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,703 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,703 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,703 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,704 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,704 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,704 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,704 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,704 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,704 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,705 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,705 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,705 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,705 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,705 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,706 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,706 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,706 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,706 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,706 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,707 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,707 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,707 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,707 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,707 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,707 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,708 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,708 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,708 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,708 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,708 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,709 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,709 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,709 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,709 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,709 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,710 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,710 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,710 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,710 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,711 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,711 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,714 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,715 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,715 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,715 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,715 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,715 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,716 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,716 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,716 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,716 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,716 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,717 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,717 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,717 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,717 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,717 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,717 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,718 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,718 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,718 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,718 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,718 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,718 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,719 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,719 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,719 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,719 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,719 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,720 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,720 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,720 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,720 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,720 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,723 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,723 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,724 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,724 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,724 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,725 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,725 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,725 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,725 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,725 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,726 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,726 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,728 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,728 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,728 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,728 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,729 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,729 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,729 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,729 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,729 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,729 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:42,744 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 07:00:42,764 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 07:00:42,765 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 07:00:42,765 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 07:00:42,765 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 07:00:42,765 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 07:00:42,765 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 07:00:42,765 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 07:00:42,765 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 07:00:42,787 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 176 places, 213 transitions [2019-12-27 07:00:42,788 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-27 07:00:42,892 INFO L132 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-27 07:00:42,893 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 07:00:42,910 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 210 events. 47/210 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 427 event pairs. 0/161 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 07:00:42,935 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-27 07:00:42,990 INFO L132 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-27 07:00:42,990 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 07:00:42,999 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 210 events. 47/210 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 427 event pairs. 0/161 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 07:00:43,021 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 07:00:43,022 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 07:00:46,537 WARN L192 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-27 07:00:46,672 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-27 07:00:46,710 INFO L206 etLargeBlockEncoding]: Checked pairs total: 85326 [2019-12-27 07:00:46,710 INFO L214 etLargeBlockEncoding]: Total number of compositions: 112 [2019-12-27 07:00:46,714 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 96 places, 108 transitions [2019-12-27 07:01:09,629 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 129058 states. [2019-12-27 07:01:09,630 INFO L276 IsEmpty]: Start isEmpty. Operand 129058 states. [2019-12-27 07:01:09,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 07:01:09,636 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:01:09,637 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 07:01:09,637 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-27 07:01:09,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:01:09,644 INFO L82 PathProgramCache]: Analyzing trace with hash 910080, now seen corresponding path program 1 times [2019-12-27 07:01:09,652 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:01:09,653 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915435454] [2019-12-27 07:01:09,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:01:09,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:01:09,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:01:09,880 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915435454] [2019-12-27 07:01:09,881 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:01:09,881 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 07:01:09,882 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237306456] [2019-12-27 07:01:09,885 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:01:09,886 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:01:09,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:01:09,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:01:09,898 INFO L87 Difference]: Start difference. First operand 129058 states. Second operand 3 states. [2019-12-27 07:01:13,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:01:13,708 INFO L93 Difference]: Finished difference Result 120110 states and 517368 transitions. [2019-12-27 07:01:13,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:01:13,710 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 07:01:13,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:01:14,368 INFO L225 Difference]: With dead ends: 120110 [2019-12-27 07:01:14,370 INFO L226 Difference]: Without dead ends: 112648 [2019-12-27 07:01:14,372 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:01:19,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112648 states. [2019-12-27 07:01:24,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112648 to 112648. [2019-12-27 07:01:24,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112648 states. [2019-12-27 07:01:25,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112648 states to 112648 states and 484580 transitions. [2019-12-27 07:01:25,552 INFO L78 Accepts]: Start accepts. Automaton has 112648 states and 484580 transitions. Word has length 3 [2019-12-27 07:01:25,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:01:25,552 INFO L462 AbstractCegarLoop]: Abstraction has 112648 states and 484580 transitions. [2019-12-27 07:01:25,552 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:01:25,552 INFO L276 IsEmpty]: Start isEmpty. Operand 112648 states and 484580 transitions. [2019-12-27 07:01:25,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 07:01:25,556 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:01:25,556 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:01:25,557 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-27 07:01:25,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:01:25,557 INFO L82 PathProgramCache]: Analyzing trace with hash 459684969, now seen corresponding path program 1 times [2019-12-27 07:01:25,557 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:01:25,558 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489823053] [2019-12-27 07:01:25,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:01:25,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:01:25,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:01:25,666 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489823053] [2019-12-27 07:01:25,666 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:01:25,666 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:01:25,666 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575199987] [2019-12-27 07:01:25,667 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:01:25,668 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:01:25,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:01:25,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:01:25,668 INFO L87 Difference]: Start difference. First operand 112648 states and 484580 transitions. Second operand 4 states. [2019-12-27 07:01:31,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:01:31,305 INFO L93 Difference]: Finished difference Result 175220 states and 723657 transitions. [2019-12-27 07:01:31,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:01:31,306 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 07:01:31,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:01:31,961 INFO L225 Difference]: With dead ends: 175220 [2019-12-27 07:01:31,961 INFO L226 Difference]: Without dead ends: 175171 [2019-12-27 07:01:31,962 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:01:38,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175171 states. [2019-12-27 07:01:42,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175171 to 161661. [2019-12-27 07:01:42,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161661 states. [2019-12-27 07:01:42,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161661 states to 161661 states and 675776 transitions. [2019-12-27 07:01:42,642 INFO L78 Accepts]: Start accepts. Automaton has 161661 states and 675776 transitions. Word has length 11 [2019-12-27 07:01:42,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:01:42,643 INFO L462 AbstractCegarLoop]: Abstraction has 161661 states and 675776 transitions. [2019-12-27 07:01:42,643 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:01:42,643 INFO L276 IsEmpty]: Start isEmpty. Operand 161661 states and 675776 transitions. [2019-12-27 07:01:42,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 07:01:42,649 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:01:42,649 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:01:42,650 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-27 07:01:42,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:01:42,650 INFO L82 PathProgramCache]: Analyzing trace with hash 8923152, now seen corresponding path program 1 times [2019-12-27 07:01:42,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:01:42,651 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611369006] [2019-12-27 07:01:42,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:01:42,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:01:42,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:01:42,722 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611369006] [2019-12-27 07:01:42,722 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:01:42,722 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:01:42,723 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763739547] [2019-12-27 07:01:42,723 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:01:42,723 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:01:42,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:01:42,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:01:42,724 INFO L87 Difference]: Start difference. First operand 161661 states and 675776 transitions. Second operand 3 states. [2019-12-27 07:01:42,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:01:42,876 INFO L93 Difference]: Finished difference Result 34935 states and 114696 transitions. [2019-12-27 07:01:42,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:01:42,877 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 07:01:42,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:01:42,941 INFO L225 Difference]: With dead ends: 34935 [2019-12-27 07:01:42,941 INFO L226 Difference]: Without dead ends: 34935 [2019-12-27 07:01:42,942 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:01:43,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34935 states. [2019-12-27 07:01:48,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34935 to 34935. [2019-12-27 07:01:48,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34935 states. [2019-12-27 07:01:48,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34935 states to 34935 states and 114696 transitions. [2019-12-27 07:01:48,660 INFO L78 Accepts]: Start accepts. Automaton has 34935 states and 114696 transitions. Word has length 13 [2019-12-27 07:01:48,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:01:48,660 INFO L462 AbstractCegarLoop]: Abstraction has 34935 states and 114696 transitions. [2019-12-27 07:01:48,660 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:01:48,660 INFO L276 IsEmpty]: Start isEmpty. Operand 34935 states and 114696 transitions. [2019-12-27 07:01:48,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 07:01:48,663 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:01:48,663 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:01:48,664 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-27 07:01:48,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:01:48,664 INFO L82 PathProgramCache]: Analyzing trace with hash 846496093, now seen corresponding path program 1 times [2019-12-27 07:01:48,664 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:01:48,664 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43194629] [2019-12-27 07:01:48,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:01:48,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:01:48,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:01:48,715 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43194629] [2019-12-27 07:01:48,715 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:01:48,715 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:01:48,716 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060248506] [2019-12-27 07:01:48,716 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:01:48,716 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:01:48,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:01:48,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:01:48,717 INFO L87 Difference]: Start difference. First operand 34935 states and 114696 transitions. Second operand 3 states. [2019-12-27 07:01:48,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:01:48,928 INFO L93 Difference]: Finished difference Result 52469 states and 171833 transitions. [2019-12-27 07:01:48,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:01:48,928 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-27 07:01:48,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:01:49,018 INFO L225 Difference]: With dead ends: 52469 [2019-12-27 07:01:49,018 INFO L226 Difference]: Without dead ends: 52469 [2019-12-27 07:01:49,019 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:01:49,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52469 states. [2019-12-27 07:01:49,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52469 to 39684. [2019-12-27 07:01:49,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39684 states. [2019-12-27 07:01:49,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39684 states to 39684 states and 131828 transitions. [2019-12-27 07:01:49,802 INFO L78 Accepts]: Start accepts. Automaton has 39684 states and 131828 transitions. Word has length 16 [2019-12-27 07:01:49,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:01:49,803 INFO L462 AbstractCegarLoop]: Abstraction has 39684 states and 131828 transitions. [2019-12-27 07:01:49,803 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:01:49,804 INFO L276 IsEmpty]: Start isEmpty. Operand 39684 states and 131828 transitions. [2019-12-27 07:01:49,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 07:01:49,806 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:01:49,806 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:01:49,806 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-27 07:01:49,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:01:49,807 INFO L82 PathProgramCache]: Analyzing trace with hash 973495126, now seen corresponding path program 1 times [2019-12-27 07:01:49,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:01:49,807 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598074761] [2019-12-27 07:01:49,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:01:49,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:01:49,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:01:49,891 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598074761] [2019-12-27 07:01:49,891 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:01:49,892 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:01:49,892 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524777837] [2019-12-27 07:01:49,892 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:01:49,893 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:01:49,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:01:49,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:01:49,893 INFO L87 Difference]: Start difference. First operand 39684 states and 131828 transitions. Second operand 5 states. [2019-12-27 07:01:50,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:01:50,802 INFO L93 Difference]: Finished difference Result 54128 states and 176711 transitions. [2019-12-27 07:01:50,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 07:01:50,802 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-27 07:01:50,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:01:50,897 INFO L225 Difference]: With dead ends: 54128 [2019-12-27 07:01:50,897 INFO L226 Difference]: Without dead ends: 54128 [2019-12-27 07:01:50,897 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:01:51,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54128 states. [2019-12-27 07:01:51,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54128 to 45196. [2019-12-27 07:01:51,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45196 states. [2019-12-27 07:01:51,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45196 states to 45196 states and 149182 transitions. [2019-12-27 07:01:51,760 INFO L78 Accepts]: Start accepts. Automaton has 45196 states and 149182 transitions. Word has length 16 [2019-12-27 07:01:51,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:01:51,760 INFO L462 AbstractCegarLoop]: Abstraction has 45196 states and 149182 transitions. [2019-12-27 07:01:51,761 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:01:51,761 INFO L276 IsEmpty]: Start isEmpty. Operand 45196 states and 149182 transitions. [2019-12-27 07:01:51,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 07:01:51,774 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:01:51,775 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] [2019-12-27 07:01:51,775 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-27 07:01:51,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:01:51,775 INFO L82 PathProgramCache]: Analyzing trace with hash 1203621831, now seen corresponding path program 1 times [2019-12-27 07:01:51,776 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:01:51,776 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921362953] [2019-12-27 07:01:51,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:01:51,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:01:51,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:01:51,917 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921362953] [2019-12-27 07:01:51,918 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:01:51,918 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 07:01:51,918 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936845142] [2019-12-27 07:01:51,919 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 07:01:51,919 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:01:51,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 07:01:51,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 07:01:51,919 INFO L87 Difference]: Start difference. First operand 45196 states and 149182 transitions. Second operand 6 states. [2019-12-27 07:01:52,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:01:52,891 INFO L93 Difference]: Finished difference Result 67629 states and 216350 transitions. [2019-12-27 07:01:52,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 07:01:52,891 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 07:01:52,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:01:53,009 INFO L225 Difference]: With dead ends: 67629 [2019-12-27 07:01:53,009 INFO L226 Difference]: Without dead ends: 67622 [2019-12-27 07:01:53,009 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-27 07:01:53,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67622 states. [2019-12-27 07:01:54,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67622 to 44823. [2019-12-27 07:01:54,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44823 states. [2019-12-27 07:01:54,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44823 states to 44823 states and 147733 transitions. [2019-12-27 07:01:54,353 INFO L78 Accepts]: Start accepts. Automaton has 44823 states and 147733 transitions. Word has length 22 [2019-12-27 07:01:54,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:01:54,353 INFO L462 AbstractCegarLoop]: Abstraction has 44823 states and 147733 transitions. [2019-12-27 07:01:54,354 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 07:01:54,354 INFO L276 IsEmpty]: Start isEmpty. Operand 44823 states and 147733 transitions. [2019-12-27 07:01:54,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 07:01:54,371 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:01:54,371 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:01:54,371 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-27 07:01:54,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:01:54,372 INFO L82 PathProgramCache]: Analyzing trace with hash -573645910, now seen corresponding path program 1 times [2019-12-27 07:01:54,372 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:01:54,372 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033816779] [2019-12-27 07:01:54,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:01:54,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:01:54,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:01:54,431 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033816779] [2019-12-27 07:01:54,431 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:01:54,432 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:01:54,432 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641117669] [2019-12-27 07:01:54,433 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:01:54,433 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:01:54,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:01:54,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:01:54,434 INFO L87 Difference]: Start difference. First operand 44823 states and 147733 transitions. Second operand 4 states. [2019-12-27 07:01:54,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:01:54,522 INFO L93 Difference]: Finished difference Result 18428 states and 57604 transitions. [2019-12-27 07:01:54,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 07:01:54,522 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 07:01:54,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:01:54,548 INFO L225 Difference]: With dead ends: 18428 [2019-12-27 07:01:54,548 INFO L226 Difference]: Without dead ends: 18428 [2019-12-27 07:01:54,548 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:01:54,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18428 states. [2019-12-27 07:01:54,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18428 to 18100. [2019-12-27 07:01:54,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18100 states. [2019-12-27 07:01:54,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18100 states to 18100 states and 56668 transitions. [2019-12-27 07:01:54,842 INFO L78 Accepts]: Start accepts. Automaton has 18100 states and 56668 transitions. Word has length 25 [2019-12-27 07:01:54,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:01:54,842 INFO L462 AbstractCegarLoop]: Abstraction has 18100 states and 56668 transitions. [2019-12-27 07:01:54,842 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:01:54,842 INFO L276 IsEmpty]: Start isEmpty. Operand 18100 states and 56668 transitions. [2019-12-27 07:01:54,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 07:01:54,856 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:01:54,857 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:01:54,857 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-27 07:01:54,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:01:54,857 INFO L82 PathProgramCache]: Analyzing trace with hash -558988390, now seen corresponding path program 1 times [2019-12-27 07:01:54,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:01:54,857 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440874303] [2019-12-27 07:01:54,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:01:54,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:01:54,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:01:54,942 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440874303] [2019-12-27 07:01:54,942 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:01:54,942 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 07:01:54,942 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993054339] [2019-12-27 07:01:54,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 07:01:54,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:01:54,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 07:01:54,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 07:01:54,944 INFO L87 Difference]: Start difference. First operand 18100 states and 56668 transitions. Second operand 6 states. [2019-12-27 07:01:55,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:01:55,572 INFO L93 Difference]: Finished difference Result 25507 states and 76943 transitions. [2019-12-27 07:01:55,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 07:01:55,573 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 07:01:55,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:01:55,610 INFO L225 Difference]: With dead ends: 25507 [2019-12-27 07:01:55,610 INFO L226 Difference]: Without dead ends: 25507 [2019-12-27 07:01:55,611 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 07:01:55,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25507 states. [2019-12-27 07:01:56,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25507 to 20897. [2019-12-27 07:01:56,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20897 states. [2019-12-27 07:01:56,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20897 states to 20897 states and 64463 transitions. [2019-12-27 07:01:56,217 INFO L78 Accepts]: Start accepts. Automaton has 20897 states and 64463 transitions. Word has length 27 [2019-12-27 07:01:56,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:01:56,217 INFO L462 AbstractCegarLoop]: Abstraction has 20897 states and 64463 transitions. [2019-12-27 07:01:56,217 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 07:01:56,217 INFO L276 IsEmpty]: Start isEmpty. Operand 20897 states and 64463 transitions. [2019-12-27 07:01:56,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 07:01:56,241 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:01:56,241 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] [2019-12-27 07:01:56,241 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-27 07:01:56,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:01:56,241 INFO L82 PathProgramCache]: Analyzing trace with hash -856650103, now seen corresponding path program 1 times [2019-12-27 07:01:56,241 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:01:56,242 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036208573] [2019-12-27 07:01:56,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:01:56,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:01:56,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:01:56,329 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036208573] [2019-12-27 07:01:56,329 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:01:56,329 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 07:01:56,329 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445373657] [2019-12-27 07:01:56,329 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 07:01:56,330 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:01:56,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 07:01:56,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:01:56,330 INFO L87 Difference]: Start difference. First operand 20897 states and 64463 transitions. Second operand 7 states. [2019-12-27 07:01:57,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:01:57,557 INFO L93 Difference]: Finished difference Result 28486 states and 85230 transitions. [2019-12-27 07:01:57,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 07:01:57,558 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-27 07:01:57,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:01:57,613 INFO L225 Difference]: With dead ends: 28486 [2019-12-27 07:01:57,614 INFO L226 Difference]: Without dead ends: 28486 [2019-12-27 07:01:57,614 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-27 07:01:57,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28486 states. [2019-12-27 07:01:57,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28486 to 19834. [2019-12-27 07:01:57,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19834 states. [2019-12-27 07:01:58,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19834 states to 19834 states and 61281 transitions. [2019-12-27 07:01:58,003 INFO L78 Accepts]: Start accepts. Automaton has 19834 states and 61281 transitions. Word has length 33 [2019-12-27 07:01:58,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:01:58,004 INFO L462 AbstractCegarLoop]: Abstraction has 19834 states and 61281 transitions. [2019-12-27 07:01:58,004 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 07:01:58,004 INFO L276 IsEmpty]: Start isEmpty. Operand 19834 states and 61281 transitions. [2019-12-27 07:01:58,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 07:01:58,032 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:01:58,033 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] [2019-12-27 07:01:58,033 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-27 07:01:58,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:01:58,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1785376658, now seen corresponding path program 1 times [2019-12-27 07:01:58,033 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:01:58,034 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206509111] [2019-12-27 07:01:58,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:01:58,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:01:58,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:01:58,106 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206509111] [2019-12-27 07:01:58,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:01:58,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 07:01:58,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079573630] [2019-12-27 07:01:58,107 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:01:58,108 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:01:58,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:01:58,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:01:58,108 INFO L87 Difference]: Start difference. First operand 19834 states and 61281 transitions. Second operand 5 states. [2019-12-27 07:01:58,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:01:58,841 INFO L93 Difference]: Finished difference Result 28283 states and 86522 transitions. [2019-12-27 07:01:58,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 07:01:58,842 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-12-27 07:01:58,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:01:58,885 INFO L225 Difference]: With dead ends: 28283 [2019-12-27 07:01:58,885 INFO L226 Difference]: Without dead ends: 28283 [2019-12-27 07:01:58,886 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 07:01:58,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28283 states. [2019-12-27 07:01:59,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28283 to 26386. [2019-12-27 07:01:59,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26386 states. [2019-12-27 07:01:59,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26386 states to 26386 states and 81240 transitions. [2019-12-27 07:01:59,562 INFO L78 Accepts]: Start accepts. Automaton has 26386 states and 81240 transitions. Word has length 39 [2019-12-27 07:01:59,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:01:59,562 INFO L462 AbstractCegarLoop]: Abstraction has 26386 states and 81240 transitions. [2019-12-27 07:01:59,562 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:01:59,563 INFO L276 IsEmpty]: Start isEmpty. Operand 26386 states and 81240 transitions. [2019-12-27 07:01:59,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 07:01:59,593 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:01:59,593 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] [2019-12-27 07:01:59,593 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-27 07:01:59,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:01:59,594 INFO L82 PathProgramCache]: Analyzing trace with hash -967157718, now seen corresponding path program 2 times [2019-12-27 07:01:59,594 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:01:59,594 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656404323] [2019-12-27 07:01:59,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:01:59,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:01:59,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:01:59,680 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656404323] [2019-12-27 07:01:59,680 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:01:59,681 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:01:59,681 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385539536] [2019-12-27 07:01:59,681 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:01:59,681 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:01:59,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:01:59,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:01:59,682 INFO L87 Difference]: Start difference. First operand 26386 states and 81240 transitions. Second operand 3 states. [2019-12-27 07:01:59,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:01:59,813 INFO L93 Difference]: Finished difference Result 26386 states and 81161 transitions. [2019-12-27 07:01:59,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:01:59,813 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 07:01:59,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:01:59,874 INFO L225 Difference]: With dead ends: 26386 [2019-12-27 07:01:59,874 INFO L226 Difference]: Without dead ends: 26386 [2019-12-27 07:01:59,874 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:02:00,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26386 states. [2019-12-27 07:02:00,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26386 to 22631. [2019-12-27 07:02:00,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22631 states. [2019-12-27 07:02:00,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22631 states to 22631 states and 70743 transitions. [2019-12-27 07:02:00,354 INFO L78 Accepts]: Start accepts. Automaton has 22631 states and 70743 transitions. Word has length 39 [2019-12-27 07:02:00,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:02:00,354 INFO L462 AbstractCegarLoop]: Abstraction has 22631 states and 70743 transitions. [2019-12-27 07:02:00,354 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:02:00,354 INFO L276 IsEmpty]: Start isEmpty. Operand 22631 states and 70743 transitions. [2019-12-27 07:02:00,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 07:02:00,377 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:02:00,377 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] [2019-12-27 07:02:00,378 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-27 07:02:00,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:02:00,378 INFO L82 PathProgramCache]: Analyzing trace with hash -1172451276, now seen corresponding path program 1 times [2019-12-27 07:02:00,378 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:02:00,379 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147555307] [2019-12-27 07:02:00,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:02:00,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:02:00,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:02:00,450 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147555307] [2019-12-27 07:02:00,450 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:02:00,451 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 07:02:00,451 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371708597] [2019-12-27 07:02:00,451 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:02:00,451 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:02:00,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:02:00,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:02:00,452 INFO L87 Difference]: Start difference. First operand 22631 states and 70743 transitions. Second operand 5 states. [2019-12-27 07:02:00,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:02:00,578 INFO L93 Difference]: Finished difference Result 21311 states and 67738 transitions. [2019-12-27 07:02:00,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:02:00,579 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-27 07:02:00,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:02:00,621 INFO L225 Difference]: With dead ends: 21311 [2019-12-27 07:02:00,622 INFO L226 Difference]: Without dead ends: 21311 [2019-12-27 07:02:00,622 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-27 07:02:00,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21311 states. [2019-12-27 07:02:00,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21311 to 21311. [2019-12-27 07:02:00,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21311 states. [2019-12-27 07:02:01,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21311 states to 21311 states and 67738 transitions. [2019-12-27 07:02:01,001 INFO L78 Accepts]: Start accepts. Automaton has 21311 states and 67738 transitions. Word has length 40 [2019-12-27 07:02:01,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:02:01,002 INFO L462 AbstractCegarLoop]: Abstraction has 21311 states and 67738 transitions. [2019-12-27 07:02:01,002 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:02:01,002 INFO L276 IsEmpty]: Start isEmpty. Operand 21311 states and 67738 transitions. [2019-12-27 07:02:01,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 07:02:01,033 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:02:01,033 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-27 07:02:01,034 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-27 07:02:01,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:02:01,034 INFO L82 PathProgramCache]: Analyzing trace with hash 236633210, now seen corresponding path program 1 times [2019-12-27 07:02:01,034 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:02:01,035 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020447792] [2019-12-27 07:02:01,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:02:01,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:02:01,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:02:01,137 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020447792] [2019-12-27 07:02:01,137 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:02:01,137 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 07:02:01,138 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601992803] [2019-12-27 07:02:01,138 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 07:02:01,138 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:02:01,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 07:02:01,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:02:01,139 INFO L87 Difference]: Start difference. First operand 21311 states and 67738 transitions. Second operand 7 states. [2019-12-27 07:02:01,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:02:01,664 INFO L93 Difference]: Finished difference Result 58693 states and 186497 transitions. [2019-12-27 07:02:01,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 07:02:01,665 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-27 07:02:01,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:02:01,738 INFO L225 Difference]: With dead ends: 58693 [2019-12-27 07:02:01,738 INFO L226 Difference]: Without dead ends: 45552 [2019-12-27 07:02:01,739 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-12-27 07:02:01,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45552 states. [2019-12-27 07:02:02,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45552 to 24967. [2019-12-27 07:02:02,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24967 states. [2019-12-27 07:02:02,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24967 states to 24967 states and 79925 transitions. [2019-12-27 07:02:02,539 INFO L78 Accepts]: Start accepts. Automaton has 24967 states and 79925 transitions. Word has length 65 [2019-12-27 07:02:02,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:02:02,539 INFO L462 AbstractCegarLoop]: Abstraction has 24967 states and 79925 transitions. [2019-12-27 07:02:02,539 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 07:02:02,540 INFO L276 IsEmpty]: Start isEmpty. Operand 24967 states and 79925 transitions. [2019-12-27 07:02:02,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 07:02:02,580 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:02:02,581 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-27 07:02:02,581 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-27 07:02:02,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:02:02,581 INFO L82 PathProgramCache]: Analyzing trace with hash 896785052, now seen corresponding path program 2 times [2019-12-27 07:02:02,582 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:02:02,582 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798085467] [2019-12-27 07:02:02,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:02:02,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:02:02,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:02:02,715 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798085467] [2019-12-27 07:02:02,716 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:02:02,716 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 07:02:02,716 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000782773] [2019-12-27 07:02:02,717 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 07:02:02,717 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:02:02,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 07:02:02,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:02:02,718 INFO L87 Difference]: Start difference. First operand 24967 states and 79925 transitions. Second operand 7 states. [2019-12-27 07:02:03,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:02:03,282 INFO L93 Difference]: Finished difference Result 66722 states and 210684 transitions. [2019-12-27 07:02:03,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 07:02:03,283 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-27 07:02:03,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:02:03,393 INFO L225 Difference]: With dead ends: 66722 [2019-12-27 07:02:03,394 INFO L226 Difference]: Without dead ends: 47701 [2019-12-27 07:02:03,394 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-27 07:02:03,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47701 states. [2019-12-27 07:02:04,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47701 to 29639. [2019-12-27 07:02:04,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29639 states. [2019-12-27 07:02:04,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29639 states to 29639 states and 94665 transitions. [2019-12-27 07:02:04,116 INFO L78 Accepts]: Start accepts. Automaton has 29639 states and 94665 transitions. Word has length 65 [2019-12-27 07:02:04,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:02:04,117 INFO L462 AbstractCegarLoop]: Abstraction has 29639 states and 94665 transitions. [2019-12-27 07:02:04,117 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 07:02:04,117 INFO L276 IsEmpty]: Start isEmpty. Operand 29639 states and 94665 transitions. [2019-12-27 07:02:04,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 07:02:04,151 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:02:04,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] [2019-12-27 07:02:04,151 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-27 07:02:04,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:02:04,151 INFO L82 PathProgramCache]: Analyzing trace with hash -1620990666, now seen corresponding path program 3 times [2019-12-27 07:02:04,151 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:02:04,151 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030831648] [2019-12-27 07:02:04,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:02:04,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:02:04,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:02:04,246 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030831648] [2019-12-27 07:02:04,246 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:02:04,246 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 07:02:04,247 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939557674] [2019-12-27 07:02:04,247 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 07:02:04,247 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:02:04,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 07:02:04,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:02:04,248 INFO L87 Difference]: Start difference. First operand 29639 states and 94665 transitions. Second operand 7 states. [2019-12-27 07:02:04,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:02:04,689 INFO L93 Difference]: Finished difference Result 58438 states and 184588 transitions. [2019-12-27 07:02:04,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 07:02:04,689 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-27 07:02:04,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:02:04,783 INFO L225 Difference]: With dead ends: 58438 [2019-12-27 07:02:04,784 INFO L226 Difference]: Without dead ends: 51671 [2019-12-27 07:02:04,784 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-27 07:02:04,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51671 states. [2019-12-27 07:02:05,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51671 to 29947. [2019-12-27 07:02:05,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29947 states. [2019-12-27 07:02:05,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29947 states to 29947 states and 95616 transitions. [2019-12-27 07:02:05,671 INFO L78 Accepts]: Start accepts. Automaton has 29947 states and 95616 transitions. Word has length 65 [2019-12-27 07:02:05,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:02:05,672 INFO L462 AbstractCegarLoop]: Abstraction has 29947 states and 95616 transitions. [2019-12-27 07:02:05,672 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 07:02:05,672 INFO L276 IsEmpty]: Start isEmpty. Operand 29947 states and 95616 transitions. [2019-12-27 07:02:05,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 07:02:05,707 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:02:05,707 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-27 07:02:05,708 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-27 07:02:05,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:02:05,708 INFO L82 PathProgramCache]: Analyzing trace with hash 691532486, now seen corresponding path program 4 times [2019-12-27 07:02:05,708 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:02:05,708 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714529519] [2019-12-27 07:02:05,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:02:05,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:02:05,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:02:05,770 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714529519] [2019-12-27 07:02:05,770 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:02:05,770 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:02:05,770 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847908682] [2019-12-27 07:02:05,770 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:02:05,771 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:02:05,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:02:05,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:02:05,771 INFO L87 Difference]: Start difference. First operand 29947 states and 95616 transitions. Second operand 3 states. [2019-12-27 07:02:05,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:02:05,972 INFO L93 Difference]: Finished difference Result 34953 states and 110763 transitions. [2019-12-27 07:02:05,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:02:05,973 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 07:02:05,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:02:06,025 INFO L225 Difference]: With dead ends: 34953 [2019-12-27 07:02:06,025 INFO L226 Difference]: Without dead ends: 34953 [2019-12-27 07:02:06,025 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:02:06,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34953 states. [2019-12-27 07:02:06,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34953 to 30783. [2019-12-27 07:02:06,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30783 states. [2019-12-27 07:02:06,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30783 states to 30783 states and 98542 transitions. [2019-12-27 07:02:06,567 INFO L78 Accepts]: Start accepts. Automaton has 30783 states and 98542 transitions. Word has length 65 [2019-12-27 07:02:06,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:02:06,568 INFO L462 AbstractCegarLoop]: Abstraction has 30783 states and 98542 transitions. [2019-12-27 07:02:06,568 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:02:06,568 INFO L276 IsEmpty]: Start isEmpty. Operand 30783 states and 98542 transitions. [2019-12-27 07:02:06,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 07:02:06,606 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:02:06,606 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-27 07:02:06,606 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-27 07:02:06,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:02:06,606 INFO L82 PathProgramCache]: Analyzing trace with hash 868435461, now seen corresponding path program 1 times [2019-12-27 07:02:06,606 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:02:06,607 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020673100] [2019-12-27 07:02:06,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:02:06,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:02:06,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:02:06,659 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020673100] [2019-12-27 07:02:06,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:02:06,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 07:02:06,660 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817975955] [2019-12-27 07:02:06,660 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:02:06,661 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:02:06,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:02:06,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:02:06,661 INFO L87 Difference]: Start difference. First operand 30783 states and 98542 transitions. Second operand 4 states. [2019-12-27 07:02:07,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:02:07,258 INFO L93 Difference]: Finished difference Result 47971 states and 153431 transitions. [2019-12-27 07:02:07,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:02:07,259 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-27 07:02:07,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:02:07,392 INFO L225 Difference]: With dead ends: 47971 [2019-12-27 07:02:07,393 INFO L226 Difference]: Without dead ends: 47971 [2019-12-27 07:02:07,393 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:02:07,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47971 states. [2019-12-27 07:02:08,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47971 to 34031. [2019-12-27 07:02:08,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34031 states. [2019-12-27 07:02:08,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34031 states to 34031 states and 110032 transitions. [2019-12-27 07:02:08,641 INFO L78 Accepts]: Start accepts. Automaton has 34031 states and 110032 transitions. Word has length 66 [2019-12-27 07:02:08,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:02:08,641 INFO L462 AbstractCegarLoop]: Abstraction has 34031 states and 110032 transitions. [2019-12-27 07:02:08,641 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:02:08,641 INFO L276 IsEmpty]: Start isEmpty. Operand 34031 states and 110032 transitions. [2019-12-27 07:02:08,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 07:02:08,683 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:02:08,683 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-27 07:02:08,683 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-27 07:02:08,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:02:08,684 INFO L82 PathProgramCache]: Analyzing trace with hash -909174781, now seen corresponding path program 2 times [2019-12-27 07:02:08,684 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:02:08,684 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108765332] [2019-12-27 07:02:08,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:02:08,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:02:08,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:02:08,737 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108765332] [2019-12-27 07:02:08,737 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:02:08,737 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:02:08,737 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728984290] [2019-12-27 07:02:08,737 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:02:08,738 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:02:08,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:02:08,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:02:08,738 INFO L87 Difference]: Start difference. First operand 34031 states and 110032 transitions. Second operand 3 states. [2019-12-27 07:02:09,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:02:09,076 INFO L93 Difference]: Finished difference Result 47990 states and 153962 transitions. [2019-12-27 07:02:09,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:02:09,077 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 07:02:09,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:02:09,154 INFO L225 Difference]: With dead ends: 47990 [2019-12-27 07:02:09,154 INFO L226 Difference]: Without dead ends: 47990 [2019-12-27 07:02:09,154 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:02:09,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47990 states. [2019-12-27 07:02:09,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47990 to 34147. [2019-12-27 07:02:09,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34147 states. [2019-12-27 07:02:09,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34147 states to 34147 states and 110505 transitions. [2019-12-27 07:02:09,827 INFO L78 Accepts]: Start accepts. Automaton has 34147 states and 110505 transitions. Word has length 66 [2019-12-27 07:02:09,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:02:09,827 INFO L462 AbstractCegarLoop]: Abstraction has 34147 states and 110505 transitions. [2019-12-27 07:02:09,827 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:02:09,827 INFO L276 IsEmpty]: Start isEmpty. Operand 34147 states and 110505 transitions. [2019-12-27 07:02:09,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 07:02:09,881 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:02:09,881 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-27 07:02:09,881 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:02:09,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:02:09,882 INFO L82 PathProgramCache]: Analyzing trace with hash -362141183, now seen corresponding path program 3 times [2019-12-27 07:02:09,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:02:09,882 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408897678] [2019-12-27 07:02:09,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:02:09,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:02:09,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:02:09,940 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408897678] [2019-12-27 07:02:09,940 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:02:09,940 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 07:02:09,940 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635884473] [2019-12-27 07:02:09,941 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:02:09,941 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:02:09,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:02:09,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:02:09,941 INFO L87 Difference]: Start difference. First operand 34147 states and 110505 transitions. Second operand 4 states. [2019-12-27 07:02:10,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:02:10,322 INFO L93 Difference]: Finished difference Result 40549 states and 129720 transitions. [2019-12-27 07:02:10,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 07:02:10,323 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-27 07:02:10,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:02:10,420 INFO L225 Difference]: With dead ends: 40549 [2019-12-27 07:02:10,420 INFO L226 Difference]: Without dead ends: 40549 [2019-12-27 07:02:10,420 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:02:10,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40549 states. [2019-12-27 07:02:11,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40549 to 34063. [2019-12-27 07:02:11,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34063 states. [2019-12-27 07:02:11,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34063 states to 34063 states and 110238 transitions. [2019-12-27 07:02:11,524 INFO L78 Accepts]: Start accepts. Automaton has 34063 states and 110238 transitions. Word has length 66 [2019-12-27 07:02:11,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:02:11,524 INFO L462 AbstractCegarLoop]: Abstraction has 34063 states and 110238 transitions. [2019-12-27 07:02:11,524 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:02:11,524 INFO L276 IsEmpty]: Start isEmpty. Operand 34063 states and 110238 transitions. [2019-12-27 07:02:11,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 07:02:11,564 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:02:11,565 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-27 07:02:11,565 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:02:11,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:02:11,565 INFO L82 PathProgramCache]: Analyzing trace with hash -909555473, now seen corresponding path program 4 times [2019-12-27 07:02:11,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:02:11,565 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548886382] [2019-12-27 07:02:11,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:02:11,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:02:11,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:02:11,652 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548886382] [2019-12-27 07:02:11,652 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:02:11,653 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 07:02:11,653 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079185509] [2019-12-27 07:02:11,653 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 07:02:11,654 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:02:11,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 07:02:11,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:02:11,654 INFO L87 Difference]: Start difference. First operand 34063 states and 110238 transitions. Second operand 7 states. [2019-12-27 07:02:12,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:02:12,357 INFO L93 Difference]: Finished difference Result 70631 states and 224909 transitions. [2019-12-27 07:02:12,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 07:02:12,358 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-27 07:02:12,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:02:12,469 INFO L225 Difference]: With dead ends: 70631 [2019-12-27 07:02:12,469 INFO L226 Difference]: Without dead ends: 65098 [2019-12-27 07:02:12,469 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-27 07:02:12,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65098 states. [2019-12-27 07:02:13,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65098 to 34127. [2019-12-27 07:02:13,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34127 states. [2019-12-27 07:02:13,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34127 states to 34127 states and 110456 transitions. [2019-12-27 07:02:13,237 INFO L78 Accepts]: Start accepts. Automaton has 34127 states and 110456 transitions. Word has length 66 [2019-12-27 07:02:13,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:02:13,238 INFO L462 AbstractCegarLoop]: Abstraction has 34127 states and 110456 transitions. [2019-12-27 07:02:13,238 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 07:02:13,238 INFO L276 IsEmpty]: Start isEmpty. Operand 34127 states and 110456 transitions. [2019-12-27 07:02:13,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 07:02:13,276 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:02:13,276 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-27 07:02:13,276 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:02:13,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:02:13,276 INFO L82 PathProgramCache]: Analyzing trace with hash 862222067, now seen corresponding path program 5 times [2019-12-27 07:02:13,276 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:02:13,277 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774477499] [2019-12-27 07:02:13,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:02:13,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:02:13,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:02:13,380 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774477499] [2019-12-27 07:02:13,381 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:02:13,381 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 07:02:13,381 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510821410] [2019-12-27 07:02:13,382 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 07:02:13,382 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:02:13,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 07:02:13,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 07:02:13,382 INFO L87 Difference]: Start difference. First operand 34127 states and 110456 transitions. Second operand 6 states. [2019-12-27 07:02:14,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:02:14,053 INFO L93 Difference]: Finished difference Result 53911 states and 174205 transitions. [2019-12-27 07:02:14,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 07:02:14,054 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-12-27 07:02:14,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:02:14,146 INFO L225 Difference]: With dead ends: 53911 [2019-12-27 07:02:14,147 INFO L226 Difference]: Without dead ends: 53911 [2019-12-27 07:02:14,147 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-12-27 07:02:14,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53911 states. [2019-12-27 07:02:15,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53911 to 35149. [2019-12-27 07:02:15,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35149 states. [2019-12-27 07:02:15,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35149 states to 35149 states and 113605 transitions. [2019-12-27 07:02:15,211 INFO L78 Accepts]: Start accepts. Automaton has 35149 states and 113605 transitions. Word has length 66 [2019-12-27 07:02:15,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:02:15,211 INFO L462 AbstractCegarLoop]: Abstraction has 35149 states and 113605 transitions. [2019-12-27 07:02:15,211 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 07:02:15,211 INFO L276 IsEmpty]: Start isEmpty. Operand 35149 states and 113605 transitions. [2019-12-27 07:02:15,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 07:02:15,251 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:02:15,251 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-27 07:02:15,251 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:02:15,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:02:15,252 INFO L82 PathProgramCache]: Analyzing trace with hash 605319499, now seen corresponding path program 6 times [2019-12-27 07:02:15,252 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:02:15,252 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680811629] [2019-12-27 07:02:15,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:02:15,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:02:15,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:02:15,320 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680811629] [2019-12-27 07:02:15,321 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:02:15,321 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:02:15,321 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708542568] [2019-12-27 07:02:15,321 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:02:15,321 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:02:15,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:02:15,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:02:15,324 INFO L87 Difference]: Start difference. First operand 35149 states and 113605 transitions. Second operand 4 states. [2019-12-27 07:02:15,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:02:15,580 INFO L93 Difference]: Finished difference Result 41357 states and 133048 transitions. [2019-12-27 07:02:15,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 07:02:15,580 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-27 07:02:15,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:02:15,677 INFO L225 Difference]: With dead ends: 41357 [2019-12-27 07:02:15,677 INFO L226 Difference]: Without dead ends: 41357 [2019-12-27 07:02:15,678 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:02:15,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41357 states. [2019-12-27 07:02:16,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41357 to 31976. [2019-12-27 07:02:16,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31976 states. [2019-12-27 07:02:16,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31976 states to 31976 states and 102860 transitions. [2019-12-27 07:02:16,351 INFO L78 Accepts]: Start accepts. Automaton has 31976 states and 102860 transitions. Word has length 66 [2019-12-27 07:02:16,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:02:16,351 INFO L462 AbstractCegarLoop]: Abstraction has 31976 states and 102860 transitions. [2019-12-27 07:02:16,351 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:02:16,351 INFO L276 IsEmpty]: Start isEmpty. Operand 31976 states and 102860 transitions. [2019-12-27 07:02:16,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 07:02:16,391 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:02:16,391 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-27 07:02:16,391 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:02:16,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:02:16,392 INFO L82 PathProgramCache]: Analyzing trace with hash 747197170, now seen corresponding path program 1 times [2019-12-27 07:02:16,392 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:02:16,392 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657978287] [2019-12-27 07:02:16,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:02:16,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:02:16,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:02:16,447 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657978287] [2019-12-27 07:02:16,448 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:02:16,448 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:02:16,448 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676229348] [2019-12-27 07:02:16,448 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:02:16,448 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:02:16,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:02:16,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:02:16,450 INFO L87 Difference]: Start difference. First operand 31976 states and 102860 transitions. Second operand 3 states. [2019-12-27 07:02:16,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:02:16,563 INFO L93 Difference]: Finished difference Result 26693 states and 84212 transitions. [2019-12-27 07:02:16,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:02:16,564 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 07:02:16,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:02:16,602 INFO L225 Difference]: With dead ends: 26693 [2019-12-27 07:02:16,602 INFO L226 Difference]: Without dead ends: 26693 [2019-12-27 07:02:16,602 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:02:16,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26693 states. [2019-12-27 07:02:16,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26693 to 24273. [2019-12-27 07:02:16,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24273 states. [2019-12-27 07:02:16,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24273 states to 24273 states and 76412 transitions. [2019-12-27 07:02:16,980 INFO L78 Accepts]: Start accepts. Automaton has 24273 states and 76412 transitions. Word has length 66 [2019-12-27 07:02:16,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:02:16,980 INFO L462 AbstractCegarLoop]: Abstraction has 24273 states and 76412 transitions. [2019-12-27 07:02:16,980 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:02:16,980 INFO L276 IsEmpty]: Start isEmpty. Operand 24273 states and 76412 transitions. [2019-12-27 07:02:17,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 07:02:17,007 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:02:17,007 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-27 07:02:17,007 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:02:17,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:02:17,007 INFO L82 PathProgramCache]: Analyzing trace with hash 863231349, now seen corresponding path program 1 times [2019-12-27 07:02:17,007 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:02:17,007 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348602137] [2019-12-27 07:02:17,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:02:17,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:02:17,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:02:17,170 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348602137] [2019-12-27 07:02:17,170 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:02:17,170 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 07:02:17,170 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746765984] [2019-12-27 07:02:17,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 07:02:17,172 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:02:17,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 07:02:17,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-27 07:02:17,173 INFO L87 Difference]: Start difference. First operand 24273 states and 76412 transitions. Second operand 10 states. [2019-12-27 07:02:18,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:02:18,587 INFO L93 Difference]: Finished difference Result 35523 states and 111659 transitions. [2019-12-27 07:02:18,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 07:02:18,587 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-27 07:02:18,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:02:18,632 INFO L225 Difference]: With dead ends: 35523 [2019-12-27 07:02:18,632 INFO L226 Difference]: Without dead ends: 28791 [2019-12-27 07:02:18,633 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2019-12-27 07:02:18,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28791 states. [2019-12-27 07:02:19,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28791 to 24621. [2019-12-27 07:02:19,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24621 states. [2019-12-27 07:02:19,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24621 states to 24621 states and 77383 transitions. [2019-12-27 07:02:19,190 INFO L78 Accepts]: Start accepts. Automaton has 24621 states and 77383 transitions. Word has length 67 [2019-12-27 07:02:19,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:02:19,191 INFO L462 AbstractCegarLoop]: Abstraction has 24621 states and 77383 transitions. [2019-12-27 07:02:19,191 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 07:02:19,191 INFO L276 IsEmpty]: Start isEmpty. Operand 24621 states and 77383 transitions. [2019-12-27 07:02:19,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 07:02:19,216 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:02:19,216 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-27 07:02:19,216 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:02:19,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:02:19,216 INFO L82 PathProgramCache]: Analyzing trace with hash -783490325, now seen corresponding path program 2 times [2019-12-27 07:02:19,216 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:02:19,217 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183843307] [2019-12-27 07:02:19,217 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:02:19,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:02:19,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:02:19,395 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183843307] [2019-12-27 07:02:19,395 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:02:19,395 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 07:02:19,396 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072095714] [2019-12-27 07:02:19,396 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 07:02:19,396 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:02:19,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 07:02:19,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-27 07:02:19,397 INFO L87 Difference]: Start difference. First operand 24621 states and 77383 transitions. Second operand 10 states. [2019-12-27 07:02:20,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:02:20,649 INFO L93 Difference]: Finished difference Result 36137 states and 112823 transitions. [2019-12-27 07:02:20,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 07:02:20,649 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-27 07:02:20,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:02:20,694 INFO L225 Difference]: With dead ends: 36137 [2019-12-27 07:02:20,694 INFO L226 Difference]: Without dead ends: 30919 [2019-12-27 07:02:20,694 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2019-12-27 07:02:20,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30919 states. [2019-12-27 07:02:21,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30919 to 25169. [2019-12-27 07:02:21,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25169 states. [2019-12-27 07:02:21,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25169 states to 25169 states and 78786 transitions. [2019-12-27 07:02:21,137 INFO L78 Accepts]: Start accepts. Automaton has 25169 states and 78786 transitions. Word has length 67 [2019-12-27 07:02:21,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:02:21,137 INFO L462 AbstractCegarLoop]: Abstraction has 25169 states and 78786 transitions. [2019-12-27 07:02:21,137 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 07:02:21,137 INFO L276 IsEmpty]: Start isEmpty. Operand 25169 states and 78786 transitions. [2019-12-27 07:02:21,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 07:02:21,165 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:02:21,165 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-27 07:02:21,165 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:02:21,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:02:21,165 INFO L82 PathProgramCache]: Analyzing trace with hash 17868619, now seen corresponding path program 3 times [2019-12-27 07:02:21,165 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:02:21,165 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795971101] [2019-12-27 07:02:21,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:02:21,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:02:21,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:02:21,322 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795971101] [2019-12-27 07:02:21,323 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:02:21,323 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 07:02:21,323 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156344068] [2019-12-27 07:02:21,323 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 07:02:21,323 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:02:21,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 07:02:21,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 07:02:21,324 INFO L87 Difference]: Start difference. First operand 25169 states and 78786 transitions. Second operand 11 states. [2019-12-27 07:02:22,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:02:22,623 INFO L93 Difference]: Finished difference Result 34459 states and 107407 transitions. [2019-12-27 07:02:22,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 07:02:22,623 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-27 07:02:22,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:02:22,669 INFO L225 Difference]: With dead ends: 34459 [2019-12-27 07:02:22,669 INFO L226 Difference]: Without dead ends: 30448 [2019-12-27 07:02:22,670 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2019-12-27 07:02:22,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30448 states. [2019-12-27 07:02:23,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30448 to 24805. [2019-12-27 07:02:23,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24805 states. [2019-12-27 07:02:23,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24805 states to 24805 states and 77645 transitions. [2019-12-27 07:02:23,086 INFO L78 Accepts]: Start accepts. Automaton has 24805 states and 77645 transitions. Word has length 67 [2019-12-27 07:02:23,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:02:23,086 INFO L462 AbstractCegarLoop]: Abstraction has 24805 states and 77645 transitions. [2019-12-27 07:02:23,086 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 07:02:23,087 INFO L276 IsEmpty]: Start isEmpty. Operand 24805 states and 77645 transitions. [2019-12-27 07:02:23,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 07:02:23,116 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:02:23,116 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-27 07:02:23,116 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:02:23,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:02:23,116 INFO L82 PathProgramCache]: Analyzing trace with hash 455548979, now seen corresponding path program 4 times [2019-12-27 07:02:23,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:02:23,116 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912127945] [2019-12-27 07:02:23,117 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:02:23,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:02:23,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:02:23,299 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912127945] [2019-12-27 07:02:23,299 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:02:23,299 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 07:02:23,300 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411794230] [2019-12-27 07:02:23,300 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 07:02:23,300 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:02:23,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 07:02:23,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 07:02:23,301 INFO L87 Difference]: Start difference. First operand 24805 states and 77645 transitions. Second operand 11 states. [2019-12-27 07:02:25,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:02:25,157 INFO L93 Difference]: Finished difference Result 50603 states and 158867 transitions. [2019-12-27 07:02:25,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-27 07:02:25,158 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-27 07:02:25,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:02:25,244 INFO L225 Difference]: With dead ends: 50603 [2019-12-27 07:02:25,244 INFO L226 Difference]: Without dead ends: 48055 [2019-12-27 07:02:25,244 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=190, Invalid=802, Unknown=0, NotChecked=0, Total=992 [2019-12-27 07:02:25,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48055 states. [2019-12-27 07:02:25,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48055 to 28332. [2019-12-27 07:02:25,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28332 states. [2019-12-27 07:02:25,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28332 states to 28332 states and 88818 transitions. [2019-12-27 07:02:25,848 INFO L78 Accepts]: Start accepts. Automaton has 28332 states and 88818 transitions. Word has length 67 [2019-12-27 07:02:25,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:02:25,848 INFO L462 AbstractCegarLoop]: Abstraction has 28332 states and 88818 transitions. [2019-12-27 07:02:25,848 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 07:02:25,848 INFO L276 IsEmpty]: Start isEmpty. Operand 28332 states and 88818 transitions. [2019-12-27 07:02:25,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 07:02:25,880 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:02:25,881 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-27 07:02:25,881 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:02:25,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:02:25,881 INFO L82 PathProgramCache]: Analyzing trace with hash -1142961965, now seen corresponding path program 5 times [2019-12-27 07:02:25,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:02:25,881 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545934050] [2019-12-27 07:02:25,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:02:25,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:02:26,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:02:26,062 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545934050] [2019-12-27 07:02:26,062 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:02:26,063 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 07:02:26,063 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676384428] [2019-12-27 07:02:26,063 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 07:02:26,063 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:02:26,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 07:02:26,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 07:02:26,064 INFO L87 Difference]: Start difference. First operand 28332 states and 88818 transitions. Second operand 11 states. [2019-12-27 07:02:27,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:02:27,509 INFO L93 Difference]: Finished difference Result 37041 states and 116133 transitions. [2019-12-27 07:02:27,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 07:02:27,510 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-27 07:02:27,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:02:27,563 INFO L225 Difference]: With dead ends: 37041 [2019-12-27 07:02:27,564 INFO L226 Difference]: Without dead ends: 34378 [2019-12-27 07:02:27,564 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2019-12-27 07:02:27,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34378 states. [2019-12-27 07:02:28,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34378 to 28694. [2019-12-27 07:02:28,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28694 states. [2019-12-27 07:02:28,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28694 states to 28694 states and 89867 transitions. [2019-12-27 07:02:28,057 INFO L78 Accepts]: Start accepts. Automaton has 28694 states and 89867 transitions. Word has length 67 [2019-12-27 07:02:28,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:02:28,057 INFO L462 AbstractCegarLoop]: Abstraction has 28694 states and 89867 transitions. [2019-12-27 07:02:28,057 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 07:02:28,057 INFO L276 IsEmpty]: Start isEmpty. Operand 28694 states and 89867 transitions. [2019-12-27 07:02:28,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 07:02:28,092 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:02:28,092 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-27 07:02:28,093 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:02:28,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:02:28,093 INFO L82 PathProgramCache]: Analyzing trace with hash 1218502995, now seen corresponding path program 6 times [2019-12-27 07:02:28,093 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:02:28,093 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751895046] [2019-12-27 07:02:28,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:02:28,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:02:28,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:02:28,261 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751895046] [2019-12-27 07:02:28,261 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:02:28,261 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 07:02:28,262 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485111148] [2019-12-27 07:02:28,262 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 07:02:28,262 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:02:28,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 07:02:28,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-27 07:02:28,263 INFO L87 Difference]: Start difference. First operand 28694 states and 89867 transitions. Second operand 12 states. [2019-12-27 07:02:30,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:02:30,121 INFO L93 Difference]: Finished difference Result 36496 states and 113993 transitions. [2019-12-27 07:02:30,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 07:02:30,121 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-27 07:02:30,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:02:30,174 INFO L225 Difference]: With dead ends: 36496 [2019-12-27 07:02:30,174 INFO L226 Difference]: Without dead ends: 35570 [2019-12-27 07:02:30,174 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2019-12-27 07:02:30,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35570 states. [2019-12-27 07:02:30,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35570 to 28602. [2019-12-27 07:02:30,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28602 states. [2019-12-27 07:02:30,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28602 states to 28602 states and 89561 transitions. [2019-12-27 07:02:30,669 INFO L78 Accepts]: Start accepts. Automaton has 28602 states and 89561 transitions. Word has length 67 [2019-12-27 07:02:30,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:02:30,669 INFO L462 AbstractCegarLoop]: Abstraction has 28602 states and 89561 transitions. [2019-12-27 07:02:30,669 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 07:02:30,669 INFO L276 IsEmpty]: Start isEmpty. Operand 28602 states and 89561 transitions. [2019-12-27 07:02:30,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 07:02:30,701 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:02:30,701 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-27 07:02:30,702 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:02:30,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:02:30,702 INFO L82 PathProgramCache]: Analyzing trace with hash 1272640249, now seen corresponding path program 7 times [2019-12-27 07:02:30,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:02:30,702 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166592916] [2019-12-27 07:02:30,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:02:30,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:02:30,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:02:30,859 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166592916] [2019-12-27 07:02:30,862 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:02:30,862 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 07:02:30,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768759156] [2019-12-27 07:02:30,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 07:02:30,862 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:02:30,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 07:02:30,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 07:02:30,863 INFO L87 Difference]: Start difference. First operand 28602 states and 89561 transitions. Second operand 11 states. [2019-12-27 07:02:32,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:02:32,031 INFO L93 Difference]: Finished difference Result 49063 states and 153070 transitions. [2019-12-27 07:02:32,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 07:02:32,031 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-27 07:02:32,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:02:32,088 INFO L225 Difference]: With dead ends: 49063 [2019-12-27 07:02:32,088 INFO L226 Difference]: Without dead ends: 40243 [2019-12-27 07:02:32,089 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=141, Invalid=509, Unknown=0, NotChecked=0, Total=650 [2019-12-27 07:02:32,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40243 states. [2019-12-27 07:02:32,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40243 to 23379. [2019-12-27 07:02:32,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23379 states. [2019-12-27 07:02:32,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23379 states to 23379 states and 72980 transitions. [2019-12-27 07:02:32,584 INFO L78 Accepts]: Start accepts. Automaton has 23379 states and 72980 transitions. Word has length 67 [2019-12-27 07:02:32,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:02:32,584 INFO L462 AbstractCegarLoop]: Abstraction has 23379 states and 72980 transitions. [2019-12-27 07:02:32,584 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 07:02:32,584 INFO L276 IsEmpty]: Start isEmpty. Operand 23379 states and 72980 transitions. [2019-12-27 07:02:32,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 07:02:32,612 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:02:32,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, 1, 1] [2019-12-27 07:02:32,612 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:02:32,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:02:32,612 INFO L82 PathProgramCache]: Analyzing trace with hash -1730024245, now seen corresponding path program 8 times [2019-12-27 07:02:32,613 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:02:32,613 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415611891] [2019-12-27 07:02:32,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:02:32,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:02:32,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:02:32,811 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415611891] [2019-12-27 07:02:32,811 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:02:32,811 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 07:02:32,811 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982607229] [2019-12-27 07:02:32,811 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 07:02:32,811 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:02:32,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 07:02:32,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-27 07:02:32,812 INFO L87 Difference]: Start difference. First operand 23379 states and 72980 transitions. Second operand 12 states. [2019-12-27 07:02:33,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:02:33,923 INFO L93 Difference]: Finished difference Result 40285 states and 125634 transitions. [2019-12-27 07:02:33,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 07:02:33,923 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-27 07:02:33,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:02:33,980 INFO L225 Difference]: With dead ends: 40285 [2019-12-27 07:02:33,981 INFO L226 Difference]: Without dead ends: 40042 [2019-12-27 07:02:33,981 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2019-12-27 07:02:34,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40042 states. [2019-12-27 07:02:34,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40042 to 23203. [2019-12-27 07:02:34,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23203 states. [2019-12-27 07:02:34,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23203 states to 23203 states and 72508 transitions. [2019-12-27 07:02:34,695 INFO L78 Accepts]: Start accepts. Automaton has 23203 states and 72508 transitions. Word has length 67 [2019-12-27 07:02:34,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:02:34,696 INFO L462 AbstractCegarLoop]: Abstraction has 23203 states and 72508 transitions. [2019-12-27 07:02:34,696 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 07:02:34,696 INFO L276 IsEmpty]: Start isEmpty. Operand 23203 states and 72508 transitions. [2019-12-27 07:02:34,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 07:02:34,719 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:02:34,719 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-27 07:02:34,719 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:02:34,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:02:34,720 INFO L82 PathProgramCache]: Analyzing trace with hash 1929562173, now seen corresponding path program 9 times [2019-12-27 07:02:34,720 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:02:34,720 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359396925] [2019-12-27 07:02:34,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:02:34,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 07:02:34,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 07:02:34,838 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 07:02:34,838 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 07:02:34,842 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [891] [891] ULTIMATE.startENTRY-->L822: Formula: (let ((.cse0 (store |v_#valid_61| 0 0))) (and (= v_~main$tmp_guard1~0_17 0) (= v_~main$tmp_guard0~0_10 0) (= |v_ULTIMATE.start_main_~#t1573~0.offset_16| 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1573~0.base_21|) 0) (= 0 v_~z$r_buff1_thd0~0_24) (= v_~z$r_buff0_thd3~0_78 0) (= 0 v_~__unbuffered_p1_EAX~0_14) (= v_~z$w_buff0_used~0_113 0) (= |v_#memory_int_17| (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1573~0.base_21| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1573~0.base_21|) |v_ULTIMATE.start_main_~#t1573~0.offset_16| 0))) (= v_~z$read_delayed_var~0.offset_6 0) (= 0 v_~__unbuffered_p0_EAX~0_15) (= |v_#NULL.offset_7| 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t1573~0.base_21|) (= 0 v_~z$w_buff0~0_27) (= 0 v_~z$r_buff1_thd2~0_17) (= 0 v_~z$flush_delayed~0_13) (= v_~z$r_buff0_thd2~0_20 0) (= 0 v_~__unbuffered_cnt~0_21) (< 0 |v_#StackHeapBarrier_17|) (= 0 v_~weak$$choice2~0_32) (= v_~x~0_10 0) (= 0 v_~z$r_buff1_thd1~0_17) (= v_~z$r_buff0_thd1~0_24 0) (= v_~z$read_delayed_var~0.base_6 0) (= 0 v_~__unbuffered_p2_EAX~0_16) (= 0 v_~z$w_buff1_used~0_72) (= 0 v_~weak$$choice0~0_7) (= |v_#valid_59| (store .cse0 |v_ULTIMATE.start_main_~#t1573~0.base_21| 1)) (= v_~z$read_delayed~0_7 0) (= v_~z$mem_tmp~0_10 0) (= v_~z$r_buff0_thd0~0_18 0) (= 0 |v_#NULL.base_7|) (= v_~z~0_27 0) (= 0 v_~z$r_buff1_thd3~0_50) (= 0 v_~z$w_buff1~0_26) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t1573~0.base_21| 4) |v_#length_21|) (= 0 v_~y~0_9))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_17, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_11|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_9|, ULTIMATE.start_main_~#t1574~0.offset=|v_ULTIMATE.start_main_~#t1574~0.offset_13|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_9|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_22|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_18, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_15, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, ULTIMATE.start_main_~#t1574~0.base=|v_ULTIMATE.start_main_~#t1574~0.base_19|, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_16, ~z$mem_tmp~0=v_~z$mem_tmp~0_10, ULTIMATE.start_main_~#t1575~0.offset=|v_ULTIMATE.start_main_~#t1575~0.offset_15|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_7|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_72, ~z$flush_delayed~0=v_~z$flush_delayed~0_13, ~weak$$choice0~0=v_~weak$$choice0~0_7, ULTIMATE.start_main_~#t1573~0.base=|v_ULTIMATE.start_main_~#t1573~0.base_21|, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_17, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_78, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, ~x~0=v_~x~0_10, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_26, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_11|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_9|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_24, ULTIMATE.start_main_~#t1573~0.offset=|v_ULTIMATE.start_main_~#t1573~0.offset_16|, ~y~0=v_~y~0_9, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_20, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_7|, ULTIMATE.start_main_~#t1575~0.base=|v_ULTIMATE.start_main_~#t1575~0.base_19|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_113, ~z$w_buff0~0=v_~z$w_buff0~0_27, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_8|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_50, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_17|, ~z~0=v_~z~0_27, ~weak$$choice2~0=v_~weak$$choice2~0_32, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_24} AuxVars[] AssignedVars[~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_~#t1574~0.offset, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t1574~0.base, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_~#t1575~0.offset, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~weak$$choice0~0, ULTIMATE.start_main_~#t1573~0.base, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t1573~0.offset, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_~#t1575~0.base, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 07:02:34,844 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [872] [872] L822-1-->L824: Formula: (and (= |v_#valid_38| (store |v_#valid_39| |v_ULTIMATE.start_main_~#t1574~0.base_11| 1)) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t1574~0.base_11| 4) |v_#length_17|) (= |v_ULTIMATE.start_main_~#t1574~0.offset_9| 0) (= (select |v_#valid_39| |v_ULTIMATE.start_main_~#t1574~0.base_11|) 0) (not (= 0 |v_ULTIMATE.start_main_~#t1574~0.base_11|)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1574~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1574~0.base_11|) |v_ULTIMATE.start_main_~#t1574~0.offset_9| 1)) |v_#memory_int_13|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1574~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_6|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t1574~0.base=|v_ULTIMATE.start_main_~#t1574~0.base_11|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1574~0.offset=|v_ULTIMATE.start_main_~#t1574~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, ULTIMATE.start_main_~#t1574~0.base, #length, ULTIMATE.start_main_~#t1574~0.offset] because there is no mapped edge [2019-12-27 07:02:34,844 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L4-->L746: Formula: (and (= v_~z$r_buff0_thd1~0_16 1) (not (= 0 v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_8)) (= v_~z$r_buff0_thd2~0_15 v_~z$r_buff1_thd2~0_11) (= v_~z$r_buff0_thd1~0_17 v_~z$r_buff1_thd1~0_11) (= v_~z$r_buff0_thd3~0_52 v_~z$r_buff1_thd3~0_33) (= v_~__unbuffered_p0_EAX~0_4 v_~x~0_4) (= v_~z$r_buff0_thd0~0_15 v_~z$r_buff1_thd0~0_10)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_15, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_52, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_8, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_17, ~x~0=v_~x~0_4, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_15} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_4, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_15, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_33, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_10, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_11, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_11, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_52, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_8, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_16, ~x~0=v_~x~0_4, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_15} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 07:02:34,848 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L766-2-->L766-4: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In-415302333 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-415302333 256)))) (or (and (= ~z$w_buff1~0_In-415302333 |P1Thread1of1ForFork2_#t~ite9_Out-415302333|) (not .cse0) (not .cse1)) (and (= ~z~0_In-415302333 |P1Thread1of1ForFork2_#t~ite9_Out-415302333|) (or .cse1 .cse0)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-415302333, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-415302333, ~z$w_buff1~0=~z$w_buff1~0_In-415302333, ~z~0=~z~0_In-415302333} OutVars{P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out-415302333|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-415302333, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-415302333, ~z$w_buff1~0=~z$w_buff1~0_In-415302333, ~z~0=~z~0_In-415302333} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-27 07:02:34,848 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L766-4-->L767: Formula: (= v_~z~0_16 |v_P1Thread1of1ForFork2_#t~ite9_8|) InVars {P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_8|} OutVars{P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_7|, P1Thread1of1ForFork2_#t~ite10=|v_P1Thread1of1ForFork2_#t~ite10_7|, ~z~0=v_~z~0_16} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10, ~z~0] because there is no mapped edge [2019-12-27 07:02:34,848 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [869] [869] L824-1-->L826: Formula: (and (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t1575~0.base_13|)) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1575~0.base_13| 4)) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t1575~0.base_13| 1)) (not (= |v_ULTIMATE.start_main_~#t1575~0.base_13| 0)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1575~0.base_13|) (= |v_ULTIMATE.start_main_~#t1575~0.offset_11| 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1575~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1575~0.base_13|) |v_ULTIMATE.start_main_~#t1575~0.offset_11| 2)) |v_#memory_int_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t1575~0.offset=|v_ULTIMATE.start_main_~#t1575~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t1575~0.base=|v_ULTIMATE.start_main_~#t1575~0.base_13|, #valid=|v_#valid_36|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1575~0.offset, ULTIMATE.start_main_~#t1575~0.base, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length] because there is no mapped edge [2019-12-27 07:02:34,848 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L767-->L767-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-1757553567 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-1757553567 256) 0))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork2_#t~ite11_Out-1757553567|) (not .cse1)) (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-1757553567 |P1Thread1of1ForFork2_#t~ite11_Out-1757553567|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1757553567, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1757553567} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1757553567, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out-1757553567|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1757553567} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 07:02:34,849 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L768-->L768-2: Formula: (let ((.cse2 (= (mod ~z$r_buff0_thd2~0_In821807400 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In821807400 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In821807400 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd2~0_In821807400 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite12_Out821807400| ~z$w_buff1_used~0_In821807400) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |P1Thread1of1ForFork2_#t~ite12_Out821807400| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In821807400, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In821807400, ~z$w_buff1_used~0=~z$w_buff1_used~0_In821807400, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In821807400} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In821807400, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In821807400, ~z$w_buff1_used~0=~z$w_buff1_used~0_In821807400, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out821807400|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In821807400} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-27 07:02:34,855 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L769-->L769-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In2059304919 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In2059304919 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite13_Out2059304919| ~z$r_buff0_thd2~0_In2059304919) (or .cse0 .cse1)) (and (= |P1Thread1of1ForFork2_#t~ite13_Out2059304919| 0) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2059304919, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In2059304919} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2059304919, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out2059304919|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In2059304919} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-27 07:02:34,858 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [873] [873] L790-->L790-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In1364787640 256) 0))) (or (and (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In1364787640 256) 0))) (or (= 0 (mod ~z$w_buff0_used~0_In1364787640 256)) (and (= (mod ~z$w_buff1_used~0_In1364787640 256) 0) .cse0) (and .cse0 (= (mod ~z$r_buff1_thd3~0_In1364787640 256) 0)))) (= |P2Thread1of1ForFork0_#t~ite26_Out1364787640| |P2Thread1of1ForFork0_#t~ite27_Out1364787640|) .cse1 (= |P2Thread1of1ForFork0_#t~ite26_Out1364787640| ~z$w_buff0_used~0_In1364787640)) (and (= |P2Thread1of1ForFork0_#t~ite26_In1364787640| |P2Thread1of1ForFork0_#t~ite26_Out1364787640|) (= |P2Thread1of1ForFork0_#t~ite27_Out1364787640| ~z$w_buff0_used~0_In1364787640) (not .cse1)))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In1364787640|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1364787640, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1364787640, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1364787640, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1364787640, ~weak$$choice2~0=~weak$$choice2~0_In1364787640} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out1364787640|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out1364787640|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1364787640, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1364787640, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1364787640, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1364787640, ~weak$$choice2~0=~weak$$choice2~0_In1364787640} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-27 07:02:34,861 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] L792-->L793: Formula: (and (= v_~z$r_buff0_thd3~0_63 v_~z$r_buff0_thd3~0_62) (not (= 0 (mod v_~weak$$choice2~0_24 256)))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_63, ~weak$$choice2~0=v_~weak$$choice2~0_24} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_9|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_9|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_62, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_8|, ~weak$$choice2~0=v_~weak$$choice2~0_24} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 07:02:34,864 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L747-->L747-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In398753876 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In398753876 256)))) (or (and (= ~z$w_buff0_used~0_In398753876 |P0Thread1of1ForFork1_#t~ite5_Out398753876|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P0Thread1of1ForFork1_#t~ite5_Out398753876| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In398753876, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In398753876} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out398753876|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In398753876, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In398753876} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-27 07:02:34,865 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [814] [814] L795-->L799: Formula: (and (not (= (mod v_~z$flush_delayed~0_8 256) 0)) (= 0 v_~z$flush_delayed~0_7) (= v_~z~0_22 v_~z$mem_tmp~0_5)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_8} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_7, ~z~0=v_~z~0_22} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-27 07:02:34,866 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L799-2-->L799-5: Formula: (let ((.cse0 (= |P2Thread1of1ForFork0_#t~ite38_Out-820666533| |P2Thread1of1ForFork0_#t~ite39_Out-820666533|)) (.cse1 (= (mod ~z$w_buff1_used~0_In-820666533 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd3~0_In-820666533 256)))) (or (and .cse0 (not .cse1) (= |P2Thread1of1ForFork0_#t~ite38_Out-820666533| ~z$w_buff1~0_In-820666533) (not .cse2)) (and .cse0 (= |P2Thread1of1ForFork0_#t~ite38_Out-820666533| ~z~0_In-820666533) (or .cse1 .cse2)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-820666533, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-820666533, ~z$w_buff1~0=~z$w_buff1~0_In-820666533, ~z~0=~z~0_In-820666533} OutVars{P2Thread1of1ForFork0_#t~ite39=|P2Thread1of1ForFork0_#t~ite39_Out-820666533|, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out-820666533|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-820666533, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-820666533, ~z$w_buff1~0=~z$w_buff1~0_In-820666533, ~z~0=~z~0_In-820666533} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 07:02:34,867 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L800-->L800-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1699504903 256))) (.cse0 (= (mod ~z$r_buff0_thd3~0_In-1699504903 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite40_Out-1699504903| ~z$w_buff0_used~0_In-1699504903) (or .cse0 .cse1)) (and (not .cse1) (= |P2Thread1of1ForFork0_#t~ite40_Out-1699504903| 0) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1699504903, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1699504903} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1699504903, P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out-1699504903|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1699504903} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-27 07:02:34,868 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L801-->L801-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In1753219574 256))) (.cse1 (= (mod ~z$r_buff0_thd3~0_In1753219574 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In1753219574 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd3~0_In1753219574 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite41_Out1753219574| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P2Thread1of1ForFork0_#t~ite41_Out1753219574| ~z$w_buff1_used~0_In1753219574) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1753219574, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1753219574, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1753219574, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1753219574} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1753219574, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1753219574, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1753219574, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1753219574, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out1753219574|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-27 07:02:34,869 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L802-->L802-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-295893259 256))) (.cse0 (= (mod ~z$r_buff0_thd3~0_In-295893259 256) 0))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork0_#t~ite42_Out-295893259|) (not .cse1)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork0_#t~ite42_Out-295893259| ~z$r_buff0_thd3~0_In-295893259)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-295893259, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-295893259} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-295893259, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-295893259, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out-295893259|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-27 07:02:34,870 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L803-->L803-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In447338207 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In447338207 256))) (.cse2 (= (mod ~z$r_buff1_thd3~0_In447338207 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In447338207 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite43_Out447338207| 0)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork0_#t~ite43_Out447338207| ~z$r_buff1_thd3~0_In447338207) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In447338207, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In447338207, ~z$w_buff1_used~0=~z$w_buff1_used~0_In447338207, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In447338207} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out447338207|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In447338207, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In447338207, ~z$w_buff1_used~0=~z$w_buff1_used~0_In447338207, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In447338207} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-27 07:02:34,870 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [858] [858] L803-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= v_~z$r_buff1_thd3~0_44 |v_P2Thread1of1ForFork0_#t~ite43_8|)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_44, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-27 07:02:34,870 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L748-->L748-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff1_thd1~0_In2114994833 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In2114994833 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In2114994833 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd1~0_In2114994833 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork1_#t~ite6_Out2114994833|)) (and (= ~z$w_buff1_used~0_In2114994833 |P0Thread1of1ForFork1_#t~ite6_Out2114994833|) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2114994833, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In2114994833, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2114994833, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In2114994833} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2114994833, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out2114994833|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In2114994833, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2114994833, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In2114994833} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-27 07:02:34,871 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L749-->L750: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In15692218 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd1~0_In15692218 256) 0))) (or (and (not .cse0) (not .cse1) (= ~z$r_buff0_thd1~0_Out15692218 0)) (and (or .cse0 .cse1) (= ~z$r_buff0_thd1~0_Out15692218 ~z$r_buff0_thd1~0_In15692218)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In15692218, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In15692218} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In15692218, P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out15692218|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out15692218} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 07:02:34,872 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L750-->L750-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd1~0_In-419523137 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-419523137 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd1~0_In-419523137 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-419523137 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork1_#t~ite8_Out-419523137|)) (and (or .cse1 .cse0) (= |P0Thread1of1ForFork1_#t~ite8_Out-419523137| ~z$r_buff1_thd1~0_In-419523137) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-419523137, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-419523137, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-419523137, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-419523137} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-419523137|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-419523137, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-419523137, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-419523137, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-419523137} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 07:02:34,872 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [865] [865] L750-2-->P0EXIT: Formula: (and (= v_~z$r_buff1_thd1~0_12 |v_P0Thread1of1ForFork1_#t~ite8_8|) (= v_~__unbuffered_cnt~0_14 (+ v_~__unbuffered_cnt~0_15 1)) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_7|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_12, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 07:02:34,873 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L770-->L770-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff0_used~0_In-1504945856 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd2~0_In-1504945856 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In-1504945856 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd2~0_In-1504945856 256)))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite14_Out-1504945856|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= ~z$r_buff1_thd2~0_In-1504945856 |P1Thread1of1ForFork2_#t~ite14_Out-1504945856|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1504945856, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1504945856, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1504945856, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1504945856} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1504945856, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1504945856, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1504945856, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-1504945856|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1504945856} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 07:02:34,873 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [870] [870] L770-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork2_#t~ite14_8| v_~z$r_buff1_thd2~0_13) (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_8|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_13, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_7|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-27 07:02:34,873 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [799] [799] L826-1-->L832: Formula: (and (= 3 v_~__unbuffered_cnt~0_10) (= v_~main$tmp_guard0~0_5 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 07:02:34,874 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L832-2-->L832-5: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-1244534672 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite48_Out-1244534672| |ULTIMATE.start_main_#t~ite47_Out-1244534672|)) (.cse0 (= (mod ~z$w_buff1_used~0_In-1244534672 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite47_Out-1244534672| ~z~0_In-1244534672) .cse2) (and (not .cse1) .cse2 (= |ULTIMATE.start_main_#t~ite47_Out-1244534672| ~z$w_buff1~0_In-1244534672) (not .cse0)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1244534672, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1244534672, ~z$w_buff1~0=~z$w_buff1~0_In-1244534672, ~z~0=~z~0_In-1244534672} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1244534672, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-1244534672|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1244534672, ~z$w_buff1~0=~z$w_buff1~0_In-1244534672, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out-1244534672|, ~z~0=~z~0_In-1244534672} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 07:02:34,875 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L833-->L833-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In2020110681 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In2020110681 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite49_Out2020110681| ~z$w_buff0_used~0_In2020110681)) (and (= |ULTIMATE.start_main_#t~ite49_Out2020110681| 0) (not .cse0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2020110681, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2020110681} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2020110681, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2020110681, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out2020110681|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 07:02:34,876 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L834-->L834-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In2135111698 256))) (.cse0 (= (mod ~z$r_buff0_thd0~0_In2135111698 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In2135111698 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In2135111698 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite50_Out2135111698|)) (and (or .cse1 .cse0) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In2135111698 |ULTIMATE.start_main_#t~ite50_Out2135111698|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2135111698, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2135111698, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2135111698, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2135111698} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out2135111698|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2135111698, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2135111698, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2135111698, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2135111698} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 07:02:34,877 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L835-->L835-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In724936625 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In724936625 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite51_Out724936625|) (not .cse1)) (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In724936625 |ULTIMATE.start_main_#t~ite51_Out724936625|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In724936625, ~z$w_buff0_used~0=~z$w_buff0_used~0_In724936625} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In724936625, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out724936625|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In724936625} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 07:02:34,877 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L836-->L836-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In2095361101 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In2095361101 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd0~0_In2095361101 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In2095361101 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite52_Out2095361101| ~z$r_buff1_thd0~0_In2095361101) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite52_Out2095361101| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2095361101, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2095361101, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2095361101, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2095361101} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out2095361101|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2095361101, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2095361101, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2095361101, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2095361101} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 07:02:34,878 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [876] [876] L836-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 0 v_~__unbuffered_p2_EAX~0_10) (= v_~main$tmp_guard1~0_10 0) (= v_~__unbuffered_p0_EAX~0_9 0) (= |v_ULTIMATE.start_main_#t~ite52_15| v_~z$r_buff1_thd0~0_17) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= 0 v_~__unbuffered_p1_EAX~0_8) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11| (mod v_~main$tmp_guard1~0_10 256))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_15|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_10} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_14|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_17, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_10, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 07:02:34,995 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 07:02:34 BasicIcfg [2019-12-27 07:02:34,995 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 07:02:34,997 INFO L168 Benchmark]: Toolchain (without parser) took 114054.92 ms. Allocated memory was 138.9 MB in the beginning and 3.7 GB in the end (delta: 3.6 GB). Free memory was 101.1 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-12-27 07:02:34,997 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 138.9 MB. Free memory was 120.9 MB in the beginning and 120.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 07:02:34,998 INFO L168 Benchmark]: CACSL2BoogieTranslator took 712.24 ms. Allocated memory was 138.9 MB in the beginning and 202.4 MB in the end (delta: 63.4 MB). Free memory was 100.7 MB in the beginning and 155.9 MB in the end (delta: -55.1 MB). Peak memory consumption was 24.9 MB. Max. memory is 7.1 GB. [2019-12-27 07:02:34,998 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.67 ms. Allocated memory is still 202.4 MB. Free memory was 155.9 MB in the beginning and 153.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 07:02:34,999 INFO L168 Benchmark]: Boogie Preprocessor took 41.95 ms. Allocated memory is still 202.4 MB. Free memory was 153.2 MB in the beginning and 150.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 07:02:34,999 INFO L168 Benchmark]: RCFGBuilder took 814.14 ms. Allocated memory is still 202.4 MB. Free memory was 150.6 MB in the beginning and 100.9 MB in the end (delta: 49.7 MB). Peak memory consumption was 49.7 MB. Max. memory is 7.1 GB. [2019-12-27 07:02:34,999 INFO L168 Benchmark]: TraceAbstraction took 112419.79 ms. Allocated memory was 202.4 MB in the beginning and 3.7 GB in the end (delta: 3.5 GB). Free memory was 100.2 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-12-27 07:02:35,006 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.19 ms. Allocated memory is still 138.9 MB. Free memory was 120.9 MB in the beginning and 120.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 712.24 ms. Allocated memory was 138.9 MB in the beginning and 202.4 MB in the end (delta: 63.4 MB). Free memory was 100.7 MB in the beginning and 155.9 MB in the end (delta: -55.1 MB). Peak memory consumption was 24.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 61.67 ms. Allocated memory is still 202.4 MB. Free memory was 155.9 MB in the beginning and 153.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 41.95 ms. Allocated memory is still 202.4 MB. Free memory was 153.2 MB in the beginning and 150.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 814.14 ms. Allocated memory is still 202.4 MB. Free memory was 150.6 MB in the beginning and 100.9 MB in the end (delta: 49.7 MB). Peak memory consumption was 49.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 112419.79 ms. Allocated memory was 202.4 MB in the beginning and 3.7 GB in the end (delta: 3.5 GB). Free memory was 100.2 MB in the beginning and 2.2 GB in the end (delta: -2.1 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, 176 ProgramPointsBefore, 96 ProgramPointsAfterwards, 213 TransitionsBefore, 108 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 33 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 29 ChoiceCompositions, 6738 VarBasedMoverChecksPositive, 208 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 85326 CheckedPairsTotal, 112 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L822] FCALL, FORK 0 pthread_create(&t1573, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L731] 1 z$w_buff1 = z$w_buff0 [L732] 1 z$w_buff0 = 1 [L733] 1 z$w_buff1_used = z$w_buff0_used [L734] 1 z$w_buff0_used = (_Bool)1 [L746] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L824] FCALL, FORK 0 pthread_create(&t1574, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L760] 2 x = 1 [L763] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L767] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L826] FCALL, FORK 0 pthread_create(&t1575, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L780] 3 y = 1 [L783] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L784] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L785] 3 z$flush_delayed = weak$$choice2 [L786] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L788] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L768] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L788] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L789] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L789] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L790] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L791] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L791] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L793] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L793] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L794] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L746] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L747] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L799] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L799] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L800] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L801] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L802] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L748] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L769] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L832] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L832] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L833] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L834] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L835] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 167 locations, 2 error locations. Result: UNSAFE, OverallTime: 112.0s, OverallIterations: 32, TraceHistogramMax: 1, AutomataDifference: 34.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7541 SDtfs, 9044 SDslu, 29062 SDs, 0 SdLazy, 13715 SolverSat, 286 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 353 GetRequests, 47 SyntacticMatches, 15 SemanticMatches, 291 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 770 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=161661occurred 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: 46.4s AutomataMinimizationTime, 31 MinimizatonAttempts, 319253 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 1609 NumberOfCodeBlocks, 1609 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 1511 ConstructedInterpolants, 0 QuantifiedInterpolants, 310861 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 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...