/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/safe021_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 07:52:58,596 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 07:52:58,599 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 07:52:58,618 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 07:52:58,618 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 07:52:58,620 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 07:52:58,622 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 07:52:58,636 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 07:52:58,638 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 07:52:58,639 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 07:52:58,640 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 07:52:58,642 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 07:52:58,642 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 07:52:58,646 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 07:52:58,649 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 07:52:58,650 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 07:52:58,652 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 07:52:58,655 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 07:52:58,656 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 07:52:58,662 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 07:52:58,666 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 07:52:58,667 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 07:52:58,668 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 07:52:58,669 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 07:52:58,671 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 07:52:58,671 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 07:52:58,671 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 07:52:58,672 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 07:52:58,672 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 07:52:58,673 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 07:52:58,674 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 07:52:58,674 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 07:52:58,675 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 07:52:58,676 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 07:52:58,677 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 07:52:58,677 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 07:52:58,678 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 07:52:58,678 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 07:52:58,678 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 07:52:58,679 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 07:52:58,679 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 07:52:58,680 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:52:58,694 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 07:52:58,694 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 07:52:58,695 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 07:52:58,696 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 07:52:58,696 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 07:52:58,696 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 07:52:58,696 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 07:52:58,696 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 07:52:58,697 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 07:52:58,697 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 07:52:58,697 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 07:52:58,697 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 07:52:58,697 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 07:52:58,698 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 07:52:58,698 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 07:52:58,698 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 07:52:58,698 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 07:52:58,699 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 07:52:58,699 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 07:52:58,699 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 07:52:58,699 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 07:52:58,699 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 07:52:58,699 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 07:52:58,700 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 07:52:58,700 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 07:52:58,700 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 07:52:58,700 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 07:52:58,700 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 07:52:58,701 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 07:52:58,701 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 07:52:58,978 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 07:52:58,993 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 07:52:58,996 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 07:52:58,998 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 07:52:58,998 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 07:52:58,999 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe021_rmo.opt.i [2019-12-27 07:52:59,064 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/686c07de4/d38ad23ad8fe42f5876f5530c320043e/FLAG71982bd66 [2019-12-27 07:52:59,554 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 07:52:59,555 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe021_rmo.opt.i [2019-12-27 07:52:59,572 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/686c07de4/d38ad23ad8fe42f5876f5530c320043e/FLAG71982bd66 [2019-12-27 07:52:59,903 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/686c07de4/d38ad23ad8fe42f5876f5530c320043e [2019-12-27 07:52:59,912 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 07:52:59,913 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 07:52:59,916 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 07:52:59,916 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 07:52:59,919 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 07:52:59,921 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:52:59" (1/1) ... [2019-12-27 07:52:59,924 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fdaac8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:52:59, skipping insertion in model container [2019-12-27 07:52:59,924 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:52:59" (1/1) ... [2019-12-27 07:52:59,932 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 07:53:00,002 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 07:53:00,522 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 07:53:00,538 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 07:53:00,635 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 07:53:00,723 INFO L208 MainTranslator]: Completed translation [2019-12-27 07:53:00,724 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:53:00 WrapperNode [2019-12-27 07:53:00,725 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 07:53:00,726 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 07:53:00,726 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 07:53:00,726 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 07:53:00,733 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:53:00" (1/1) ... [2019-12-27 07:53:00,754 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:53:00" (1/1) ... [2019-12-27 07:53:00,784 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 07:53:00,785 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 07:53:00,785 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 07:53:00,785 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 07:53:00,795 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:53:00" (1/1) ... [2019-12-27 07:53:00,795 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:53:00" (1/1) ... [2019-12-27 07:53:00,800 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:53:00" (1/1) ... [2019-12-27 07:53:00,801 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:53:00" (1/1) ... [2019-12-27 07:53:00,813 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:53:00" (1/1) ... [2019-12-27 07:53:00,818 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:53:00" (1/1) ... [2019-12-27 07:53:00,822 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:53:00" (1/1) ... [2019-12-27 07:53:00,827 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 07:53:00,828 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 07:53:00,828 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 07:53:00,828 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 07:53:00,829 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:53:00" (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:53:00,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 07:53:00,889 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 07:53:00,889 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 07:53:00,889 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 07:53:00,889 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 07:53:00,890 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 07:53:00,890 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 07:53:00,892 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 07:53:00,892 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 07:53:00,893 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 07:53:00,893 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 07:53:00,894 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 07:53:00,894 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 07:53:00,896 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:53:01,672 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 07:53:01,673 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 07:53:01,674 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:53:01 BoogieIcfgContainer [2019-12-27 07:53:01,675 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 07:53:01,676 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 07:53:01,676 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 07:53:01,679 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 07:53:01,680 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 07:52:59" (1/3) ... [2019-12-27 07:53:01,681 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fdd4a51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:53:01, skipping insertion in model container [2019-12-27 07:53:01,681 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:53:00" (2/3) ... [2019-12-27 07:53:01,681 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fdd4a51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:53:01, skipping insertion in model container [2019-12-27 07:53:01,682 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:53:01" (3/3) ... [2019-12-27 07:53:01,684 INFO L109 eAbstractionObserver]: Analyzing ICFG safe021_rmo.opt.i [2019-12-27 07:53:01,694 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 07:53:01,695 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 07:53:01,703 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 07:53:01,704 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 07:53:01,749 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,749 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,750 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,750 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,750 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,750 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,751 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,751 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,752 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,752 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,752 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,753 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,753 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,753 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,754 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,754 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,754 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,754 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,755 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,755 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,755 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,755 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,756 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,756 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,756 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,757 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,757 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,757 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,757 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,758 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,758 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,758 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,758 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,759 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,759 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,760 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,760 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,760 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,760 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,761 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,761 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,761 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,761 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,762 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,762 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,762 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,762 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,763 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,763 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,763 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,763 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,764 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,764 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,764 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,764 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,765 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,765 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,765 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,765 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,766 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,766 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,766 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,767 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,767 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,768 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,768 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,768 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,769 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,769 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,769 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,769 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,769 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,770 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,770 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,770 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,771 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,771 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,771 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,771 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,772 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,789 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,790 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,790 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,790 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,791 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,791 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,791 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,791 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,792 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,792 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,792 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,792 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,792 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,793 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,793 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,793 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,793 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,794 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,794 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,794 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,794 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,794 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,795 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,795 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,795 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,795 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,795 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,796 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,796 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,796 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,796 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,797 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,797 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,797 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,797 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,798 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,798 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,798 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,798 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,798 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,798 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,799 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,799 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,799 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,799 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,799 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,800 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,800 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,800 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,800 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,800 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,801 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,801 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,801 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,801 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,801 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,802 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,802 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,802 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,802 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,803 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,803 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,803 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,803 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,803 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,804 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,804 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,804 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,804 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,804 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,805 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,805 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,805 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,805 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,805 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,806 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,806 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,806 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,806 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,806 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,806 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,807 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,807 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,807 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,807 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,808 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,808 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,808 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,808 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,808 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,809 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,809 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,809 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,809 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,809 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,809 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,810 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,810 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,810 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,810 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,810 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,811 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,814 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,814 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,815 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,815 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,815 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,815 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,815 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,815 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,816 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,816 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,816 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,816 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,819 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,820 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,820 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,820 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,820 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,821 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,821 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,821 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,821 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,821 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,824 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,825 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,825 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,825 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,825 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,825 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,826 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,826 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,826 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,826 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,826 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,827 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,827 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,827 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,827 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,827 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,828 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,828 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,828 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,828 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,828 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,829 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,829 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,829 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,829 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,830 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,830 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,830 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,830 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,830 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,831 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,831 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,831 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:01,848 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 07:53:01,869 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 07:53:01,869 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 07:53:01,869 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 07:53:01,869 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 07:53:01,869 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 07:53:01,870 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 07:53:01,870 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 07:53:01,870 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 07:53:01,890 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 175 places, 212 transitions [2019-12-27 07:53:01,892 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-27 07:53:02,008 INFO L132 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-27 07:53:02,008 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 07:53:02,025 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 437 event pairs. 0/160 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 07:53:02,050 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-27 07:53:02,105 INFO L132 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-27 07:53:02,105 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 07:53:02,114 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 437 event pairs. 0/160 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 07:53:02,137 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 07:53:02,138 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 07:53:05,912 WARN L192 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-27 07:53:06,050 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-27 07:53:06,086 INFO L206 etLargeBlockEncoding]: Checked pairs total: 80960 [2019-12-27 07:53:06,086 INFO L214 etLargeBlockEncoding]: Total number of compositions: 113 [2019-12-27 07:53:06,089 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 92 places, 101 transitions [2019-12-27 07:53:22,201 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 106892 states. [2019-12-27 07:53:22,203 INFO L276 IsEmpty]: Start isEmpty. Operand 106892 states. [2019-12-27 07:53:22,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 07:53:22,209 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:53:22,209 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 07:53:22,210 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:53:22,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:53:22,216 INFO L82 PathProgramCache]: Analyzing trace with hash 911873, now seen corresponding path program 1 times [2019-12-27 07:53:22,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:53:22,227 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617107550] [2019-12-27 07:53:22,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:53:22,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:53:22,435 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:53:22,436 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617107550] [2019-12-27 07:53:22,437 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:53:22,437 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 07:53:22,438 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910756157] [2019-12-27 07:53:22,443 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:53:22,444 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:53:22,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:53:22,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:53:22,464 INFO L87 Difference]: Start difference. First operand 106892 states. Second operand 3 states. [2019-12-27 07:53:24,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:53:24,246 INFO L93 Difference]: Finished difference Result 106230 states and 453846 transitions. [2019-12-27 07:53:24,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:53:24,248 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 07:53:24,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:53:24,876 INFO L225 Difference]: With dead ends: 106230 [2019-12-27 07:53:24,876 INFO L226 Difference]: Without dead ends: 99639 [2019-12-27 07:53:24,878 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:53:31,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99639 states. [2019-12-27 07:53:34,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99639 to 99639. [2019-12-27 07:53:34,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99639 states. [2019-12-27 07:53:34,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99639 states to 99639 states and 425116 transitions. [2019-12-27 07:53:34,831 INFO L78 Accepts]: Start accepts. Automaton has 99639 states and 425116 transitions. Word has length 3 [2019-12-27 07:53:34,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:53:34,832 INFO L462 AbstractCegarLoop]: Abstraction has 99639 states and 425116 transitions. [2019-12-27 07:53:34,832 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:53:34,832 INFO L276 IsEmpty]: Start isEmpty. Operand 99639 states and 425116 transitions. [2019-12-27 07:53:34,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 07:53:34,836 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:53:34,837 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:53:34,837 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:53:34,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:53:34,838 INFO L82 PathProgramCache]: Analyzing trace with hash -1470531628, now seen corresponding path program 1 times [2019-12-27 07:53:34,838 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:53:34,838 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988501209] [2019-12-27 07:53:34,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:53:34,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:53:34,974 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:53:34,974 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988501209] [2019-12-27 07:53:34,974 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:53:34,977 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:53:34,977 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737891750] [2019-12-27 07:53:34,979 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:53:34,979 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:53:34,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:53:34,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:53:34,980 INFO L87 Difference]: Start difference. First operand 99639 states and 425116 transitions. Second operand 4 states. [2019-12-27 07:53:39,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:53:39,801 INFO L93 Difference]: Finished difference Result 159197 states and 650077 transitions. [2019-12-27 07:53:39,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:53:39,801 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 07:53:39,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:53:40,371 INFO L225 Difference]: With dead ends: 159197 [2019-12-27 07:53:40,371 INFO L226 Difference]: Without dead ends: 159148 [2019-12-27 07:53:40,372 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:53:48,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159148 states. [2019-12-27 07:53:51,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159148 to 145638. [2019-12-27 07:53:51,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145638 states. [2019-12-27 07:53:57,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145638 states to 145638 states and 602196 transitions. [2019-12-27 07:53:57,662 INFO L78 Accepts]: Start accepts. Automaton has 145638 states and 602196 transitions. Word has length 11 [2019-12-27 07:53:57,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:53:57,663 INFO L462 AbstractCegarLoop]: Abstraction has 145638 states and 602196 transitions. [2019-12-27 07:53:57,663 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:53:57,663 INFO L276 IsEmpty]: Start isEmpty. Operand 145638 states and 602196 transitions. [2019-12-27 07:53:57,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 07:53:57,669 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:53:57,669 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:53:57,669 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:53:57,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:53:57,670 INFO L82 PathProgramCache]: Analyzing trace with hash 1074387989, now seen corresponding path program 1 times [2019-12-27 07:53:57,670 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:53:57,670 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694848026] [2019-12-27 07:53:57,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:53:57,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:53:57,745 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:53:57,746 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694848026] [2019-12-27 07:53:57,746 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:53:57,746 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:53:57,746 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594577875] [2019-12-27 07:53:57,747 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:53:57,747 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:53:57,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:53:57,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:53:57,747 INFO L87 Difference]: Start difference. First operand 145638 states and 602196 transitions. Second operand 3 states. [2019-12-27 07:53:57,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:53:57,868 INFO L93 Difference]: Finished difference Result 32092 states and 104170 transitions. [2019-12-27 07:53:57,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:53:57,869 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 07:53:57,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:53:57,932 INFO L225 Difference]: With dead ends: 32092 [2019-12-27 07:53:57,932 INFO L226 Difference]: Without dead ends: 32092 [2019-12-27 07:53:57,933 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:53:58,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32092 states. [2019-12-27 07:53:58,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32092 to 32092. [2019-12-27 07:53:58,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32092 states. [2019-12-27 07:53:58,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32092 states to 32092 states and 104170 transitions. [2019-12-27 07:53:58,627 INFO L78 Accepts]: Start accepts. Automaton has 32092 states and 104170 transitions. Word has length 13 [2019-12-27 07:53:58,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:53:58,628 INFO L462 AbstractCegarLoop]: Abstraction has 32092 states and 104170 transitions. [2019-12-27 07:53:58,628 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:53:58,628 INFO L276 IsEmpty]: Start isEmpty. Operand 32092 states and 104170 transitions. [2019-12-27 07:53:58,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 07:53:58,631 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:53:58,631 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:53:58,631 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:53:58,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:53:58,631 INFO L82 PathProgramCache]: Analyzing trace with hash -625948887, now seen corresponding path program 1 times [2019-12-27 07:53:58,632 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:53:58,632 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024956674] [2019-12-27 07:53:58,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:53:58,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:53:58,771 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:53:58,771 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024956674] [2019-12-27 07:53:58,772 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:53:58,772 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:53:58,772 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147951465] [2019-12-27 07:53:58,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:53:58,773 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:53:58,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:53:58,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:53:58,773 INFO L87 Difference]: Start difference. First operand 32092 states and 104170 transitions. Second operand 5 states. [2019-12-27 07:53:59,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:53:59,289 INFO L93 Difference]: Finished difference Result 43827 states and 140462 transitions. [2019-12-27 07:53:59,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 07:53:59,289 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-27 07:53:59,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:53:59,357 INFO L225 Difference]: With dead ends: 43827 [2019-12-27 07:53:59,357 INFO L226 Difference]: Without dead ends: 43827 [2019-12-27 07:53:59,357 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:53:59,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43827 states. [2019-12-27 07:54:00,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43827 to 37110. [2019-12-27 07:54:00,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37110 states. [2019-12-27 07:54:00,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37110 states to 37110 states and 119926 transitions. [2019-12-27 07:54:00,936 INFO L78 Accepts]: Start accepts. Automaton has 37110 states and 119926 transitions. Word has length 16 [2019-12-27 07:54:00,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:54:00,937 INFO L462 AbstractCegarLoop]: Abstraction has 37110 states and 119926 transitions. [2019-12-27 07:54:00,938 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:54:00,938 INFO L276 IsEmpty]: Start isEmpty. Operand 37110 states and 119926 transitions. [2019-12-27 07:54:00,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 07:54:00,948 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:54:00,948 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:54:00,948 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:54:00,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:54:00,948 INFO L82 PathProgramCache]: Analyzing trace with hash 867934420, now seen corresponding path program 1 times [2019-12-27 07:54:00,949 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:54:00,949 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727073360] [2019-12-27 07:54:00,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:54:00,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:54:01,083 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:54:01,083 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727073360] [2019-12-27 07:54:01,084 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:54:01,084 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 07:54:01,084 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349138895] [2019-12-27 07:54:01,084 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 07:54:01,085 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:54:01,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 07:54:01,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 07:54:01,085 INFO L87 Difference]: Start difference. First operand 37110 states and 119926 transitions. Second operand 6 states. [2019-12-27 07:54:02,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:54:02,227 INFO L93 Difference]: Finished difference Result 56855 states and 178889 transitions. [2019-12-27 07:54:02,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 07:54:02,228 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 07:54:02,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:54:02,319 INFO L225 Difference]: With dead ends: 56855 [2019-12-27 07:54:02,319 INFO L226 Difference]: Without dead ends: 56848 [2019-12-27 07:54:02,319 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 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:54:02,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56848 states. [2019-12-27 07:54:02,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56848 to 38036. [2019-12-27 07:54:02,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38036 states. [2019-12-27 07:54:03,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38036 states to 38036 states and 122132 transitions. [2019-12-27 07:54:03,637 INFO L78 Accepts]: Start accepts. Automaton has 38036 states and 122132 transitions. Word has length 22 [2019-12-27 07:54:03,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:54:03,637 INFO L462 AbstractCegarLoop]: Abstraction has 38036 states and 122132 transitions. [2019-12-27 07:54:03,637 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 07:54:03,637 INFO L276 IsEmpty]: Start isEmpty. Operand 38036 states and 122132 transitions. [2019-12-27 07:54:03,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 07:54:03,652 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:54:03,652 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:54:03,652 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:54:03,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:54:03,652 INFO L82 PathProgramCache]: Analyzing trace with hash -1491582791, now seen corresponding path program 1 times [2019-12-27 07:54:03,653 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:54:03,653 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503373753] [2019-12-27 07:54:03,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:54:03,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:54:03,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:54:03,716 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503373753] [2019-12-27 07:54:03,716 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:54:03,716 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:54:03,716 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017263454] [2019-12-27 07:54:03,717 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:54:03,717 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:54:03,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:54:03,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:54:03,718 INFO L87 Difference]: Start difference. First operand 38036 states and 122132 transitions. Second operand 4 states. [2019-12-27 07:54:03,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:54:03,797 INFO L93 Difference]: Finished difference Result 15569 states and 47210 transitions. [2019-12-27 07:54:03,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 07:54:03,798 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 07:54:03,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:54:03,826 INFO L225 Difference]: With dead ends: 15569 [2019-12-27 07:54:03,826 INFO L226 Difference]: Without dead ends: 15569 [2019-12-27 07:54:03,826 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:54:03,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15569 states. [2019-12-27 07:54:04,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15569 to 15311. [2019-12-27 07:54:04,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15311 states. [2019-12-27 07:54:04,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15311 states to 15311 states and 46474 transitions. [2019-12-27 07:54:04,049 INFO L78 Accepts]: Start accepts. Automaton has 15311 states and 46474 transitions. Word has length 25 [2019-12-27 07:54:04,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:54:04,050 INFO L462 AbstractCegarLoop]: Abstraction has 15311 states and 46474 transitions. [2019-12-27 07:54:04,050 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:54:04,050 INFO L276 IsEmpty]: Start isEmpty. Operand 15311 states and 46474 transitions. [2019-12-27 07:54:04,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 07:54:04,062 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:54:04,062 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:54:04,062 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:54:04,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:54:04,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1591310570, now seen corresponding path program 1 times [2019-12-27 07:54:04,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:54:04,063 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326118055] [2019-12-27 07:54:04,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:54:04,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:54:04,181 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:54:04,182 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326118055] [2019-12-27 07:54:04,182 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:54:04,182 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 07:54:04,182 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927968818] [2019-12-27 07:54:04,183 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 07:54:04,183 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:54:04,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 07:54:04,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 07:54:04,184 INFO L87 Difference]: Start difference. First operand 15311 states and 46474 transitions. Second operand 6 states. [2019-12-27 07:54:04,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:54:04,756 INFO L93 Difference]: Finished difference Result 21967 states and 64800 transitions. [2019-12-27 07:54:04,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 07:54:04,756 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 07:54:04,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:54:04,795 INFO L225 Difference]: With dead ends: 21967 [2019-12-27 07:54:04,795 INFO L226 Difference]: Without dead ends: 21967 [2019-12-27 07:54:04,796 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 07:54:04,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21967 states. [2019-12-27 07:54:05,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21967 to 17627. [2019-12-27 07:54:05,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17627 states. [2019-12-27 07:54:05,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17627 states to 17627 states and 53055 transitions. [2019-12-27 07:54:05,154 INFO L78 Accepts]: Start accepts. Automaton has 17627 states and 53055 transitions. Word has length 27 [2019-12-27 07:54:05,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:54:05,154 INFO L462 AbstractCegarLoop]: Abstraction has 17627 states and 53055 transitions. [2019-12-27 07:54:05,154 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 07:54:05,154 INFO L276 IsEmpty]: Start isEmpty. Operand 17627 states and 53055 transitions. [2019-12-27 07:54:05,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 07:54:05,173 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:54:05,173 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:54:05,173 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:54:05,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:54:05,173 INFO L82 PathProgramCache]: Analyzing trace with hash 174996949, now seen corresponding path program 1 times [2019-12-27 07:54:05,173 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:54:05,173 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133783950] [2019-12-27 07:54:05,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:54:05,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:54:05,356 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:54:05,356 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133783950] [2019-12-27 07:54:05,356 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:54:05,356 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 07:54:05,356 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15781625] [2019-12-27 07:54:05,357 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 07:54:05,357 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:54:05,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 07:54:05,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 07:54:05,358 INFO L87 Difference]: Start difference. First operand 17627 states and 53055 transitions. Second operand 8 states. [2019-12-27 07:54:06,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:54:06,635 INFO L93 Difference]: Finished difference Result 24849 states and 72852 transitions. [2019-12-27 07:54:06,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 07:54:06,636 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2019-12-27 07:54:06,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:54:06,670 INFO L225 Difference]: With dead ends: 24849 [2019-12-27 07:54:06,670 INFO L226 Difference]: Without dead ends: 24849 [2019-12-27 07:54:06,671 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=342, Unknown=0, NotChecked=0, Total=462 [2019-12-27 07:54:06,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24849 states. [2019-12-27 07:54:07,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24849 to 17725. [2019-12-27 07:54:07,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17725 states. [2019-12-27 07:54:07,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17725 states to 17725 states and 53335 transitions. [2019-12-27 07:54:07,282 INFO L78 Accepts]: Start accepts. Automaton has 17725 states and 53335 transitions. Word has length 33 [2019-12-27 07:54:07,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:54:07,283 INFO L462 AbstractCegarLoop]: Abstraction has 17725 states and 53335 transitions. [2019-12-27 07:54:07,283 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 07:54:07,283 INFO L276 IsEmpty]: Start isEmpty. Operand 17725 states and 53335 transitions. [2019-12-27 07:54:07,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 07:54:07,302 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:54:07,302 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:54:07,302 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:54:07,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:54:07,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1052383531, now seen corresponding path program 2 times [2019-12-27 07:54:07,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:54:07,303 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497715298] [2019-12-27 07:54:07,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:54:07,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:54:07,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:54:07,431 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497715298] [2019-12-27 07:54:07,431 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:54:07,431 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 07:54:07,432 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134877742] [2019-12-27 07:54:07,432 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 07:54:07,432 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:54:07,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 07:54:07,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:54:07,433 INFO L87 Difference]: Start difference. First operand 17725 states and 53335 transitions. Second operand 7 states. [2019-12-27 07:54:08,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:54:08,677 INFO L93 Difference]: Finished difference Result 24587 states and 72060 transitions. [2019-12-27 07:54:08,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 07:54:08,678 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-27 07:54:08,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:54:08,709 INFO L225 Difference]: With dead ends: 24587 [2019-12-27 07:54:08,710 INFO L226 Difference]: Without dead ends: 24587 [2019-12-27 07:54:08,710 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-27 07:54:08,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24587 states. [2019-12-27 07:54:08,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24587 to 16954. [2019-12-27 07:54:08,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16954 states. [2019-12-27 07:54:08,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16954 states to 16954 states and 50982 transitions. [2019-12-27 07:54:08,995 INFO L78 Accepts]: Start accepts. Automaton has 16954 states and 50982 transitions. Word has length 33 [2019-12-27 07:54:08,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:54:08,996 INFO L462 AbstractCegarLoop]: Abstraction has 16954 states and 50982 transitions. [2019-12-27 07:54:08,996 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 07:54:08,996 INFO L276 IsEmpty]: Start isEmpty. Operand 16954 states and 50982 transitions. [2019-12-27 07:54:09,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 07:54:09,016 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:54:09,017 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:54:09,017 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:54:09,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:54:09,017 INFO L82 PathProgramCache]: Analyzing trace with hash 1438899484, now seen corresponding path program 1 times [2019-12-27 07:54:09,017 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:54:09,017 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069619182] [2019-12-27 07:54:09,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:54:09,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:54:09,073 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:54:09,073 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069619182] [2019-12-27 07:54:09,073 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:54:09,074 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 07:54:09,074 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748562557] [2019-12-27 07:54:09,074 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:54:09,074 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:54:09,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:54:09,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:54:09,075 INFO L87 Difference]: Start difference. First operand 16954 states and 50982 transitions. Second operand 3 states. [2019-12-27 07:54:09,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:54:09,141 INFO L93 Difference]: Finished difference Result 16953 states and 50980 transitions. [2019-12-27 07:54:09,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:54:09,142 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 07:54:09,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:54:09,174 INFO L225 Difference]: With dead ends: 16953 [2019-12-27 07:54:09,174 INFO L226 Difference]: Without dead ends: 16953 [2019-12-27 07:54:09,175 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:54:09,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16953 states. [2019-12-27 07:54:09,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16953 to 16953. [2019-12-27 07:54:09,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16953 states. [2019-12-27 07:54:09,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16953 states to 16953 states and 50980 transitions. [2019-12-27 07:54:09,578 INFO L78 Accepts]: Start accepts. Automaton has 16953 states and 50980 transitions. Word has length 39 [2019-12-27 07:54:09,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:54:09,578 INFO L462 AbstractCegarLoop]: Abstraction has 16953 states and 50980 transitions. [2019-12-27 07:54:09,578 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:54:09,578 INFO L276 IsEmpty]: Start isEmpty. Operand 16953 states and 50980 transitions. [2019-12-27 07:54:09,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 07:54:09,602 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:54:09,602 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:54:09,603 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:54:09,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:54:09,603 INFO L82 PathProgramCache]: Analyzing trace with hash -1842516343, now seen corresponding path program 1 times [2019-12-27 07:54:09,603 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:54:09,604 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595493328] [2019-12-27 07:54:09,604 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:54:09,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:54:09,660 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:54:09,661 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595493328] [2019-12-27 07:54:09,661 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:54:09,661 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:54:09,661 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253430088] [2019-12-27 07:54:09,661 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:54:09,662 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:54:09,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:54:09,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:54:09,662 INFO L87 Difference]: Start difference. First operand 16953 states and 50980 transitions. Second operand 4 states. [2019-12-27 07:54:09,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:54:09,796 INFO L93 Difference]: Finished difference Result 32065 states and 96487 transitions. [2019-12-27 07:54:09,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 07:54:09,797 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2019-12-27 07:54:09,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:54:09,826 INFO L225 Difference]: With dead ends: 32065 [2019-12-27 07:54:09,826 INFO L226 Difference]: Without dead ends: 16605 [2019-12-27 07:54:09,826 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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:54:09,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16605 states. [2019-12-27 07:54:10,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16605 to 16603. [2019-12-27 07:54:10,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16603 states. [2019-12-27 07:54:10,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16603 states to 16603 states and 49251 transitions. [2019-12-27 07:54:10,063 INFO L78 Accepts]: Start accepts. Automaton has 16603 states and 49251 transitions. Word has length 40 [2019-12-27 07:54:10,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:54:10,063 INFO L462 AbstractCegarLoop]: Abstraction has 16603 states and 49251 transitions. [2019-12-27 07:54:10,063 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:54:10,063 INFO L276 IsEmpty]: Start isEmpty. Operand 16603 states and 49251 transitions. [2019-12-27 07:54:10,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 07:54:10,078 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:54:10,078 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:54:10,078 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:54:10,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:54:10,078 INFO L82 PathProgramCache]: Analyzing trace with hash 559678541, now seen corresponding path program 2 times [2019-12-27 07:54:10,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:54:10,079 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112423647] [2019-12-27 07:54:10,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:54:10,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:54:10,153 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:54:10,154 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112423647] [2019-12-27 07:54:10,154 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:54:10,154 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 07:54:10,154 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286688160] [2019-12-27 07:54:10,155 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:54:10,155 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:54:10,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:54:10,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:54:10,155 INFO L87 Difference]: Start difference. First operand 16603 states and 49251 transitions. Second operand 5 states. [2019-12-27 07:54:11,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:54:11,046 INFO L93 Difference]: Finished difference Result 22916 states and 67717 transitions. [2019-12-27 07:54:11,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 07:54:11,046 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-27 07:54:11,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:54:11,076 INFO L225 Difference]: With dead ends: 22916 [2019-12-27 07:54:11,076 INFO L226 Difference]: Without dead ends: 22916 [2019-12-27 07:54:11,077 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 07:54:11,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22916 states. [2019-12-27 07:54:11,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22916 to 21410. [2019-12-27 07:54:11,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21410 states. [2019-12-27 07:54:11,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21410 states to 21410 states and 63610 transitions. [2019-12-27 07:54:11,383 INFO L78 Accepts]: Start accepts. Automaton has 21410 states and 63610 transitions. Word has length 40 [2019-12-27 07:54:11,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:54:11,383 INFO L462 AbstractCegarLoop]: Abstraction has 21410 states and 63610 transitions. [2019-12-27 07:54:11,383 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:54:11,383 INFO L276 IsEmpty]: Start isEmpty. Operand 21410 states and 63610 transitions. [2019-12-27 07:54:11,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 07:54:11,402 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:54:11,402 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:54:11,403 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:54:11,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:54:11,403 INFO L82 PathProgramCache]: Analyzing trace with hash 698759109, now seen corresponding path program 3 times [2019-12-27 07:54:11,403 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:54:11,404 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402051432] [2019-12-27 07:54:11,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:54:11,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:54:11,465 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:54:11,465 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402051432] [2019-12-27 07:54:11,466 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:54:11,466 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 07:54:11,466 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969327751] [2019-12-27 07:54:11,466 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:54:11,466 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:54:11,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:54:11,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:54:11,467 INFO L87 Difference]: Start difference. First operand 21410 states and 63610 transitions. Second operand 5 states. [2019-12-27 07:54:11,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:54:11,551 INFO L93 Difference]: Finished difference Result 20165 states and 60739 transitions. [2019-12-27 07:54:11,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:54:11,551 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-27 07:54:11,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:54:11,577 INFO L225 Difference]: With dead ends: 20165 [2019-12-27 07:54:11,577 INFO L226 Difference]: Without dead ends: 19671 [2019-12-27 07:54:11,578 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:54:11,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19671 states. [2019-12-27 07:54:11,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19671 to 18831. [2019-12-27 07:54:11,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18831 states. [2019-12-27 07:54:11,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18831 states to 18831 states and 57508 transitions. [2019-12-27 07:54:11,858 INFO L78 Accepts]: Start accepts. Automaton has 18831 states and 57508 transitions. Word has length 40 [2019-12-27 07:54:11,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:54:11,858 INFO L462 AbstractCegarLoop]: Abstraction has 18831 states and 57508 transitions. [2019-12-27 07:54:11,858 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:54:11,858 INFO L276 IsEmpty]: Start isEmpty. Operand 18831 states and 57508 transitions. [2019-12-27 07:54:11,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 07:54:11,882 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:54:11,882 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] [2019-12-27 07:54:11,882 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:54:11,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:54:11,882 INFO L82 PathProgramCache]: Analyzing trace with hash -19391093, now seen corresponding path program 1 times [2019-12-27 07:54:11,883 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:54:11,883 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003877771] [2019-12-27 07:54:11,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:54:11,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:54:11,925 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:54:11,925 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003877771] [2019-12-27 07:54:11,925 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:54:11,926 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:54:11,926 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417559412] [2019-12-27 07:54:11,926 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:54:11,926 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:54:11,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:54:11,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:54:11,927 INFO L87 Difference]: Start difference. First operand 18831 states and 57508 transitions. Second operand 3 states. [2019-12-27 07:54:12,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:54:12,057 INFO L93 Difference]: Finished difference Result 27792 states and 85045 transitions. [2019-12-27 07:54:12,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:54:12,057 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 07:54:12,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:54:12,106 INFO L225 Difference]: With dead ends: 27792 [2019-12-27 07:54:12,107 INFO L226 Difference]: Without dead ends: 27792 [2019-12-27 07:54:12,108 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:54:12,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27792 states. [2019-12-27 07:54:12,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27792 to 21217. [2019-12-27 07:54:12,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21217 states. [2019-12-27 07:54:12,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21217 states to 21217 states and 65595 transitions. [2019-12-27 07:54:12,449 INFO L78 Accepts]: Start accepts. Automaton has 21217 states and 65595 transitions. Word has length 64 [2019-12-27 07:54:12,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:54:12,449 INFO L462 AbstractCegarLoop]: Abstraction has 21217 states and 65595 transitions. [2019-12-27 07:54:12,449 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:54:12,449 INFO L276 IsEmpty]: Start isEmpty. Operand 21217 states and 65595 transitions. [2019-12-27 07:54:12,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 07:54:12,471 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:54:12,471 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] [2019-12-27 07:54:12,471 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:54:12,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:54:12,472 INFO L82 PathProgramCache]: Analyzing trace with hash -776574144, now seen corresponding path program 1 times [2019-12-27 07:54:12,472 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:54:12,472 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749499045] [2019-12-27 07:54:12,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:54:12,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:54:12,557 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:54:12,557 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749499045] [2019-12-27 07:54:12,558 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:54:12,558 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 07:54:12,558 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440253605] [2019-12-27 07:54:12,558 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 07:54:12,559 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:54:12,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 07:54:12,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:54:12,559 INFO L87 Difference]: Start difference. First operand 21217 states and 65595 transitions. Second operand 7 states. [2019-12-27 07:54:13,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:54:13,663 INFO L93 Difference]: Finished difference Result 62594 states and 191097 transitions. [2019-12-27 07:54:13,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 07:54:13,663 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 07:54:13,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:54:13,740 INFO L225 Difference]: With dead ends: 62594 [2019-12-27 07:54:13,740 INFO L226 Difference]: Without dead ends: 42982 [2019-12-27 07:54:13,740 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 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:54:13,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42982 states. [2019-12-27 07:54:14,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42982 to 24204. [2019-12-27 07:54:14,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24204 states. [2019-12-27 07:54:14,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24204 states to 24204 states and 74744 transitions. [2019-12-27 07:54:14,215 INFO L78 Accepts]: Start accepts. Automaton has 24204 states and 74744 transitions. Word has length 64 [2019-12-27 07:54:14,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:54:14,215 INFO L462 AbstractCegarLoop]: Abstraction has 24204 states and 74744 transitions. [2019-12-27 07:54:14,215 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 07:54:14,215 INFO L276 IsEmpty]: Start isEmpty. Operand 24204 states and 74744 transitions. [2019-12-27 07:54:14,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 07:54:14,242 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:54:14,243 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] [2019-12-27 07:54:14,243 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:54:14,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:54:14,243 INFO L82 PathProgramCache]: Analyzing trace with hash 4176110, now seen corresponding path program 2 times [2019-12-27 07:54:14,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:54:14,243 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534173340] [2019-12-27 07:54:14,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:54:14,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:54:14,330 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:54:14,330 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534173340] [2019-12-27 07:54:14,331 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:54:14,331 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 07:54:14,331 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27970461] [2019-12-27 07:54:14,331 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 07:54:14,331 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:54:14,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 07:54:14,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:54:14,332 INFO L87 Difference]: Start difference. First operand 24204 states and 74744 transitions. Second operand 7 states. [2019-12-27 07:54:14,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:54:14,981 INFO L93 Difference]: Finished difference Result 70069 states and 215496 transitions. [2019-12-27 07:54:14,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 07:54:14,981 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 07:54:14,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:54:15,090 INFO L225 Difference]: With dead ends: 70069 [2019-12-27 07:54:15,091 INFO L226 Difference]: Without dead ends: 52756 [2019-12-27 07:54:15,092 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:54:15,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52756 states. [2019-12-27 07:54:15,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52756 to 28331. [2019-12-27 07:54:15,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28331 states. [2019-12-27 07:54:15,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28331 states to 28331 states and 88059 transitions. [2019-12-27 07:54:15,714 INFO L78 Accepts]: Start accepts. Automaton has 28331 states and 88059 transitions. Word has length 64 [2019-12-27 07:54:15,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:54:15,714 INFO L462 AbstractCegarLoop]: Abstraction has 28331 states and 88059 transitions. [2019-12-27 07:54:15,714 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 07:54:15,714 INFO L276 IsEmpty]: Start isEmpty. Operand 28331 states and 88059 transitions. [2019-12-27 07:54:15,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 07:54:15,746 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:54:15,747 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] [2019-12-27 07:54:15,747 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:54:15,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:54:15,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1890015084, now seen corresponding path program 3 times [2019-12-27 07:54:15,747 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:54:15,747 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411723992] [2019-12-27 07:54:15,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:54:15,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:54:15,823 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:54:15,823 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411723992] [2019-12-27 07:54:15,823 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:54:15,823 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 07:54:15,824 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986378343] [2019-12-27 07:54:15,824 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 07:54:15,824 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:54:15,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 07:54:15,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:54:15,825 INFO L87 Difference]: Start difference. First operand 28331 states and 88059 transitions. Second operand 7 states. [2019-12-27 07:54:16,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:54:16,741 INFO L93 Difference]: Finished difference Result 60139 states and 184623 transitions. [2019-12-27 07:54:16,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 07:54:16,741 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 07:54:16,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:54:16,842 INFO L225 Difference]: With dead ends: 60139 [2019-12-27 07:54:16,842 INFO L226 Difference]: Without dead ends: 52780 [2019-12-27 07:54:16,843 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:54:16,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52780 states. [2019-12-27 07:54:17,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52780 to 28639. [2019-12-27 07:54:17,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28639 states. [2019-12-27 07:54:17,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28639 states to 28639 states and 89010 transitions. [2019-12-27 07:54:17,465 INFO L78 Accepts]: Start accepts. Automaton has 28639 states and 89010 transitions. Word has length 64 [2019-12-27 07:54:17,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:54:17,465 INFO L462 AbstractCegarLoop]: Abstraction has 28639 states and 89010 transitions. [2019-12-27 07:54:17,465 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 07:54:17,465 INFO L276 IsEmpty]: Start isEmpty. Operand 28639 states and 89010 transitions. [2019-12-27 07:54:17,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 07:54:17,498 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:54:17,498 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] [2019-12-27 07:54:17,498 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:54:17,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:54:17,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1583546656, now seen corresponding path program 4 times [2019-12-27 07:54:17,498 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:54:17,499 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883948858] [2019-12-27 07:54:17,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:54:17,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:54:17,554 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:54:17,554 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883948858] [2019-12-27 07:54:17,554 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:54:17,555 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:54:17,555 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585590866] [2019-12-27 07:54:17,555 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:54:17,555 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:54:17,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:54:17,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:54:17,560 INFO L87 Difference]: Start difference. First operand 28639 states and 89010 transitions. Second operand 3 states. [2019-12-27 07:54:17,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:54:17,728 INFO L93 Difference]: Finished difference Result 34404 states and 106219 transitions. [2019-12-27 07:54:17,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:54:17,728 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 07:54:17,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:54:17,774 INFO L225 Difference]: With dead ends: 34404 [2019-12-27 07:54:17,775 INFO L226 Difference]: Without dead ends: 34404 [2019-12-27 07:54:17,775 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:54:17,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34404 states. [2019-12-27 07:54:18,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34404 to 30218. [2019-12-27 07:54:18,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30218 states. [2019-12-27 07:54:18,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30218 states to 30218 states and 93973 transitions. [2019-12-27 07:54:18,245 INFO L78 Accepts]: Start accepts. Automaton has 30218 states and 93973 transitions. Word has length 64 [2019-12-27 07:54:18,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:54:18,245 INFO L462 AbstractCegarLoop]: Abstraction has 30218 states and 93973 transitions. [2019-12-27 07:54:18,245 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:54:18,246 INFO L276 IsEmpty]: Start isEmpty. Operand 30218 states and 93973 transitions. [2019-12-27 07:54:18,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 07:54:18,293 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:54:18,294 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:54:18,294 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:54:18,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:54:18,294 INFO L82 PathProgramCache]: Analyzing trace with hash 1838532524, now seen corresponding path program 1 times [2019-12-27 07:54:18,294 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:54:18,295 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581870876] [2019-12-27 07:54:18,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:54:18,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:54:18,343 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:54:18,344 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581870876] [2019-12-27 07:54:18,344 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:54:18,344 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 07:54:18,344 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95850319] [2019-12-27 07:54:18,345 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:54:18,345 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:54:18,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:54:18,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:54:18,346 INFO L87 Difference]: Start difference. First operand 30218 states and 93973 transitions. Second operand 4 states. [2019-12-27 07:54:18,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:54:18,589 INFO L93 Difference]: Finished difference Result 38058 states and 117223 transitions. [2019-12-27 07:54:18,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 07:54:18,589 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-27 07:54:18,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:54:18,641 INFO L225 Difference]: With dead ends: 38058 [2019-12-27 07:54:18,642 INFO L226 Difference]: Without dead ends: 38058 [2019-12-27 07:54:18,642 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:54:18,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38058 states. [2019-12-27 07:54:19,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38058 to 30836. [2019-12-27 07:54:19,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30836 states. [2019-12-27 07:54:19,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30836 states to 30836 states and 95961 transitions. [2019-12-27 07:54:19,548 INFO L78 Accepts]: Start accepts. Automaton has 30836 states and 95961 transitions. Word has length 65 [2019-12-27 07:54:19,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:54:19,548 INFO L462 AbstractCegarLoop]: Abstraction has 30836 states and 95961 transitions. [2019-12-27 07:54:19,548 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:54:19,548 INFO L276 IsEmpty]: Start isEmpty. Operand 30836 states and 95961 transitions. [2019-12-27 07:54:19,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 07:54:19,580 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:54:19,580 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:54:19,580 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:54:19,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:54:19,580 INFO L82 PathProgramCache]: Analyzing trace with hash 1450523796, now seen corresponding path program 2 times [2019-12-27 07:54:19,581 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:54:19,581 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919074729] [2019-12-27 07:54:19,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:54:19,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:54:19,626 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:54:19,626 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919074729] [2019-12-27 07:54:19,626 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:54:19,626 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 07:54:19,627 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211513932] [2019-12-27 07:54:19,627 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:54:19,627 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:54:19,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:54:19,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:54:19,628 INFO L87 Difference]: Start difference. First operand 30836 states and 95961 transitions. Second operand 4 states. [2019-12-27 07:54:20,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:54:20,067 INFO L93 Difference]: Finished difference Result 48141 states and 150231 transitions. [2019-12-27 07:54:20,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:54:20,068 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-27 07:54:20,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:54:20,139 INFO L225 Difference]: With dead ends: 48141 [2019-12-27 07:54:20,139 INFO L226 Difference]: Without dead ends: 48141 [2019-12-27 07:54:20,139 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:54:20,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48141 states. [2019-12-27 07:54:20,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48141 to 32995. [2019-12-27 07:54:20,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32995 states. [2019-12-27 07:54:20,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32995 states to 32995 states and 103746 transitions. [2019-12-27 07:54:20,768 INFO L78 Accepts]: Start accepts. Automaton has 32995 states and 103746 transitions. Word has length 65 [2019-12-27 07:54:20,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:54:20,768 INFO L462 AbstractCegarLoop]: Abstraction has 32995 states and 103746 transitions. [2019-12-27 07:54:20,769 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:54:20,769 INFO L276 IsEmpty]: Start isEmpty. Operand 32995 states and 103746 transitions. [2019-12-27 07:54:20,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 07:54:20,807 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:54:20,807 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:54:20,808 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:54:20,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:54:20,808 INFO L82 PathProgramCache]: Analyzing trace with hash 1631986328, now seen corresponding path program 3 times [2019-12-27 07:54:20,808 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:54:20,808 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050156957] [2019-12-27 07:54:20,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:54:20,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:54:20,882 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:54:20,883 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050156957] [2019-12-27 07:54:20,883 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:54:20,883 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 07:54:20,883 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336665999] [2019-12-27 07:54:20,884 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 07:54:20,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:54:20,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 07:54:20,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:54:20,884 INFO L87 Difference]: Start difference. First operand 32995 states and 103746 transitions. Second operand 7 states. [2019-12-27 07:54:21,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:54:21,447 INFO L93 Difference]: Finished difference Result 72421 states and 224911 transitions. [2019-12-27 07:54:21,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 07:54:21,448 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-27 07:54:21,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:54:21,552 INFO L225 Difference]: With dead ends: 72421 [2019-12-27 07:54:21,552 INFO L226 Difference]: Without dead ends: 66202 [2019-12-27 07:54:21,553 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:54:21,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66202 states. [2019-12-27 07:54:22,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66202 to 33027. [2019-12-27 07:54:22,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33027 states. [2019-12-27 07:54:22,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33027 states to 33027 states and 103864 transitions. [2019-12-27 07:54:22,776 INFO L78 Accepts]: Start accepts. Automaton has 33027 states and 103864 transitions. Word has length 65 [2019-12-27 07:54:22,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:54:22,777 INFO L462 AbstractCegarLoop]: Abstraction has 33027 states and 103864 transitions. [2019-12-27 07:54:22,777 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 07:54:22,777 INFO L276 IsEmpty]: Start isEmpty. Operand 33027 states and 103864 transitions. [2019-12-27 07:54:22,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 07:54:22,821 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:54:22,822 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:54:22,822 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:54:22,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:54:22,822 INFO L82 PathProgramCache]: Analyzing trace with hash -855143256, now seen corresponding path program 4 times [2019-12-27 07:54:22,822 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:54:22,822 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433046984] [2019-12-27 07:54:22,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:54:22,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:54:22,906 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:54:22,906 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433046984] [2019-12-27 07:54:22,907 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:54:22,907 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 07:54:22,907 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981399570] [2019-12-27 07:54:22,907 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 07:54:22,907 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:54:22,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 07:54:22,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 07:54:22,908 INFO L87 Difference]: Start difference. First operand 33027 states and 103864 transitions. Second operand 6 states. [2019-12-27 07:54:23,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:54:23,697 INFO L93 Difference]: Finished difference Result 53845 states and 170272 transitions. [2019-12-27 07:54:23,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 07:54:23,698 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-27 07:54:23,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:54:23,779 INFO L225 Difference]: With dead ends: 53845 [2019-12-27 07:54:23,780 INFO L226 Difference]: Without dead ends: 53845 [2019-12-27 07:54:23,780 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 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:54:23,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53845 states. [2019-12-27 07:54:24,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53845 to 34199. [2019-12-27 07:54:24,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34199 states. [2019-12-27 07:54:24,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34199 states to 34199 states and 107426 transitions. [2019-12-27 07:54:24,449 INFO L78 Accepts]: Start accepts. Automaton has 34199 states and 107426 transitions. Word has length 65 [2019-12-27 07:54:24,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:54:24,449 INFO L462 AbstractCegarLoop]: Abstraction has 34199 states and 107426 transitions. [2019-12-27 07:54:24,449 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 07:54:24,449 INFO L276 IsEmpty]: Start isEmpty. Operand 34199 states and 107426 transitions. [2019-12-27 07:54:24,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 07:54:24,486 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:54:24,486 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:54:24,486 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:54:24,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:54:24,487 INFO L82 PathProgramCache]: Analyzing trace with hash -1607407314, now seen corresponding path program 1 times [2019-12-27 07:54:24,487 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:54:24,487 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987762050] [2019-12-27 07:54:24,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:54:24,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:54:24,564 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:54:24,564 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987762050] [2019-12-27 07:54:24,564 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:54:24,565 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 07:54:24,565 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329694898] [2019-12-27 07:54:24,565 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:54:24,565 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:54:24,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:54:24,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:54:24,566 INFO L87 Difference]: Start difference. First operand 34199 states and 107426 transitions. Second operand 5 states. [2019-12-27 07:54:25,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:54:25,224 INFO L93 Difference]: Finished difference Result 49777 states and 152916 transitions. [2019-12-27 07:54:25,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 07:54:25,225 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-27 07:54:25,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:54:25,298 INFO L225 Difference]: With dead ends: 49777 [2019-12-27 07:54:25,298 INFO L226 Difference]: Without dead ends: 49557 [2019-12-27 07:54:25,298 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:54:25,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49557 states. [2019-12-27 07:54:26,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49557 to 39728. [2019-12-27 07:54:26,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39728 states. [2019-12-27 07:54:26,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39728 states to 39728 states and 124203 transitions. [2019-12-27 07:54:26,368 INFO L78 Accepts]: Start accepts. Automaton has 39728 states and 124203 transitions. Word has length 65 [2019-12-27 07:54:26,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:54:26,369 INFO L462 AbstractCegarLoop]: Abstraction has 39728 states and 124203 transitions. [2019-12-27 07:54:26,369 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:54:26,369 INFO L276 IsEmpty]: Start isEmpty. Operand 39728 states and 124203 transitions. [2019-12-27 07:54:26,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 07:54:26,412 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:54:26,412 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:54:26,413 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:54:26,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:54:26,413 INFO L82 PathProgramCache]: Analyzing trace with hash 99240326, now seen corresponding path program 2 times [2019-12-27 07:54:26,413 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:54:26,413 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575018415] [2019-12-27 07:54:26,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:54:26,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:54:26,551 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:54:26,552 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575018415] [2019-12-27 07:54:26,552 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:54:26,552 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 07:54:26,552 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676796934] [2019-12-27 07:54:26,554 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 07:54:26,554 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:54:26,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 07:54:26,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 07:54:26,555 INFO L87 Difference]: Start difference. First operand 39728 states and 124203 transitions. Second operand 8 states. [2019-12-27 07:54:28,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:54:28,060 INFO L93 Difference]: Finished difference Result 59625 states and 183241 transitions. [2019-12-27 07:54:28,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 07:54:28,060 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-27 07:54:28,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:54:28,157 INFO L225 Difference]: With dead ends: 59625 [2019-12-27 07:54:28,157 INFO L226 Difference]: Without dead ends: 59513 [2019-12-27 07:54:28,158 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2019-12-27 07:54:28,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59513 states. [2019-12-27 07:54:28,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59513 to 40852. [2019-12-27 07:54:28,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40852 states. [2019-12-27 07:54:28,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40852 states to 40852 states and 127127 transitions. [2019-12-27 07:54:28,964 INFO L78 Accepts]: Start accepts. Automaton has 40852 states and 127127 transitions. Word has length 65 [2019-12-27 07:54:28,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:54:28,964 INFO L462 AbstractCegarLoop]: Abstraction has 40852 states and 127127 transitions. [2019-12-27 07:54:28,964 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 07:54:28,964 INFO L276 IsEmpty]: Start isEmpty. Operand 40852 states and 127127 transitions. [2019-12-27 07:54:29,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 07:54:29,009 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:54:29,010 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:54:29,010 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:54:29,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:54:29,010 INFO L82 PathProgramCache]: Analyzing trace with hash -154311598, now seen corresponding path program 3 times [2019-12-27 07:54:29,010 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:54:29,010 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978110939] [2019-12-27 07:54:29,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:54:29,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:54:29,231 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:54:29,232 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978110939] [2019-12-27 07:54:29,232 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:54:29,232 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 07:54:29,232 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118888282] [2019-12-27 07:54:29,233 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 07:54:29,233 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:54:29,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 07:54:29,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-12-27 07:54:29,234 INFO L87 Difference]: Start difference. First operand 40852 states and 127127 transitions. Second operand 12 states. [2019-12-27 07:54:32,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:54:32,864 INFO L93 Difference]: Finished difference Result 64090 states and 195158 transitions. [2019-12-27 07:54:32,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-27 07:54:32,864 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 65 [2019-12-27 07:54:32,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:54:32,958 INFO L225 Difference]: With dead ends: 64090 [2019-12-27 07:54:32,959 INFO L226 Difference]: Without dead ends: 63794 [2019-12-27 07:54:32,959 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=231, Invalid=891, Unknown=0, NotChecked=0, Total=1122 [2019-12-27 07:54:33,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63794 states. [2019-12-27 07:54:33,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63794 to 44129. [2019-12-27 07:54:33,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44129 states. [2019-12-27 07:54:33,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44129 states to 44129 states and 136879 transitions. [2019-12-27 07:54:33,768 INFO L78 Accepts]: Start accepts. Automaton has 44129 states and 136879 transitions. Word has length 65 [2019-12-27 07:54:33,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:54:33,769 INFO L462 AbstractCegarLoop]: Abstraction has 44129 states and 136879 transitions. [2019-12-27 07:54:33,769 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 07:54:33,769 INFO L276 IsEmpty]: Start isEmpty. Operand 44129 states and 136879 transitions. [2019-12-27 07:54:33,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 07:54:33,820 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:54:33,820 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:54:33,820 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:54:33,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:54:33,821 INFO L82 PathProgramCache]: Analyzing trace with hash -1583496514, now seen corresponding path program 4 times [2019-12-27 07:54:33,821 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:54:33,821 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005123166] [2019-12-27 07:54:33,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:54:33,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:54:33,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:54:33,881 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005123166] [2019-12-27 07:54:33,881 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:54:33,882 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:54:33,882 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247775355] [2019-12-27 07:54:33,882 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:54:33,882 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:54:33,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:54:33,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:54:33,883 INFO L87 Difference]: Start difference. First operand 44129 states and 136879 transitions. Second operand 3 states. [2019-12-27 07:54:34,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:54:34,042 INFO L93 Difference]: Finished difference Result 33725 states and 103346 transitions. [2019-12-27 07:54:34,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:54:34,042 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 07:54:34,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:54:34,106 INFO L225 Difference]: With dead ends: 33725 [2019-12-27 07:54:34,106 INFO L226 Difference]: Without dead ends: 33725 [2019-12-27 07:54:34,106 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:54:34,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33725 states. [2019-12-27 07:54:35,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33725 to 32631. [2019-12-27 07:54:35,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32631 states. [2019-12-27 07:54:35,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32631 states to 32631 states and 99826 transitions. [2019-12-27 07:54:35,060 INFO L78 Accepts]: Start accepts. Automaton has 32631 states and 99826 transitions. Word has length 65 [2019-12-27 07:54:35,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:54:35,060 INFO L462 AbstractCegarLoop]: Abstraction has 32631 states and 99826 transitions. [2019-12-27 07:54:35,060 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:54:35,060 INFO L276 IsEmpty]: Start isEmpty. Operand 32631 states and 99826 transitions. [2019-12-27 07:54:35,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 07:54:35,095 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:54:35,095 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:54:35,095 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:54:35,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:54:35,096 INFO L82 PathProgramCache]: Analyzing trace with hash 199812966, now seen corresponding path program 1 times [2019-12-27 07:54:35,096 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:54:35,096 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59949691] [2019-12-27 07:54:35,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:54:35,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:54:35,229 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:54:35,230 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59949691] [2019-12-27 07:54:35,230 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:54:35,230 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 07:54:35,230 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299046614] [2019-12-27 07:54:35,231 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 07:54:35,231 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:54:35,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 07:54:35,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-27 07:54:35,231 INFO L87 Difference]: Start difference. First operand 32631 states and 99826 transitions. Second operand 10 states. [2019-12-27 07:54:38,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:54:38,254 INFO L93 Difference]: Finished difference Result 49103 states and 146830 transitions. [2019-12-27 07:54:38,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-12-27 07:54:38,254 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2019-12-27 07:54:38,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:54:38,322 INFO L225 Difference]: With dead ends: 49103 [2019-12-27 07:54:38,322 INFO L226 Difference]: Without dead ends: 49103 [2019-12-27 07:54:38,323 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 13 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 543 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=285, Invalid=1607, Unknown=0, NotChecked=0, Total=1892 [2019-12-27 07:54:38,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49103 states. [2019-12-27 07:54:38,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49103 to 31328. [2019-12-27 07:54:38,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31328 states. [2019-12-27 07:54:38,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31328 states to 31328 states and 96150 transitions. [2019-12-27 07:54:38,898 INFO L78 Accepts]: Start accepts. Automaton has 31328 states and 96150 transitions. Word has length 66 [2019-12-27 07:54:38,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:54:38,898 INFO L462 AbstractCegarLoop]: Abstraction has 31328 states and 96150 transitions. [2019-12-27 07:54:38,898 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 07:54:38,899 INFO L276 IsEmpty]: Start isEmpty. Operand 31328 states and 96150 transitions. [2019-12-27 07:54:38,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 07:54:38,933 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:54:38,933 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:54:38,933 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:54:38,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:54:38,934 INFO L82 PathProgramCache]: Analyzing trace with hash -1661859062, now seen corresponding path program 1 times [2019-12-27 07:54:38,934 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:54:38,934 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168318206] [2019-12-27 07:54:38,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:54:38,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:54:39,050 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:54:39,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168318206] [2019-12-27 07:54:39,051 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:54:39,051 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 07:54:39,051 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104892504] [2019-12-27 07:54:39,051 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 07:54:39,051 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:54:39,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 07:54:39,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-27 07:54:39,052 INFO L87 Difference]: Start difference. First operand 31328 states and 96150 transitions. Second operand 9 states. [2019-12-27 07:54:40,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:54:40,569 INFO L93 Difference]: Finished difference Result 57701 states and 175409 transitions. [2019-12-27 07:54:40,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 07:54:40,569 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-12-27 07:54:40,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:54:40,630 INFO L225 Difference]: With dead ends: 57701 [2019-12-27 07:54:40,631 INFO L226 Difference]: Without dead ends: 44664 [2019-12-27 07:54:40,631 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2019-12-27 07:54:40,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44664 states. [2019-12-27 07:54:41,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44664 to 32096. [2019-12-27 07:54:41,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32096 states. [2019-12-27 07:54:41,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32096 states to 32096 states and 97692 transitions. [2019-12-27 07:54:41,604 INFO L78 Accepts]: Start accepts. Automaton has 32096 states and 97692 transitions. Word has length 66 [2019-12-27 07:54:41,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:54:41,605 INFO L462 AbstractCegarLoop]: Abstraction has 32096 states and 97692 transitions. [2019-12-27 07:54:41,605 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 07:54:41,605 INFO L276 IsEmpty]: Start isEmpty. Operand 32096 states and 97692 transitions. [2019-12-27 07:54:41,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 07:54:41,640 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:54:41,640 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:54:41,641 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:54:41,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:54:41,641 INFO L82 PathProgramCache]: Analyzing trace with hash 1990266554, now seen corresponding path program 2 times [2019-12-27 07:54:41,641 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:54:41,641 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048611992] [2019-12-27 07:54:41,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:54:41,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:54:41,698 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:54:41,699 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048611992] [2019-12-27 07:54:41,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:54:41,699 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:54:41,699 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270791914] [2019-12-27 07:54:41,700 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:54:41,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:54:41,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:54:41,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:54:41,700 INFO L87 Difference]: Start difference. First operand 32096 states and 97692 transitions. Second operand 4 states. [2019-12-27 07:54:41,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:54:41,942 INFO L93 Difference]: Finished difference Result 32096 states and 97405 transitions. [2019-12-27 07:54:41,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 07:54:41,943 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-27 07:54:41,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:54:42,016 INFO L225 Difference]: With dead ends: 32096 [2019-12-27 07:54:42,016 INFO L226 Difference]: Without dead ends: 32096 [2019-12-27 07:54:42,017 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:54:42,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32096 states. [2019-12-27 07:54:42,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32096 to 28461. [2019-12-27 07:54:42,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28461 states. [2019-12-27 07:54:42,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28461 states to 28461 states and 85853 transitions. [2019-12-27 07:54:42,619 INFO L78 Accepts]: Start accepts. Automaton has 28461 states and 85853 transitions. Word has length 66 [2019-12-27 07:54:42,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:54:42,620 INFO L462 AbstractCegarLoop]: Abstraction has 28461 states and 85853 transitions. [2019-12-27 07:54:42,620 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:54:42,620 INFO L276 IsEmpty]: Start isEmpty. Operand 28461 states and 85853 transitions. [2019-12-27 07:54:42,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 07:54:42,652 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:54:42,653 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:54:42,653 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:54:42,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:54:42,653 INFO L82 PathProgramCache]: Analyzing trace with hash -855039682, now seen corresponding path program 2 times [2019-12-27 07:54:42,653 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:54:42,653 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245688618] [2019-12-27 07:54:42,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:54:42,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:54:42,832 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:54:42,832 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245688618] [2019-12-27 07:54:42,832 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:54:42,833 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 07:54:42,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916014098] [2019-12-27 07:54:42,833 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 07:54:42,833 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:54:42,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 07:54:42,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 07:54:42,834 INFO L87 Difference]: Start difference. First operand 28461 states and 85853 transitions. Second operand 11 states. [2019-12-27 07:54:44,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:54:44,119 INFO L93 Difference]: Finished difference Result 62794 states and 188209 transitions. [2019-12-27 07:54:44,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-27 07:54:44,119 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-27 07:54:44,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:54:44,189 INFO L225 Difference]: With dead ends: 62794 [2019-12-27 07:54:44,190 INFO L226 Difference]: Without dead ends: 48997 [2019-12-27 07:54:44,190 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=203, Invalid=853, Unknown=0, NotChecked=0, Total=1056 [2019-12-27 07:54:44,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48997 states. [2019-12-27 07:54:44,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48997 to 27235. [2019-12-27 07:54:44,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27235 states. [2019-12-27 07:54:44,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27235 states to 27235 states and 82022 transitions. [2019-12-27 07:54:44,739 INFO L78 Accepts]: Start accepts. Automaton has 27235 states and 82022 transitions. Word has length 66 [2019-12-27 07:54:44,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:54:44,739 INFO L462 AbstractCegarLoop]: Abstraction has 27235 states and 82022 transitions. [2019-12-27 07:54:44,739 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 07:54:44,739 INFO L276 IsEmpty]: Start isEmpty. Operand 27235 states and 82022 transitions. [2019-12-27 07:54:44,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 07:54:44,769 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:54:44,769 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:54:44,770 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:54:44,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:54:44,770 INFO L82 PathProgramCache]: Analyzing trace with hash -503134108, now seen corresponding path program 3 times [2019-12-27 07:54:44,770 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:54:44,770 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180382239] [2019-12-27 07:54:44,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:54:44,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:54:44,830 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:54:44,830 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180382239] [2019-12-27 07:54:44,831 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:54:44,831 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:54:44,831 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375014073] [2019-12-27 07:54:44,831 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:54:44,831 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:54:44,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:54:44,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:54:44,832 INFO L87 Difference]: Start difference. First operand 27235 states and 82022 transitions. Second operand 3 states. [2019-12-27 07:54:44,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:54:44,929 INFO L93 Difference]: Finished difference Result 27235 states and 82021 transitions. [2019-12-27 07:54:44,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:54:44,930 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 07:54:44,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:54:44,969 INFO L225 Difference]: With dead ends: 27235 [2019-12-27 07:54:44,970 INFO L226 Difference]: Without dead ends: 27235 [2019-12-27 07:54:44,970 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:54:45,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27235 states. [2019-12-27 07:54:45,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27235 to 21365. [2019-12-27 07:54:45,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21365 states. [2019-12-27 07:54:45,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21365 states to 21365 states and 65365 transitions. [2019-12-27 07:54:45,685 INFO L78 Accepts]: Start accepts. Automaton has 21365 states and 65365 transitions. Word has length 66 [2019-12-27 07:54:45,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:54:45,686 INFO L462 AbstractCegarLoop]: Abstraction has 21365 states and 65365 transitions. [2019-12-27 07:54:45,686 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:54:45,686 INFO L276 IsEmpty]: Start isEmpty. Operand 21365 states and 65365 transitions. [2019-12-27 07:54:45,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 07:54:45,708 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:54:45,709 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:54:45,709 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:54:45,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:54:45,709 INFO L82 PathProgramCache]: Analyzing trace with hash 744299942, now seen corresponding path program 1 times [2019-12-27 07:54:45,709 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:54:45,709 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569151927] [2019-12-27 07:54:45,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:54:45,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:54:46,353 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:54:46,353 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569151927] [2019-12-27 07:54:46,353 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:54:46,354 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-27 07:54:46,354 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901390108] [2019-12-27 07:54:46,354 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 07:54:46,354 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:54:46,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 07:54:46,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2019-12-27 07:54:46,355 INFO L87 Difference]: Start difference. First operand 21365 states and 65365 transitions. Second operand 17 states. [2019-12-27 07:54:50,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:54:50,151 INFO L93 Difference]: Finished difference Result 27564 states and 83083 transitions. [2019-12-27 07:54:50,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-12-27 07:54:50,151 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 67 [2019-12-27 07:54:50,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:54:50,191 INFO L225 Difference]: With dead ends: 27564 [2019-12-27 07:54:50,191 INFO L226 Difference]: Without dead ends: 27105 [2019-12-27 07:54:50,192 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 425 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=327, Invalid=1395, Unknown=0, NotChecked=0, Total=1722 [2019-12-27 07:54:50,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27105 states. [2019-12-27 07:54:50,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27105 to 21111. [2019-12-27 07:54:50,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21111 states. [2019-12-27 07:54:50,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21111 states to 21111 states and 64721 transitions. [2019-12-27 07:54:50,539 INFO L78 Accepts]: Start accepts. Automaton has 21111 states and 64721 transitions. Word has length 67 [2019-12-27 07:54:50,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:54:50,539 INFO L462 AbstractCegarLoop]: Abstraction has 21111 states and 64721 transitions. [2019-12-27 07:54:50,539 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 07:54:50,539 INFO L276 IsEmpty]: Start isEmpty. Operand 21111 states and 64721 transitions. [2019-12-27 07:54:50,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 07:54:50,560 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:54:50,560 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:54:50,561 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:54:50,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:54:50,561 INFO L82 PathProgramCache]: Analyzing trace with hash -1450844730, now seen corresponding path program 2 times [2019-12-27 07:54:50,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:54:50,561 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333943170] [2019-12-27 07:54:50,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:54:50,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 07:54:50,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 07:54:50,678 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 07:54:50,679 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 07:54:50,683 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [893] [893] ULTIMATE.startENTRY-->L820: Formula: (let ((.cse0 (store |v_#valid_66| 0 0))) (and (= v_~main$tmp_guard1~0_17 0) (= v_~main$tmp_guard0~0_10 0) (= 0 v_~weak$$choice0~0_8) (= |v_#valid_64| (store .cse0 |v_ULTIMATE.start_main_~#t2296~0.base_23| 1)) (= 0 v_~z$r_buff1_thd0~0_24) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t2296~0.base_23|) (= v_~z$r_buff0_thd3~0_77 0) (= |v_#NULL.offset_6| 0) (= 0 v_~z$w_buff1_used~0_77) (= 0 |v_ULTIMATE.start_main_~#t2296~0.offset_17|) (= 0 v_~z$w_buff1~0_28) (= 0 v_~__unbuffered_cnt~0_21) (= v_~__unbuffered_p2_EBX~0_16 0) (= v_~z$r_buff0_thd2~0_19 0) (= 0 v_~weak$$choice2~0_32) (= v_~z$read_delayed_var~0.offset_7 0) (= 0 v_~z$r_buff1_thd2~0_18) (= 0 v_~z$mem_tmp~0_9) (< 0 |v_#StackHeapBarrier_18|) (= 0 v_~__unbuffered_p2_EAX~0_16) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t2296~0.base_23| 4) |v_#length_23|) (= 0 |v_#NULL.base_6|) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2296~0.base_23| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2296~0.base_23|) |v_ULTIMATE.start_main_~#t2296~0.offset_17| 0)) |v_#memory_int_21|) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$read_delayed~0_7 0) (= v_~z$r_buff0_thd0~0_18 0) (= v_~z~0_27 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t2296~0.base_23|) 0) (= v_~z$r_buff0_thd1~0_22 0) (= 0 v_~z$flush_delayed~0_12) (= 0 v_~z$w_buff0~0_26) (= 0 v_~z$r_buff1_thd3~0_50) (= 0 v_~z$r_buff1_thd1~0_16) (= v_~z$w_buff0_used~0_116 0) (= v_~x~0_16 0) (= 0 v_~y~0_9))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_18, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_11|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_9|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_9|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_23|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_18, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_16, ULTIMATE.start_main_~#t2298~0.base=|v_ULTIMATE.start_main_~#t2298~0.base_18|, ~z$mem_tmp~0=v_~z$mem_tmp~0_9, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_8|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_77, ~z$flush_delayed~0=v_~z$flush_delayed~0_12, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_16, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_77, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, ~x~0=v_~x~0_16, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_28, ULTIMATE.start_main_~#t2297~0.base=|v_ULTIMATE.start_main_~#t2297~0.base_22|, ~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_7, 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_~#t2298~0.offset=|v_ULTIMATE.start_main_~#t2298~0.offset_13|, ~y~0=v_~y~0_9, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_19, ULTIMATE.start_main_~#t2296~0.base=|v_ULTIMATE.start_main_~#t2296~0.base_23|, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_7|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_116, ~z$w_buff0~0=v_~z$w_buff0~0_26, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_50, ULTIMATE.start_main_~#t2297~0.offset=|v_ULTIMATE.start_main_~#t2297~0.offset_17|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_~#t2296~0.offset=|v_ULTIMATE.start_main_~#t2296~0.offset_17|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_21|, ~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_22} AuxVars[] AssignedVars[~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, ~z$read_delayed~0, #NULL.offset, ~z$w_buff1~0, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_~#t2297~0.base, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t2298~0.offset, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t2298~0.base, ~y~0, ~z$r_buff0_thd2~0, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_~#t2296~0.base, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_~#t2297~0.offset, ~main$tmp_guard0~0, #NULL.base, ~weak$$choice0~0, ULTIMATE.start_main_~#t2296~0.offset, ULTIMATE.start_main_#res, ~z$r_buff1_thd1~0, #valid, #memory_int, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-27 07:54:50,684 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L820-1-->L822: Formula: (and (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t2297~0.base_9| 4)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t2297~0.base_9|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2297~0.base_9| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2297~0.base_9|) |v_ULTIMATE.start_main_~#t2297~0.offset_8| 1)) |v_#memory_int_11|) (= 0 |v_ULTIMATE.start_main_~#t2297~0.offset_8|) (= (store |v_#valid_34| |v_ULTIMATE.start_main_~#t2297~0.base_9| 1) |v_#valid_33|) (not (= 0 |v_ULTIMATE.start_main_~#t2297~0.base_9|)) (= 0 (select |v_#valid_34| |v_ULTIMATE.start_main_~#t2297~0.base_9|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_3|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t2297~0.base=|v_ULTIMATE.start_main_~#t2297~0.base_9|, #length=|v_#length_13|, ULTIMATE.start_main_~#t2297~0.offset=|v_ULTIMATE.start_main_~#t2297~0.offset_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, ULTIMATE.start_main_~#t2297~0.base, #length, ULTIMATE.start_main_~#t2297~0.offset] because there is no mapped edge [2019-12-27 07:54:50,685 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [872] [872] P0ENTRY-->L4-3: Formula: (and (= |P0Thread1of1ForFork0_#in~arg.base_In-2015406696| P0Thread1of1ForFork0_~arg.base_Out-2015406696) (= 1 ~z$w_buff0~0_Out-2015406696) (= |P0Thread1of1ForFork0_#in~arg.offset_In-2015406696| P0Thread1of1ForFork0_~arg.offset_Out-2015406696) (= |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-2015406696| 1) (= ~z$w_buff0_used~0_Out-2015406696 1) (= ~z$w_buff1_used~0_Out-2015406696 ~z$w_buff0_used~0_In-2015406696) (= 0 (mod ~z$w_buff1_used~0_Out-2015406696 256)) (= ~z$w_buff0~0_In-2015406696 ~z$w_buff1~0_Out-2015406696) (= |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-2015406696| P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out-2015406696)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In-2015406696|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2015406696, ~z$w_buff0~0=~z$w_buff0~0_In-2015406696, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In-2015406696|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In-2015406696|, ~z$w_buff0_used~0=~z$w_buff0_used~0_Out-2015406696, ~z$w_buff0~0=~z$w_buff0~0_Out-2015406696, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out-2015406696, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out-2015406696, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In-2015406696|, ~z$w_buff1~0=~z$w_buff1~0_Out-2015406696, P0Thread1of1ForFork0_~arg.base=P0Thread1of1ForFork0_~arg.base_Out-2015406696, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-2015406696|, P0Thread1of1ForFork0_~arg.offset=P0Thread1of1ForFork0_~arg.offset_Out-2015406696} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~z$w_buff1~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-27 07:54:50,687 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [870] [870] L822-1-->L824: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t2298~0.offset_9|) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t2298~0.base_11| 4) |v_#length_17|) (= 0 (select |v_#valid_41| |v_ULTIMATE.start_main_~#t2298~0.base_11|)) (not (= |v_ULTIMATE.start_main_~#t2298~0.base_11| 0)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2298~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2298~0.base_11|) |v_ULTIMATE.start_main_~#t2298~0.offset_9| 2)) |v_#memory_int_15|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t2298~0.base_11|) (= (store |v_#valid_41| |v_ULTIMATE.start_main_~#t2298~0.base_11| 1) |v_#valid_40|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t2298~0.offset=|v_ULTIMATE.start_main_~#t2298~0.offset_9|, #length=|v_#length_17|, ULTIMATE.start_main_~#t2298~0.base=|v_ULTIMATE.start_main_~#t2298~0.base_11|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet45, #memory_int, ULTIMATE.start_main_~#t2298~0.offset, #length, ULTIMATE.start_main_~#t2298~0.base] because there is no mapped edge [2019-12-27 07:54:50,690 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [817] [817] L764-2-->L764-5: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd2~0_In90673623 256))) (.cse0 (= |P1Thread1of1ForFork1_#t~ite9_Out90673623| |P1Thread1of1ForFork1_#t~ite10_Out90673623|)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In90673623 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite9_Out90673623| ~z~0_In90673623) .cse0 (or .cse1 .cse2)) (and (= |P1Thread1of1ForFork1_#t~ite9_Out90673623| ~z$w_buff1~0_In90673623) (not .cse2) .cse0 (not .cse1)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In90673623, ~z$w_buff1_used~0=~z$w_buff1_used~0_In90673623, ~z$w_buff1~0=~z$w_buff1~0_In90673623, ~z~0=~z~0_In90673623} OutVars{P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out90673623|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In90673623, ~z$w_buff1_used~0=~z$w_buff1_used~0_In90673623, P1Thread1of1ForFork1_#t~ite10=|P1Thread1of1ForFork1_#t~ite10_Out90673623|, ~z$w_buff1~0=~z$w_buff1~0_In90673623, ~z~0=~z~0_In90673623} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10] because there is no mapped edge [2019-12-27 07:54:50,692 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L765-->L765-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-2132080097 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-2132080097 256)))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite11_Out-2132080097| 0)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite11_Out-2132080097| ~z$w_buff0_used~0_In-2132080097)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2132080097, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-2132080097} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-2132080097, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-2132080097|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-2132080097} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 07:54:50,696 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L766-->L766-2: Formula: (let ((.cse3 (= (mod ~z$r_buff1_thd2~0_In-2063502164 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In-2063502164 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-2063502164 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-2063502164 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite12_Out-2063502164|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~z$w_buff1_used~0_In-2063502164 |P1Thread1of1ForFork1_#t~ite12_Out-2063502164|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2063502164, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-2063502164, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2063502164, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-2063502164} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-2063502164, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-2063502164, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2063502164, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-2063502164|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-2063502164} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 07:54:50,697 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L767-->L767-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1685175423 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-1685175423 256)))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite13_Out-1685175423| 0)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite13_Out-1685175423| ~z$r_buff0_thd2~0_In-1685175423)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1685175423, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1685175423} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1685175423, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-1685175423|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1685175423} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-27 07:54:50,697 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [871] [871] L787-->L787-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In2069843247 256)))) (or (and (not .cse0) (= ~z$w_buff1~0_In2069843247 |P2Thread1of1ForFork2_#t~ite24_Out2069843247|) (= |P2Thread1of1ForFork2_#t~ite23_In2069843247| |P2Thread1of1ForFork2_#t~ite23_Out2069843247|)) (and (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In2069843247 256)))) (or (and (= 0 (mod ~z$r_buff1_thd3~0_In2069843247 256)) .cse1) (= 0 (mod ~z$w_buff0_used~0_In2069843247 256)) (and (= 0 (mod ~z$w_buff1_used~0_In2069843247 256)) .cse1))) (= |P2Thread1of1ForFork2_#t~ite23_Out2069843247| |P2Thread1of1ForFork2_#t~ite24_Out2069843247|) .cse0 (= ~z$w_buff1~0_In2069843247 |P2Thread1of1ForFork2_#t~ite23_Out2069843247|)))) InVars {P2Thread1of1ForFork2_#t~ite23=|P2Thread1of1ForFork2_#t~ite23_In2069843247|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2069843247, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In2069843247, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2069843247, ~z$w_buff1~0=~z$w_buff1~0_In2069843247, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2069843247, ~weak$$choice2~0=~weak$$choice2~0_In2069843247} OutVars{P2Thread1of1ForFork2_#t~ite23=|P2Thread1of1ForFork2_#t~ite23_Out2069843247|, P2Thread1of1ForFork2_#t~ite24=|P2Thread1of1ForFork2_#t~ite24_Out2069843247|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2069843247, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In2069843247, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2069843247, ~z$w_buff1~0=~z$w_buff1~0_In2069843247, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2069843247, ~weak$$choice2~0=~weak$$choice2~0_In2069843247} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite23, P2Thread1of1ForFork2_#t~ite24] because there is no mapped edge [2019-12-27 07:54:50,698 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [873] [873] L788-->L788-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1617366351 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite27_Out-1617366351| ~z$w_buff0_used~0_In-1617366351) (not .cse0) (= |P2Thread1of1ForFork2_#t~ite26_In-1617366351| |P2Thread1of1ForFork2_#t~ite26_Out-1617366351|)) (and .cse0 (= ~z$w_buff0_used~0_In-1617366351 |P2Thread1of1ForFork2_#t~ite26_Out-1617366351|) (= |P2Thread1of1ForFork2_#t~ite27_Out-1617366351| |P2Thread1of1ForFork2_#t~ite26_Out-1617366351|) (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In-1617366351 256) 0))) (or (and .cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-1617366351 256))) (= (mod ~z$w_buff0_used~0_In-1617366351 256) 0) (and (= 0 (mod ~z$w_buff1_used~0_In-1617366351 256)) .cse1)))))) InVars {P2Thread1of1ForFork2_#t~ite26=|P2Thread1of1ForFork2_#t~ite26_In-1617366351|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1617366351, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1617366351, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1617366351, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1617366351, ~weak$$choice2~0=~weak$$choice2~0_In-1617366351} OutVars{P2Thread1of1ForFork2_#t~ite26=|P2Thread1of1ForFork2_#t~ite26_Out-1617366351|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1617366351, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1617366351, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1617366351, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1617366351, ~weak$$choice2~0=~weak$$choice2~0_In-1617366351, P2Thread1of1ForFork2_#t~ite27=|P2Thread1of1ForFork2_#t~ite27_Out-1617366351|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite26, P2Thread1of1ForFork2_#t~ite27] because there is no mapped edge [2019-12-27 07:54:50,699 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L768-->L768-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff0_thd2~0_In2038970272 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In2038970272 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In2038970272 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In2038970272 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite14_Out2038970272| ~z$r_buff1_thd2~0_In2038970272) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork1_#t~ite14_Out2038970272|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2038970272, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In2038970272, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2038970272, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In2038970272} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2038970272, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In2038970272, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2038970272, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out2038970272|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In2038970272} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 07:54:50,700 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L768-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= v_~z$r_buff1_thd2~0_13 |v_P1Thread1of1ForFork1_#t~ite14_8|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_8|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_13, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_7|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 07:54:50,701 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] L789-->L789-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-872095199 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite30_Out-872095199| ~z$w_buff1_used~0_In-872095199) (not .cse0) (= |P2Thread1of1ForFork2_#t~ite29_In-872095199| |P2Thread1of1ForFork2_#t~ite29_Out-872095199|)) (and (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In-872095199 256) 0))) (or (and (= 0 (mod ~z$r_buff1_thd3~0_In-872095199 256)) .cse1) (= 0 (mod ~z$w_buff0_used~0_In-872095199 256)) (and .cse1 (= (mod ~z$w_buff1_used~0_In-872095199 256) 0)))) .cse0 (= |P2Thread1of1ForFork2_#t~ite30_Out-872095199| |P2Thread1of1ForFork2_#t~ite29_Out-872095199|) (= |P2Thread1of1ForFork2_#t~ite29_Out-872095199| ~z$w_buff1_used~0_In-872095199)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-872095199, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-872095199, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-872095199, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-872095199, ~weak$$choice2~0=~weak$$choice2~0_In-872095199, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_In-872095199|} OutVars{P2Thread1of1ForFork2_#t~ite30=|P2Thread1of1ForFork2_#t~ite30_Out-872095199|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-872095199, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-872095199, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-872095199, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-872095199, ~weak$$choice2~0=~weak$$choice2~0_In-872095199, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out-872095199|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite30, P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-27 07:54:50,702 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L790-->L791: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_15 256))) (= v_~z$r_buff0_thd3~0_52 v_~z$r_buff0_thd3~0_51)) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_52, ~weak$$choice2~0=v_~weak$$choice2~0_15} OutVars{P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_8|, P2Thread1of1ForFork2_#t~ite33=|v_P2Thread1of1ForFork2_#t~ite33_9|, P2Thread1of1ForFork2_#t~ite32=|v_P2Thread1of1ForFork2_#t~ite32_9|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_51, ~weak$$choice2~0=v_~weak$$choice2~0_15} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31, P2Thread1of1ForFork2_#t~ite33, P2Thread1of1ForFork2_#t~ite32, ~z$r_buff0_thd3~0] because there is no mapped edge [2019-12-27 07:54:50,704 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L793-->L797: Formula: (and (= 0 v_~z$flush_delayed~0_6) (not (= 0 (mod v_~z$flush_delayed~0_7 256))) (= v_~z~0_18 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_7} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_5, P2Thread1of1ForFork2_#t~ite37=|v_P2Thread1of1ForFork2_#t~ite37_7|, ~z$flush_delayed~0=v_~z$flush_delayed~0_6, ~z~0=v_~z~0_18} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-27 07:54:50,706 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L745-->L745-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd1~0_In-114734470 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-114734470 256) 0))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-114734470|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out-114734470| ~z$w_buff0_used~0_In-114734470)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-114734470, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-114734470} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-114734470|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-114734470, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-114734470} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 07:54:50,707 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [818] [818] L746-->L746-2: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In-1820527528 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd1~0_In-1820527528 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-1820527528 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd1~0_In-1820527528 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-1820527528|)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |P0Thread1of1ForFork0_#t~ite6_Out-1820527528| ~z$w_buff1_used~0_In-1820527528)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1820527528, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1820527528, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1820527528, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1820527528} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1820527528|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1820527528, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1820527528, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1820527528, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1820527528} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 07:54:50,708 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L747-->L748: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In-1940405924 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-1940405924 256) 0))) (or (and (= 0 ~z$r_buff0_thd1~0_Out-1940405924) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd1~0_In-1940405924 ~z$r_buff0_thd1~0_Out-1940405924)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1940405924, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1940405924} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1940405924, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1940405924|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-1940405924} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 07:54:50,708 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L748-->L748-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In-2117947749 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-2117947749 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd1~0_In-2117947749 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-2117947749 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite8_Out-2117947749| 0)) (and (or .cse1 .cse0) (= |P0Thread1of1ForFork0_#t~ite8_Out-2117947749| ~z$r_buff1_thd1~0_In-2117947749) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2117947749, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-2117947749, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2117947749, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-2117947749} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-2117947749, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-2117947749|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-2117947749, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2117947749, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-2117947749} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 07:54:50,709 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [860] [860] L748-2-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= |v_P0Thread1of1ForFork0_#t~ite8_8| v_~z$r_buff1_thd1~0_12) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_12, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 07:54:50,709 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L797-2-->L797-5: Formula: (let ((.cse0 (= |P2Thread1of1ForFork2_#t~ite38_Out-288861651| |P2Thread1of1ForFork2_#t~ite39_Out-288861651|)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-288861651 256))) (.cse1 (= (mod ~z$r_buff1_thd3~0_In-288861651 256) 0))) (or (and .cse0 (not .cse1) (= |P2Thread1of1ForFork2_#t~ite38_Out-288861651| ~z$w_buff1~0_In-288861651) (not .cse2)) (and .cse0 (= |P2Thread1of1ForFork2_#t~ite38_Out-288861651| ~z~0_In-288861651) (or .cse2 .cse1)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-288861651, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-288861651, ~z$w_buff1~0=~z$w_buff1~0_In-288861651, ~z~0=~z~0_In-288861651} OutVars{~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-288861651, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-288861651, ~z$w_buff1~0=~z$w_buff1~0_In-288861651, ~z~0=~z~0_In-288861651, P2Thread1of1ForFork2_#t~ite39=|P2Thread1of1ForFork2_#t~ite39_Out-288861651|, P2Thread1of1ForFork2_#t~ite38=|P2Thread1of1ForFork2_#t~ite38_Out-288861651|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite39, P2Thread1of1ForFork2_#t~ite38] because there is no mapped edge [2019-12-27 07:54:50,710 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L798-->L798-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-1513547133 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1513547133 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite40_Out-1513547133| ~z$w_buff0_used~0_In-1513547133)) (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite40_Out-1513547133| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1513547133, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1513547133} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1513547133, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1513547133, P2Thread1of1ForFork2_#t~ite40=|P2Thread1of1ForFork2_#t~ite40_Out-1513547133|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite40] because there is no mapped edge [2019-12-27 07:54:50,710 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] L799-->L799-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In-2013378894 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In-2013378894 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In-2013378894 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd3~0_In-2013378894 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork2_#t~ite41_Out-2013378894| ~z$w_buff1_used~0_In-2013378894)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork2_#t~ite41_Out-2013378894| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2013378894, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-2013378894, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2013378894, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2013378894} OutVars{P2Thread1of1ForFork2_#t~ite41=|P2Thread1of1ForFork2_#t~ite41_Out-2013378894|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2013378894, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-2013378894, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2013378894, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2013378894} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite41] because there is no mapped edge [2019-12-27 07:54:50,711 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [815] [815] L800-->L800-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In1089836311 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1089836311 256)))) (or (and (= ~z$r_buff0_thd3~0_In1089836311 |P2Thread1of1ForFork2_#t~ite42_Out1089836311|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |P2Thread1of1ForFork2_#t~ite42_Out1089836311|) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1089836311, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1089836311} OutVars{P2Thread1of1ForFork2_#t~ite42=|P2Thread1of1ForFork2_#t~ite42_Out1089836311|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1089836311, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1089836311} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite42] because there is no mapped edge [2019-12-27 07:54:50,712 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L801-->L801-2: Formula: (let ((.cse2 (= (mod ~z$r_buff0_thd3~0_In1600953929 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In1600953929 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In1600953929 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In1600953929 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork2_#t~ite43_Out1600953929|)) (and (or .cse2 .cse3) (= ~z$r_buff1_thd3~0_In1600953929 |P2Thread1of1ForFork2_#t~ite43_Out1600953929|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1600953929, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1600953929, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1600953929, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1600953929} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1600953929, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1600953929, P2Thread1of1ForFork2_#t~ite43=|P2Thread1of1ForFork2_#t~ite43_Out1600953929|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1600953929, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1600953929} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite43] because there is no mapped edge [2019-12-27 07:54:50,712 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [858] [858] L801-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= |v_P2Thread1of1ForFork2_#t~ite43_8| v_~z$r_buff1_thd3~0_42) (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0)) InVars {P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_42, P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_7|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite43, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-27 07:54:50,712 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L824-1-->L830: Formula: (and (= v_~__unbuffered_cnt~0_9 3) (= v_~main$tmp_guard0~0_5 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, ~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:54:50,713 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L830-2-->L830-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite48_Out1734649018| |ULTIMATE.start_main_#t~ite47_Out1734649018|)) (.cse2 (= (mod ~z$w_buff1_used~0_In1734649018 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd0~0_In1734649018 256) 0))) (or (and .cse0 (or .cse1 .cse2) (= ~z~0_In1734649018 |ULTIMATE.start_main_#t~ite47_Out1734649018|)) (and .cse0 (= ~z$w_buff1~0_In1734649018 |ULTIMATE.start_main_#t~ite47_Out1734649018|) (not .cse2) (not .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1734649018, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1734649018, ~z$w_buff1~0=~z$w_buff1~0_In1734649018, ~z~0=~z~0_In1734649018} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1734649018, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out1734649018|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1734649018, ~z$w_buff1~0=~z$w_buff1~0_In1734649018, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out1734649018|, ~z~0=~z~0_In1734649018} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 07:54:50,714 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L831-->L831-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-470809631 256))) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-470809631 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-470809631 |ULTIMATE.start_main_#t~ite49_Out-470809631|)) (and (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite49_Out-470809631|) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-470809631, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-470809631} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-470809631, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-470809631, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-470809631|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 07:54:50,715 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L832-->L832-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In594348825 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In594348825 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In594348825 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In594348825 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite50_Out594348825| 0)) (and (= |ULTIMATE.start_main_#t~ite50_Out594348825| ~z$w_buff1_used~0_In594348825) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In594348825, ~z$w_buff0_used~0=~z$w_buff0_used~0_In594348825, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In594348825, ~z$w_buff1_used~0=~z$w_buff1_used~0_In594348825} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out594348825|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In594348825, ~z$w_buff0_used~0=~z$w_buff0_used~0_In594348825, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In594348825, ~z$w_buff1_used~0=~z$w_buff1_used~0_In594348825} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 07:54:50,716 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L833-->L833-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In13054458 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In13054458 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite51_Out13054458| ~z$r_buff0_thd0~0_In13054458)) (and (= |ULTIMATE.start_main_#t~ite51_Out13054458| 0) (not .cse0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In13054458, ~z$w_buff0_used~0=~z$w_buff0_used~0_In13054458} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In13054458, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out13054458|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In13054458} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 07:54:50,718 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L834-->L834-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff0_used~0_In575569122 256))) (.cse3 (= (mod ~z$r_buff0_thd0~0_In575569122 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In575569122 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In575569122 256)))) (or (and (= ~z$r_buff1_thd0~0_In575569122 |ULTIMATE.start_main_#t~ite52_Out575569122|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite52_Out575569122|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In575569122, ~z$w_buff0_used~0=~z$w_buff0_used~0_In575569122, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In575569122, ~z$w_buff1_used~0=~z$w_buff1_used~0_In575569122} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out575569122|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In575569122, ~z$w_buff0_used~0=~z$w_buff0_used~0_In575569122, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In575569122, ~z$w_buff1_used~0=~z$w_buff1_used~0_In575569122} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 07:54:50,718 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [881] [881] L834-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~__unbuffered_p2_EAX~0_8 1) (= v_~main$tmp_guard1~0_9 0) (= 2 v_~x~0_8) (= |v_ULTIMATE.start_main_#t~ite52_10| v_~z$r_buff1_thd0~0_16) (= v_~__unbuffered_p2_EBX~0_8 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 0)) InVars {ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_10|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_8, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~x~0=v_~x~0_8} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_9|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_8, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_16, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~x~0=v_~x~0_8, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} 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:54:50,800 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 07:54:50 BasicIcfg [2019-12-27 07:54:50,800 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 07:54:50,801 INFO L168 Benchmark]: Toolchain (without parser) took 110888.27 ms. Allocated memory was 137.4 MB in the beginning and 4.2 GB in the end (delta: 4.1 GB). Free memory was 100.7 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 3.0 GB. Max. memory is 7.1 GB. [2019-12-27 07:54:50,802 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 137.4 MB. Free memory was 120.6 MB in the beginning and 120.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 07:54:50,803 INFO L168 Benchmark]: CACSL2BoogieTranslator took 809.50 ms. Allocated memory was 137.4 MB in the beginning and 201.9 MB in the end (delta: 64.5 MB). Free memory was 100.3 MB in the beginning and 155.2 MB in the end (delta: -54.9 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. [2019-12-27 07:54:50,803 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.10 ms. Allocated memory is still 201.9 MB. Free memory was 155.2 MB in the beginning and 152.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 07:54:50,804 INFO L168 Benchmark]: Boogie Preprocessor took 42.46 ms. Allocated memory is still 201.9 MB. Free memory was 152.5 MB in the beginning and 149.7 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 07:54:50,804 INFO L168 Benchmark]: RCFGBuilder took 847.10 ms. Allocated memory is still 201.9 MB. Free memory was 149.7 MB in the beginning and 99.9 MB in the end (delta: 49.8 MB). Peak memory consumption was 49.8 MB. Max. memory is 7.1 GB. [2019-12-27 07:54:50,805 INFO L168 Benchmark]: TraceAbstraction took 109124.01 ms. Allocated memory was 201.9 MB in the beginning and 4.2 GB in the end (delta: 4.0 GB). Free memory was 99.2 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.9 GB. Max. memory is 7.1 GB. [2019-12-27 07:54:50,807 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 137.4 MB. Free memory was 120.6 MB in the beginning and 120.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 809.50 ms. Allocated memory was 137.4 MB in the beginning and 201.9 MB in the end (delta: 64.5 MB). Free memory was 100.3 MB in the beginning and 155.2 MB in the end (delta: -54.9 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 59.10 ms. Allocated memory is still 201.9 MB. Free memory was 155.2 MB in the beginning and 152.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.46 ms. Allocated memory is still 201.9 MB. Free memory was 152.5 MB in the beginning and 149.7 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 847.10 ms. Allocated memory is still 201.9 MB. Free memory was 149.7 MB in the beginning and 99.9 MB in the end (delta: 49.8 MB). Peak memory consumption was 49.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 109124.01 ms. Allocated memory was 201.9 MB in the beginning and 4.2 GB in the end (delta: 4.0 GB). Free memory was 99.2 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.9 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.1s, 175 ProgramPointsBefore, 92 ProgramPointsAfterwards, 212 TransitionsBefore, 101 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 32 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 32 ChoiceCompositions, 6847 VarBasedMoverChecksPositive, 231 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 80960 CheckedPairsTotal, 113 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L820] FCALL, FORK 0 pthread_create(&t2296, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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] [L734] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L735] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L736] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L737] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L738] 1 z$r_buff0_thd1 = (_Bool)1 [L741] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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] [L744] 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_p2_EAX=0, __unbuffered_p2_EBX=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] [L822] FCALL, FORK 0 pthread_create(&t2297, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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] [L824] FCALL, FORK 0 pthread_create(&t2298, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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] [L758] 2 x = 2 [L761] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=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] [L764] EXPR 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_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=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] [L764] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L778] 3 __unbuffered_p2_EAX = y [L781] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L782] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L783] 3 z$flush_delayed = weak$$choice2 [L784] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=7, x=2, y=1, z=0, z$flush_delayed=7, 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] [L785] 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_p2_EAX=1, __unbuffered_p2_EBX=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=7, x=2, y=1, z=0, z$flush_delayed=7, 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$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] 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) [L765] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L786] 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_p2_EAX=1, __unbuffered_p2_EBX=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=7, 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=2, y=1, z=0, z$flush_delayed=7, 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_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L786] 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)) [L787] 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)) [L767] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L788] 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)) [L789] 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)) [L791] 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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=7, 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=2, y=1, z=0, z$flush_delayed=7, 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] [L791] 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)) [L792] 3 __unbuffered_p2_EBX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=7, x=2, y=1, z=0, z$flush_delayed=7, 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] [L797] 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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=7, x=2, 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=1, z$w_buff1=0, z$w_buff1_used=0] [L744] 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) [L745] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L746] 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 [L797] 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) [L798] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L799] 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 [L800] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L830] 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_p2_EAX=1, __unbuffered_p2_EBX=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=7, x=2, y=1, z=1, 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] [L830] 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) [L831] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L832] 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 [L833] 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, 166 locations, 2 error locations. Result: UNSAFE, OverallTime: 108.8s, OverallIterations: 33, TraceHistogramMax: 1, AutomataDifference: 36.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7376 SDtfs, 8507 SDslu, 24723 SDs, 0 SdLazy, 17716 SolverSat, 416 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 430 GetRequests, 68 SyntacticMatches, 31 SemanticMatches, 331 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1814 ImplicationChecksByTransitivity, 4.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=145638occurred 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.8s AutomataMinimizationTime, 32 MinimizatonAttempts, 330889 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 1646 NumberOfCodeBlocks, 1646 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 1547 ConstructedInterpolants, 0 QuantifiedInterpolants, 329334 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 32 InterpolantComputations, 32 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...