/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/mix006_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 20:05:25,659 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 20:05:25,661 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 20:05:25,678 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 20:05:25,679 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 20:05:25,680 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 20:05:25,681 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 20:05:25,683 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 20:05:25,685 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 20:05:25,686 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 20:05:25,687 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 20:05:25,688 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 20:05:25,688 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 20:05:25,689 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 20:05:25,690 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 20:05:25,691 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 20:05:25,692 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 20:05:25,693 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 20:05:25,694 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 20:05:25,696 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 20:05:25,698 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 20:05:25,699 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 20:05:25,700 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 20:05:25,701 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 20:05:25,703 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 20:05:25,704 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 20:05:25,704 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 20:05:25,705 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 20:05:25,705 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 20:05:25,706 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 20:05:25,706 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 20:05:25,707 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 20:05:25,708 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 20:05:25,709 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 20:05:25,710 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 20:05:25,710 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 20:05:25,711 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 20:05:25,711 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 20:05:25,711 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 20:05:25,712 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 20:05:25,713 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 20:05:25,713 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-18 20:05:25,740 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 20:05:25,740 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 20:05:25,741 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 20:05:25,742 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 20:05:25,742 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 20:05:25,743 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 20:05:25,743 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 20:05:25,743 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 20:05:25,743 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 20:05:25,743 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 20:05:25,744 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 20:05:25,744 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 20:05:25,744 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 20:05:25,744 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 20:05:25,744 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 20:05:25,745 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 20:05:25,746 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 20:05:25,746 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 20:05:25,746 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 20:05:25,747 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 20:05:25,747 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 20:05:25,747 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 20:05:25,747 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 20:05:25,748 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 20:05:25,748 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 20:05:25,748 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 20:05:25,748 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 20:05:25,748 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 20:05:25,749 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 20:05:25,749 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 20:05:26,065 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 20:05:26,091 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 20:05:26,095 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 20:05:26,097 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 20:05:26,098 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 20:05:26,099 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix006_power.oepc.i [2019-12-18 20:05:26,167 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a90ea7f27/2127a8c22e714eaf90dafa182f1a6e49/FLAGa1fa9f47a [2019-12-18 20:05:26,751 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 20:05:26,752 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix006_power.oepc.i [2019-12-18 20:05:26,778 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a90ea7f27/2127a8c22e714eaf90dafa182f1a6e49/FLAGa1fa9f47a [2019-12-18 20:05:27,071 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a90ea7f27/2127a8c22e714eaf90dafa182f1a6e49 [2019-12-18 20:05:27,081 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 20:05:27,082 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 20:05:27,083 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 20:05:27,083 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 20:05:27,087 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 20:05:27,088 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 08:05:27" (1/1) ... [2019-12-18 20:05:27,091 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1aedea21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:05:27, skipping insertion in model container [2019-12-18 20:05:27,091 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 08:05:27" (1/1) ... [2019-12-18 20:05:27,099 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 20:05:27,164 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 20:05:27,723 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 20:05:27,738 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 20:05:27,802 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 20:05:27,900 INFO L208 MainTranslator]: Completed translation [2019-12-18 20:05:27,901 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:05:27 WrapperNode [2019-12-18 20:05:27,901 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 20:05:27,902 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 20:05:27,902 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 20:05:27,902 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 20:05:27,911 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:05:27" (1/1) ... [2019-12-18 20:05:27,950 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:05:27" (1/1) ... [2019-12-18 20:05:27,985 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 20:05:27,986 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 20:05:27,986 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 20:05:27,986 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 20:05:28,003 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:05:27" (1/1) ... [2019-12-18 20:05:28,003 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:05:27" (1/1) ... [2019-12-18 20:05:28,009 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:05:27" (1/1) ... [2019-12-18 20:05:28,010 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:05:27" (1/1) ... [2019-12-18 20:05:28,021 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:05:27" (1/1) ... [2019-12-18 20:05:28,025 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:05:27" (1/1) ... [2019-12-18 20:05:28,031 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:05:27" (1/1) ... [2019-12-18 20:05:28,039 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 20:05:28,040 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 20:05:28,040 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 20:05:28,040 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 20:05:28,050 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:05:27" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 20:05:28,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 20:05:28,107 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 20:05:28,107 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 20:05:28,108 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 20:05:28,108 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 20:05:28,109 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 20:05:28,109 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 20:05:28,109 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 20:05:28,109 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 20:05:28,109 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 20:05:28,110 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 20:05:28,110 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 20:05:28,110 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 20:05:28,112 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 20:05:28,918 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 20:05:28,919 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 20:05:28,920 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 08:05:28 BoogieIcfgContainer [2019-12-18 20:05:28,920 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 20:05:28,921 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 20:05:28,922 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 20:05:28,925 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 20:05:28,925 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 08:05:27" (1/3) ... [2019-12-18 20:05:28,926 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e4d1dc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 08:05:28, skipping insertion in model container [2019-12-18 20:05:28,927 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:05:27" (2/3) ... [2019-12-18 20:05:28,928 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e4d1dc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 08:05:28, skipping insertion in model container [2019-12-18 20:05:28,928 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 08:05:28" (3/3) ... [2019-12-18 20:05:28,930 INFO L109 eAbstractionObserver]: Analyzing ICFG mix006_power.oepc.i [2019-12-18 20:05:28,941 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 20:05:28,941 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 20:05:28,949 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 20:05:28,950 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 20:05:28,993 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:28,994 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:28,994 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:28,994 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:28,994 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:28,994 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:28,995 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:28,995 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:28,996 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:28,996 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:28,996 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:28,996 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:28,997 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:28,997 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:28,997 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:28,997 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:28,998 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:28,998 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:28,998 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:28,998 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:28,999 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:28,999 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:28,999 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:28,999 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,000 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,000 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,000 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,000 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,001 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,001 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,001 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,001 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,002 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,002 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,003 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,003 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,009 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,009 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,009 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,009 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,012 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,012 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,012 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,012 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,012 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,013 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,013 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,013 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,030 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,032 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,033 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,033 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,033 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,033 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,033 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,034 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,034 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,034 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,034 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,035 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,035 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,035 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,035 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,035 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,036 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,036 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,036 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,036 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,036 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,037 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,037 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,037 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,037 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,037 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,038 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,038 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,038 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,038 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,038 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,039 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,039 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,039 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,039 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,040 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,040 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,040 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,040 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,040 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,041 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,041 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,041 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,041 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,041 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,041 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,042 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,042 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,042 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,042 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,042 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,043 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,043 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,043 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,043 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,043 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,044 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,044 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,044 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,044 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,044 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,045 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,045 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,045 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,045 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,045 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,045 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,046 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,046 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,046 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,046 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,046 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,047 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,047 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,047 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,047 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,047 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,048 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,048 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,048 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,048 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,048 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,049 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,049 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,049 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,049 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,049 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,050 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,050 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,050 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,050 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,050 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,051 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,051 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,051 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,051 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,051 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,052 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,052 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,052 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,052 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,052 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,053 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,053 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,053 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,053 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,060 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,061 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,061 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,061 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,061 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,062 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,062 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,062 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,062 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,063 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,063 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,064 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,064 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,064 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,064 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,064 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,065 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,065 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,065 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,065 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,065 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,066 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,066 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,066 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,066 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,066 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,067 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,067 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,068 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,068 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,068 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,068 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,069 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,073 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,073 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,073 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,074 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,080 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,080 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,081 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,081 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,081 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,081 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,081 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,082 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,084 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,084 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,085 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,085 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,085 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,085 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,085 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,085 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:29,103 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 20:05:29,124 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 20:05:29,124 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 20:05:29,125 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 20:05:29,125 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 20:05:29,125 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 20:05:29,125 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 20:05:29,125 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 20:05:29,125 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 20:05:29,142 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 177 places, 214 transitions [2019-12-18 20:05:29,144 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 214 transitions [2019-12-18 20:05:29,253 INFO L126 PetriNetUnfolder]: 47/211 cut-off events. [2019-12-18 20:05:29,254 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 20:05:29,279 INFO L76 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 211 events. 47/211 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 436 event pairs. 9/171 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 20:05:29,306 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 214 transitions [2019-12-18 20:05:29,369 INFO L126 PetriNetUnfolder]: 47/211 cut-off events. [2019-12-18 20:05:29,370 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 20:05:29,378 INFO L76 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 211 events. 47/211 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 436 event pairs. 9/171 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 20:05:29,399 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-18 20:05:29,401 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 20:05:33,006 WARN L192 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-12-18 20:05:33,144 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-18 20:05:33,174 INFO L206 etLargeBlockEncoding]: Checked pairs total: 82443 [2019-12-18 20:05:33,175 INFO L214 etLargeBlockEncoding]: Total number of compositions: 112 [2019-12-18 20:05:33,179 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 95 places, 105 transitions [2019-12-18 20:05:53,396 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 120992 states. [2019-12-18 20:05:53,398 INFO L276 IsEmpty]: Start isEmpty. Operand 120992 states. [2019-12-18 20:05:53,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 20:05:53,404 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:05:53,405 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 20:05:53,405 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:05:53,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:05:53,411 INFO L82 PathProgramCache]: Analyzing trace with hash 913992, now seen corresponding path program 1 times [2019-12-18 20:05:53,418 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:05:53,418 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072890506] [2019-12-18 20:05:53,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:05:53,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:05:53,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:05:53,610 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072890506] [2019-12-18 20:05:53,611 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:05:53,611 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 20:05:53,612 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157339241] [2019-12-18 20:05:53,617 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:05:53,617 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:05:53,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:05:53,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:05:53,635 INFO L87 Difference]: Start difference. First operand 120992 states. Second operand 3 states. [2019-12-18 20:05:56,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:05:56,039 INFO L93 Difference]: Finished difference Result 119518 states and 508908 transitions. [2019-12-18 20:05:56,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:05:56,041 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 20:05:56,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:05:56,615 INFO L225 Difference]: With dead ends: 119518 [2019-12-18 20:05:56,615 INFO L226 Difference]: Without dead ends: 112056 [2019-12-18 20:05:56,622 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:06:03,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112056 states. [2019-12-18 20:06:08,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112056 to 112056. [2019-12-18 20:06:08,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112056 states. [2019-12-18 20:06:09,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112056 states to 112056 states and 476484 transitions. [2019-12-18 20:06:09,409 INFO L78 Accepts]: Start accepts. Automaton has 112056 states and 476484 transitions. Word has length 3 [2019-12-18 20:06:09,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:06:09,410 INFO L462 AbstractCegarLoop]: Abstraction has 112056 states and 476484 transitions. [2019-12-18 20:06:09,410 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:06:09,410 INFO L276 IsEmpty]: Start isEmpty. Operand 112056 states and 476484 transitions. [2019-12-18 20:06:09,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 20:06:09,413 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:06:09,413 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:06:09,414 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:06:09,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:06:09,414 INFO L82 PathProgramCache]: Analyzing trace with hash -224245043, now seen corresponding path program 1 times [2019-12-18 20:06:09,414 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:06:09,415 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443229592] [2019-12-18 20:06:09,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:06:09,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:06:09,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-18 20:06:09,552 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443229592] [2019-12-18 20:06:09,552 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:06:09,552 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:06:09,553 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805906668] [2019-12-18 20:06:09,554 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:06:09,554 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:06:09,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:06:09,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:06:09,555 INFO L87 Difference]: Start difference. First operand 112056 states and 476484 transitions. Second operand 4 states. [2019-12-18 20:06:15,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:06:15,179 INFO L93 Difference]: Finished difference Result 173434 states and 704626 transitions. [2019-12-18 20:06:15,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 20:06:15,180 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 20:06:15,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:06:15,927 INFO L225 Difference]: With dead ends: 173434 [2019-12-18 20:06:15,927 INFO L226 Difference]: Without dead ends: 173385 [2019-12-18 20:06:15,928 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:06:21,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173385 states. [2019-12-18 20:06:24,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173385 to 158867. [2019-12-18 20:06:24,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158867 states. [2019-12-18 20:06:25,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158867 states to 158867 states and 654272 transitions. [2019-12-18 20:06:25,796 INFO L78 Accepts]: Start accepts. Automaton has 158867 states and 654272 transitions. Word has length 11 [2019-12-18 20:06:25,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:06:25,796 INFO L462 AbstractCegarLoop]: Abstraction has 158867 states and 654272 transitions. [2019-12-18 20:06:25,796 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:06:25,797 INFO L276 IsEmpty]: Start isEmpty. Operand 158867 states and 654272 transitions. [2019-12-18 20:06:25,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 20:06:25,804 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:06:25,804 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:06:25,804 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:06:25,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:06:25,805 INFO L82 PathProgramCache]: Analyzing trace with hash 703391521, now seen corresponding path program 1 times [2019-12-18 20:06:25,805 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:06:25,805 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227977408] [2019-12-18 20:06:25,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:06:25,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:06:25,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:06:25,896 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227977408] [2019-12-18 20:06:25,898 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:06:25,898 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:06:25,898 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343118811] [2019-12-18 20:06:25,899 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:06:25,899 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:06:25,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:06:25,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:06:25,900 INFO L87 Difference]: Start difference. First operand 158867 states and 654272 transitions. Second operand 3 states. [2019-12-18 20:06:26,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:06:26,035 INFO L93 Difference]: Finished difference Result 34345 states and 110990 transitions. [2019-12-18 20:06:26,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:06:26,035 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 20:06:26,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:06:26,093 INFO L225 Difference]: With dead ends: 34345 [2019-12-18 20:06:26,094 INFO L226 Difference]: Without dead ends: 34345 [2019-12-18 20:06:26,094 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:06:26,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34345 states. [2019-12-18 20:06:26,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34345 to 34345. [2019-12-18 20:06:26,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34345 states. [2019-12-18 20:06:26,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34345 states to 34345 states and 110990 transitions. [2019-12-18 20:06:26,692 INFO L78 Accepts]: Start accepts. Automaton has 34345 states and 110990 transitions. Word has length 13 [2019-12-18 20:06:26,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:06:26,693 INFO L462 AbstractCegarLoop]: Abstraction has 34345 states and 110990 transitions. [2019-12-18 20:06:26,693 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:06:26,693 INFO L276 IsEmpty]: Start isEmpty. Operand 34345 states and 110990 transitions. [2019-12-18 20:06:26,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 20:06:26,695 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:06:26,695 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:06:26,696 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:06:26,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:06:26,696 INFO L82 PathProgramCache]: Analyzing trace with hash -1949648440, now seen corresponding path program 1 times [2019-12-18 20:06:26,696 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:06:26,696 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747733322] [2019-12-18 20:06:26,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:06:26,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:06:26,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:06:26,795 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747733322] [2019-12-18 20:06:26,795 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:06:26,795 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:06:26,796 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511037661] [2019-12-18 20:06:26,796 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:06:26,796 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:06:26,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:06:26,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:06:26,797 INFO L87 Difference]: Start difference. First operand 34345 states and 110990 transitions. Second operand 4 states. [2019-12-18 20:06:28,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:06:28,898 INFO L93 Difference]: Finished difference Result 41968 states and 135253 transitions. [2019-12-18 20:06:28,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 20:06:28,899 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 20:06:28,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:06:28,966 INFO L225 Difference]: With dead ends: 41968 [2019-12-18 20:06:28,966 INFO L226 Difference]: Without dead ends: 41968 [2019-12-18 20:06:28,967 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:06:29,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41968 states. [2019-12-18 20:06:29,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41968 to 37815. [2019-12-18 20:06:29,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37815 states. [2019-12-18 20:06:29,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37815 states to 37815 states and 122278 transitions. [2019-12-18 20:06:29,661 INFO L78 Accepts]: Start accepts. Automaton has 37815 states and 122278 transitions. Word has length 16 [2019-12-18 20:06:29,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:06:29,662 INFO L462 AbstractCegarLoop]: Abstraction has 37815 states and 122278 transitions. [2019-12-18 20:06:29,662 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:06:29,662 INFO L276 IsEmpty]: Start isEmpty. Operand 37815 states and 122278 transitions. [2019-12-18 20:06:29,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 20:06:29,672 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:06:29,672 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-18 20:06:29,673 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:06:29,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:06:29,673 INFO L82 PathProgramCache]: Analyzing trace with hash -1390855021, now seen corresponding path program 1 times [2019-12-18 20:06:29,673 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:06:29,674 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538480866] [2019-12-18 20:06:29,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:06:29,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:06:29,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:06:29,804 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538480866] [2019-12-18 20:06:29,804 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:06:29,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:06:29,805 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485405650] [2019-12-18 20:06:29,805 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:06:29,805 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:06:29,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:06:29,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:06:29,806 INFO L87 Difference]: Start difference. First operand 37815 states and 122278 transitions. Second operand 5 states. [2019-12-18 20:06:30,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:06:30,490 INFO L93 Difference]: Finished difference Result 48568 states and 154032 transitions. [2019-12-18 20:06:30,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 20:06:30,490 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 20:06:30,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:06:30,573 INFO L225 Difference]: With dead ends: 48568 [2019-12-18 20:06:30,573 INFO L226 Difference]: Without dead ends: 48561 [2019-12-18 20:06:30,574 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 20:06:30,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48561 states. [2019-12-18 20:06:31,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48561 to 37245. [2019-12-18 20:06:31,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37245 states. [2019-12-18 20:06:31,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37245 states to 37245 states and 120198 transitions. [2019-12-18 20:06:31,840 INFO L78 Accepts]: Start accepts. Automaton has 37245 states and 120198 transitions. Word has length 22 [2019-12-18 20:06:31,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:06:31,840 INFO L462 AbstractCegarLoop]: Abstraction has 37245 states and 120198 transitions. [2019-12-18 20:06:31,840 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:06:31,840 INFO L276 IsEmpty]: Start isEmpty. Operand 37245 states and 120198 transitions. [2019-12-18 20:06:31,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 20:06:31,852 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:06:31,852 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:06:31,852 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:06:31,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:06:31,853 INFO L82 PathProgramCache]: Analyzing trace with hash 896315521, now seen corresponding path program 1 times [2019-12-18 20:06:31,853 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:06:31,853 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201268523] [2019-12-18 20:06:31,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:06:31,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:06:31,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:06:31,916 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201268523] [2019-12-18 20:06:31,916 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:06:31,916 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:06:31,916 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373247534] [2019-12-18 20:06:31,918 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:06:31,919 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:06:31,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:06:31,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:06:31,919 INFO L87 Difference]: Start difference. First operand 37245 states and 120198 transitions. Second operand 4 states. [2019-12-18 20:06:31,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:06:31,985 INFO L93 Difference]: Finished difference Result 14946 states and 45537 transitions. [2019-12-18 20:06:31,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 20:06:31,986 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 20:06:31,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:06:32,007 INFO L225 Difference]: With dead ends: 14946 [2019-12-18 20:06:32,007 INFO L226 Difference]: Without dead ends: 14946 [2019-12-18 20:06:32,008 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:06:32,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14946 states. [2019-12-18 20:06:32,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14946 to 14702. [2019-12-18 20:06:32,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14702 states. [2019-12-18 20:06:32,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14702 states to 14702 states and 44841 transitions. [2019-12-18 20:06:32,233 INFO L78 Accepts]: Start accepts. Automaton has 14702 states and 44841 transitions. Word has length 25 [2019-12-18 20:06:32,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:06:32,233 INFO L462 AbstractCegarLoop]: Abstraction has 14702 states and 44841 transitions. [2019-12-18 20:06:32,233 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:06:32,234 INFO L276 IsEmpty]: Start isEmpty. Operand 14702 states and 44841 transitions. [2019-12-18 20:06:32,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 20:06:32,244 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:06:32,244 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-18 20:06:32,244 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:06:32,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:06:32,245 INFO L82 PathProgramCache]: Analyzing trace with hash 1170080207, now seen corresponding path program 1 times [2019-12-18 20:06:32,245 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:06:32,245 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106505676] [2019-12-18 20:06:32,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:06:32,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:06:32,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:06:32,296 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106505676] [2019-12-18 20:06:32,296 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:06:32,297 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:06:32,297 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222661038] [2019-12-18 20:06:32,298 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:06:32,298 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:06:32,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:06:32,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:06:32,298 INFO L87 Difference]: Start difference. First operand 14702 states and 44841 transitions. Second operand 3 states. [2019-12-18 20:06:32,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:06:32,387 INFO L93 Difference]: Finished difference Result 21048 states and 63094 transitions. [2019-12-18 20:06:32,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:06:32,387 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-18 20:06:32,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:06:32,416 INFO L225 Difference]: With dead ends: 21048 [2019-12-18 20:06:32,416 INFO L226 Difference]: Without dead ends: 21048 [2019-12-18 20:06:32,416 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:06:32,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21048 states. [2019-12-18 20:06:32,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21048 to 15496. [2019-12-18 20:06:32,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15496 states. [2019-12-18 20:06:32,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15496 states to 15496 states and 47121 transitions. [2019-12-18 20:06:32,688 INFO L78 Accepts]: Start accepts. Automaton has 15496 states and 47121 transitions. Word has length 27 [2019-12-18 20:06:32,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:06:32,689 INFO L462 AbstractCegarLoop]: Abstraction has 15496 states and 47121 transitions. [2019-12-18 20:06:32,689 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:06:32,689 INFO L276 IsEmpty]: Start isEmpty. Operand 15496 states and 47121 transitions. [2019-12-18 20:06:32,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 20:06:32,699 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:06:32,699 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-18 20:06:32,700 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:06:32,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:06:32,700 INFO L82 PathProgramCache]: Analyzing trace with hash -1291585692, now seen corresponding path program 1 times [2019-12-18 20:06:32,700 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:06:32,700 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968691428] [2019-12-18 20:06:32,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:06:32,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:06:32,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:06:32,828 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968691428] [2019-12-18 20:06:32,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:06:32,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 20:06:32,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289160828] [2019-12-18 20:06:32,829 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 20:06:32,829 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:06:32,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 20:06:32,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 20:06:32,830 INFO L87 Difference]: Start difference. First operand 15496 states and 47121 transitions. Second operand 6 states. [2019-12-18 20:06:33,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:06:33,702 INFO L93 Difference]: Finished difference Result 39367 states and 118228 transitions. [2019-12-18 20:06:33,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 20:06:33,703 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-18 20:06:33,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:06:33,768 INFO L225 Difference]: With dead ends: 39367 [2019-12-18 20:06:33,768 INFO L226 Difference]: Without dead ends: 39367 [2019-12-18 20:06:33,768 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-18 20:06:33,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39367 states. [2019-12-18 20:06:34,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39367 to 22126. [2019-12-18 20:06:34,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22126 states. [2019-12-18 20:06:34,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22126 states to 22126 states and 68213 transitions. [2019-12-18 20:06:34,226 INFO L78 Accepts]: Start accepts. Automaton has 22126 states and 68213 transitions. Word has length 27 [2019-12-18 20:06:34,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:06:34,226 INFO L462 AbstractCegarLoop]: Abstraction has 22126 states and 68213 transitions. [2019-12-18 20:06:34,226 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 20:06:34,227 INFO L276 IsEmpty]: Start isEmpty. Operand 22126 states and 68213 transitions. [2019-12-18 20:06:34,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 20:06:34,242 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:06:34,242 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] [2019-12-18 20:06:34,242 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:06:34,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:06:34,242 INFO L82 PathProgramCache]: Analyzing trace with hash 859272137, now seen corresponding path program 1 times [2019-12-18 20:06:34,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:06:34,243 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105556824] [2019-12-18 20:06:34,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:06:34,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:06:34,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:06:34,352 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105556824] [2019-12-18 20:06:34,353 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:06:34,353 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 20:06:34,353 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664933960] [2019-12-18 20:06:34,353 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 20:06:34,354 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:06:34,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 20:06:34,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 20:06:34,354 INFO L87 Difference]: Start difference. First operand 22126 states and 68213 transitions. Second operand 6 states. [2019-12-18 20:06:35,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:06:35,379 INFO L93 Difference]: Finished difference Result 36723 states and 110142 transitions. [2019-12-18 20:06:35,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 20:06:35,379 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-12-18 20:06:35,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:06:35,434 INFO L225 Difference]: With dead ends: 36723 [2019-12-18 20:06:35,434 INFO L226 Difference]: Without dead ends: 36723 [2019-12-18 20:06:35,435 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-18 20:06:35,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36723 states. [2019-12-18 20:06:35,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36723 to 21684. [2019-12-18 20:06:35,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21684 states. [2019-12-18 20:06:35,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21684 states to 21684 states and 67048 transitions. [2019-12-18 20:06:35,884 INFO L78 Accepts]: Start accepts. Automaton has 21684 states and 67048 transitions. Word has length 28 [2019-12-18 20:06:35,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:06:35,884 INFO L462 AbstractCegarLoop]: Abstraction has 21684 states and 67048 transitions. [2019-12-18 20:06:35,884 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 20:06:35,884 INFO L276 IsEmpty]: Start isEmpty. Operand 21684 states and 67048 transitions. [2019-12-18 20:06:35,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 20:06:35,910 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:06:35,910 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:06:35,910 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:06:35,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:06:35,910 INFO L82 PathProgramCache]: Analyzing trace with hash -1529980999, now seen corresponding path program 1 times [2019-12-18 20:06:35,911 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:06:35,911 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082394236] [2019-12-18 20:06:35,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:06:35,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:06:36,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:06:36,037 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082394236] [2019-12-18 20:06:36,037 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:06:36,037 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 20:06:36,038 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716913334] [2019-12-18 20:06:36,038 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 20:06:36,038 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:06:36,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 20:06:36,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 20:06:36,039 INFO L87 Difference]: Start difference. First operand 21684 states and 67048 transitions. Second operand 7 states. [2019-12-18 20:06:37,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:06:37,645 INFO L93 Difference]: Finished difference Result 48727 states and 145636 transitions. [2019-12-18 20:06:37,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 20:06:37,646 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-18 20:06:37,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:06:37,715 INFO L225 Difference]: With dead ends: 48727 [2019-12-18 20:06:37,715 INFO L226 Difference]: Without dead ends: 48727 [2019-12-18 20:06:37,715 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2019-12-18 20:06:37,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48727 states. [2019-12-18 20:06:38,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48727 to 23131. [2019-12-18 20:06:38,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23131 states. [2019-12-18 20:06:38,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23131 states to 23131 states and 71461 transitions. [2019-12-18 20:06:38,250 INFO L78 Accepts]: Start accepts. Automaton has 23131 states and 71461 transitions. Word has length 33 [2019-12-18 20:06:38,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:06:38,250 INFO L462 AbstractCegarLoop]: Abstraction has 23131 states and 71461 transitions. [2019-12-18 20:06:38,250 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 20:06:38,250 INFO L276 IsEmpty]: Start isEmpty. Operand 23131 states and 71461 transitions. [2019-12-18 20:06:38,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 20:06:38,276 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:06:38,276 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:06:38,276 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:06:38,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:06:38,276 INFO L82 PathProgramCache]: Analyzing trace with hash -1030046023, now seen corresponding path program 2 times [2019-12-18 20:06:38,276 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:06:38,277 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448273557] [2019-12-18 20:06:38,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:06:38,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:06:38,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:06:38,426 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448273557] [2019-12-18 20:06:38,426 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:06:38,426 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 20:06:38,427 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257463687] [2019-12-18 20:06:38,427 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 20:06:38,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:06:38,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 20:06:38,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-18 20:06:38,428 INFO L87 Difference]: Start difference. First operand 23131 states and 71461 transitions. Second operand 8 states. [2019-12-18 20:06:40,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:06:40,598 INFO L93 Difference]: Finished difference Result 67362 states and 198335 transitions. [2019-12-18 20:06:40,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-18 20:06:40,598 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2019-12-18 20:06:40,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:06:40,704 INFO L225 Difference]: With dead ends: 67362 [2019-12-18 20:06:40,705 INFO L226 Difference]: Without dead ends: 67362 [2019-12-18 20:06:40,705 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=199, Invalid=557, Unknown=0, NotChecked=0, Total=756 [2019-12-18 20:06:40,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67362 states. [2019-12-18 20:06:41,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67362 to 22138. [2019-12-18 20:06:41,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22138 states. [2019-12-18 20:06:41,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22138 states to 22138 states and 68414 transitions. [2019-12-18 20:06:41,374 INFO L78 Accepts]: Start accepts. Automaton has 22138 states and 68414 transitions. Word has length 33 [2019-12-18 20:06:41,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:06:41,374 INFO L462 AbstractCegarLoop]: Abstraction has 22138 states and 68414 transitions. [2019-12-18 20:06:41,375 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 20:06:41,375 INFO L276 IsEmpty]: Start isEmpty. Operand 22138 states and 68414 transitions. [2019-12-18 20:06:41,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-18 20:06:41,396 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:06:41,396 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] [2019-12-18 20:06:41,396 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:06:41,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:06:41,396 INFO L82 PathProgramCache]: Analyzing trace with hash 2058952212, now seen corresponding path program 1 times [2019-12-18 20:06:41,397 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:06:41,397 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861027932] [2019-12-18 20:06:41,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:06:41,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:06:41,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:06:41,512 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861027932] [2019-12-18 20:06:41,512 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:06:41,513 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 20:06:41,513 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903056984] [2019-12-18 20:06:41,513 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 20:06:41,513 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:06:41,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 20:06:41,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 20:06:41,514 INFO L87 Difference]: Start difference. First operand 22138 states and 68414 transitions. Second operand 7 states. [2019-12-18 20:06:42,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:06:42,952 INFO L93 Difference]: Finished difference Result 40064 states and 119955 transitions. [2019-12-18 20:06:42,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 20:06:42,952 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2019-12-18 20:06:42,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:06:43,009 INFO L225 Difference]: With dead ends: 40064 [2019-12-18 20:06:43,009 INFO L226 Difference]: Without dead ends: 40064 [2019-12-18 20:06:43,009 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2019-12-18 20:06:43,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40064 states. [2019-12-18 20:06:43,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40064 to 20938. [2019-12-18 20:06:43,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20938 states. [2019-12-18 20:06:43,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20938 states to 20938 states and 64898 transitions. [2019-12-18 20:06:43,464 INFO L78 Accepts]: Start accepts. Automaton has 20938 states and 64898 transitions. Word has length 34 [2019-12-18 20:06:43,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:06:43,465 INFO L462 AbstractCegarLoop]: Abstraction has 20938 states and 64898 transitions. [2019-12-18 20:06:43,465 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 20:06:43,465 INFO L276 IsEmpty]: Start isEmpty. Operand 20938 states and 64898 transitions. [2019-12-18 20:06:43,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-18 20:06:43,490 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:06:43,490 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] [2019-12-18 20:06:43,490 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:06:43,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:06:43,490 INFO L82 PathProgramCache]: Analyzing trace with hash 1960715392, now seen corresponding path program 2 times [2019-12-18 20:06:43,491 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:06:43,491 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154256052] [2019-12-18 20:06:43,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:06:43,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:06:43,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:06:43,619 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154256052] [2019-12-18 20:06:43,619 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:06:43,619 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 20:06:43,620 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211282034] [2019-12-18 20:06:43,620 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 20:06:43,620 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:06:43,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 20:06:43,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-18 20:06:43,621 INFO L87 Difference]: Start difference. First operand 20938 states and 64898 transitions. Second operand 8 states. [2019-12-18 20:06:45,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:06:45,692 INFO L93 Difference]: Finished difference Result 44487 states and 132069 transitions. [2019-12-18 20:06:45,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-18 20:06:45,692 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2019-12-18 20:06:45,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:06:45,803 INFO L225 Difference]: With dead ends: 44487 [2019-12-18 20:06:45,804 INFO L226 Difference]: Without dead ends: 44487 [2019-12-18 20:06:45,811 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=171, Invalid=479, Unknown=0, NotChecked=0, Total=650 [2019-12-18 20:06:45,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44487 states. [2019-12-18 20:06:46,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44487 to 20512. [2019-12-18 20:06:46,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20512 states. [2019-12-18 20:06:46,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20512 states to 20512 states and 63595 transitions. [2019-12-18 20:06:46,306 INFO L78 Accepts]: Start accepts. Automaton has 20512 states and 63595 transitions. Word has length 34 [2019-12-18 20:06:46,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:06:46,306 INFO L462 AbstractCegarLoop]: Abstraction has 20512 states and 63595 transitions. [2019-12-18 20:06:46,306 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 20:06:46,306 INFO L276 IsEmpty]: Start isEmpty. Operand 20512 states and 63595 transitions. [2019-12-18 20:06:46,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 20:06:46,328 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:06:46,328 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-18 20:06:46,328 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:06:46,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:06:46,328 INFO L82 PathProgramCache]: Analyzing trace with hash -1601798089, now seen corresponding path program 1 times [2019-12-18 20:06:46,329 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:06:46,329 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084494435] [2019-12-18 20:06:46,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:06:46,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:06:46,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:06:46,373 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084494435] [2019-12-18 20:06:46,373 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:06:46,373 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:06:46,374 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697997799] [2019-12-18 20:06:46,374 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:06:46,374 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:06:46,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:06:46,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:06:46,375 INFO L87 Difference]: Start difference. First operand 20512 states and 63595 transitions. Second operand 3 states. [2019-12-18 20:06:46,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:06:46,513 INFO L93 Difference]: Finished difference Result 35279 states and 109635 transitions. [2019-12-18 20:06:46,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:06:46,513 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-18 20:06:46,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:06:46,546 INFO L225 Difference]: With dead ends: 35279 [2019-12-18 20:06:46,546 INFO L226 Difference]: Without dead ends: 17861 [2019-12-18 20:06:46,546 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:06:46,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17861 states. [2019-12-18 20:06:46,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17861 to 17766. [2019-12-18 20:06:46,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17766 states. [2019-12-18 20:06:46,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17766 states to 17766 states and 54059 transitions. [2019-12-18 20:06:46,807 INFO L78 Accepts]: Start accepts. Automaton has 17766 states and 54059 transitions. Word has length 39 [2019-12-18 20:06:46,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:06:46,807 INFO L462 AbstractCegarLoop]: Abstraction has 17766 states and 54059 transitions. [2019-12-18 20:06:46,807 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:06:46,808 INFO L276 IsEmpty]: Start isEmpty. Operand 17766 states and 54059 transitions. [2019-12-18 20:06:46,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 20:06:46,830 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:06:46,830 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-18 20:06:46,830 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:06:46,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:06:46,830 INFO L82 PathProgramCache]: Analyzing trace with hash 1603062761, now seen corresponding path program 2 times [2019-12-18 20:06:46,830 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:06:46,831 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451789704] [2019-12-18 20:06:46,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:06:46,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:06:46,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:06:46,881 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451789704] [2019-12-18 20:06:46,881 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:06:46,881 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 20:06:46,881 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938427625] [2019-12-18 20:06:46,882 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:06:46,882 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:06:46,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:06:46,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:06:46,882 INFO L87 Difference]: Start difference. First operand 17766 states and 54059 transitions. Second operand 3 states. [2019-12-18 20:06:46,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:06:46,947 INFO L93 Difference]: Finished difference Result 17765 states and 54057 transitions. [2019-12-18 20:06:46,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:06:46,947 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-18 20:06:46,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:06:46,979 INFO L225 Difference]: With dead ends: 17765 [2019-12-18 20:06:46,980 INFO L226 Difference]: Without dead ends: 17765 [2019-12-18 20:06:46,980 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:06:47,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17765 states. [2019-12-18 20:06:47,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17765 to 17765. [2019-12-18 20:06:47,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17765 states. [2019-12-18 20:06:47,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17765 states to 17765 states and 54057 transitions. [2019-12-18 20:06:47,245 INFO L78 Accepts]: Start accepts. Automaton has 17765 states and 54057 transitions. Word has length 39 [2019-12-18 20:06:47,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:06:47,245 INFO L462 AbstractCegarLoop]: Abstraction has 17765 states and 54057 transitions. [2019-12-18 20:06:47,246 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:06:47,246 INFO L276 IsEmpty]: Start isEmpty. Operand 17765 states and 54057 transitions. [2019-12-18 20:06:47,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 20:06:47,262 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:06:47,262 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-18 20:06:47,262 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:06:47,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:06:47,262 INFO L82 PathProgramCache]: Analyzing trace with hash 417642434, now seen corresponding path program 1 times [2019-12-18 20:06:47,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:06:47,263 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129246110] [2019-12-18 20:06:47,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:06:47,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:06:47,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:06:47,337 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129246110] [2019-12-18 20:06:47,337 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:06:47,337 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 20:06:47,337 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187306440] [2019-12-18 20:06:47,338 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:06:47,338 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:06:47,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:06:47,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:06:47,338 INFO L87 Difference]: Start difference. First operand 17765 states and 54057 transitions. Second operand 5 states. [2019-12-18 20:06:48,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:06:48,040 INFO L93 Difference]: Finished difference Result 28871 states and 85833 transitions. [2019-12-18 20:06:48,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 20:06:48,040 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 20:06:48,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:06:48,083 INFO L225 Difference]: With dead ends: 28871 [2019-12-18 20:06:48,083 INFO L226 Difference]: Without dead ends: 28871 [2019-12-18 20:06:48,083 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 20:06:48,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28871 states. [2019-12-18 20:06:48,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28871 to 23085. [2019-12-18 20:06:48,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23085 states. [2019-12-18 20:06:48,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23085 states to 23085 states and 69963 transitions. [2019-12-18 20:06:48,608 INFO L78 Accepts]: Start accepts. Automaton has 23085 states and 69963 transitions. Word has length 40 [2019-12-18 20:06:48,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:06:48,608 INFO L462 AbstractCegarLoop]: Abstraction has 23085 states and 69963 transitions. [2019-12-18 20:06:48,608 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:06:48,608 INFO L276 IsEmpty]: Start isEmpty. Operand 23085 states and 69963 transitions. [2019-12-18 20:06:48,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 20:06:48,630 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:06:48,630 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-18 20:06:48,630 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:06:48,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:06:48,631 INFO L82 PathProgramCache]: Analyzing trace with hash -1415326004, now seen corresponding path program 2 times [2019-12-18 20:06:48,631 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:06:48,631 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790793288] [2019-12-18 20:06:48,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:06:48,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:06:48,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:06:48,717 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790793288] [2019-12-18 20:06:48,717 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:06:48,717 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 20:06:48,717 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777261997] [2019-12-18 20:06:48,718 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 20:06:48,718 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:06:48,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 20:06:48,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 20:06:48,718 INFO L87 Difference]: Start difference. First operand 23085 states and 69963 transitions. Second operand 6 states. [2019-12-18 20:06:49,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:06:49,559 INFO L93 Difference]: Finished difference Result 38575 states and 115920 transitions. [2019-12-18 20:06:49,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 20:06:49,559 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-18 20:06:49,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:06:49,615 INFO L225 Difference]: With dead ends: 38575 [2019-12-18 20:06:49,615 INFO L226 Difference]: Without dead ends: 38575 [2019-12-18 20:06:49,615 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-12-18 20:06:49,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38575 states. [2019-12-18 20:06:50,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38575 to 27013. [2019-12-18 20:06:50,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27013 states. [2019-12-18 20:06:50,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27013 states to 27013 states and 81683 transitions. [2019-12-18 20:06:50,140 INFO L78 Accepts]: Start accepts. Automaton has 27013 states and 81683 transitions. Word has length 40 [2019-12-18 20:06:50,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:06:50,140 INFO L462 AbstractCegarLoop]: Abstraction has 27013 states and 81683 transitions. [2019-12-18 20:06:50,140 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 20:06:50,140 INFO L276 IsEmpty]: Start isEmpty. Operand 27013 states and 81683 transitions. [2019-12-18 20:06:50,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 20:06:50,169 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:06:50,169 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:06:50,169 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:06:50,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:06:50,169 INFO L82 PathProgramCache]: Analyzing trace with hash -1542628910, now seen corresponding path program 3 times [2019-12-18 20:06:50,170 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:06:50,170 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379780544] [2019-12-18 20:06:50,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:06:50,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:06:50,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:06:50,218 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379780544] [2019-12-18 20:06:50,218 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:06:50,218 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 20:06:50,219 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178324758] [2019-12-18 20:06:50,219 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:06:50,219 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:06:50,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:06:50,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:06:50,224 INFO L87 Difference]: Start difference. First operand 27013 states and 81683 transitions. Second operand 5 states. [2019-12-18 20:06:50,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:06:50,325 INFO L93 Difference]: Finished difference Result 25620 states and 78403 transitions. [2019-12-18 20:06:50,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 20:06:50,326 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 20:06:50,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:06:50,358 INFO L225 Difference]: With dead ends: 25620 [2019-12-18 20:06:50,358 INFO L226 Difference]: Without dead ends: 23532 [2019-12-18 20:06:50,359 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:06:50,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23532 states. [2019-12-18 20:06:50,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23532 to 22447. [2019-12-18 20:06:50,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22447 states. [2019-12-18 20:06:50,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22447 states to 22447 states and 70398 transitions. [2019-12-18 20:06:50,716 INFO L78 Accepts]: Start accepts. Automaton has 22447 states and 70398 transitions. Word has length 40 [2019-12-18 20:06:50,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:06:50,717 INFO L462 AbstractCegarLoop]: Abstraction has 22447 states and 70398 transitions. [2019-12-18 20:06:50,717 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:06:50,717 INFO L276 IsEmpty]: Start isEmpty. Operand 22447 states and 70398 transitions. [2019-12-18 20:06:50,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 20:06:50,743 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:06:50,743 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-18 20:06:50,743 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-18 20:06:50,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:06:50,743 INFO L82 PathProgramCache]: Analyzing trace with hash -1027702, now seen corresponding path program 1 times [2019-12-18 20:06:50,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:06:50,744 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702021571] [2019-12-18 20:06:50,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:06:50,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:06:50,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:06:50,830 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702021571] [2019-12-18 20:06:50,830 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:06:50,830 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 20:06:50,830 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650087510] [2019-12-18 20:06:50,831 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 20:06:50,831 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:06:50,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 20:06:50,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 20:06:50,831 INFO L87 Difference]: Start difference. First operand 22447 states and 70398 transitions. Second operand 7 states. [2019-12-18 20:06:51,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:06:51,600 INFO L93 Difference]: Finished difference Result 71537 states and 220984 transitions. [2019-12-18 20:06:51,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 20:06:51,600 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 20:06:51,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:06:51,671 INFO L225 Difference]: With dead ends: 71537 [2019-12-18 20:06:51,672 INFO L226 Difference]: Without dead ends: 49968 [2019-12-18 20:06:51,672 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 20:06:51,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49968 states. [2019-12-18 20:06:52,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49968 to 25921. [2019-12-18 20:06:52,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25921 states. [2019-12-18 20:06:52,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25921 states to 25921 states and 81163 transitions. [2019-12-18 20:06:52,257 INFO L78 Accepts]: Start accepts. Automaton has 25921 states and 81163 transitions. Word has length 64 [2019-12-18 20:06:52,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:06:52,257 INFO L462 AbstractCegarLoop]: Abstraction has 25921 states and 81163 transitions. [2019-12-18 20:06:52,257 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 20:06:52,257 INFO L276 IsEmpty]: Start isEmpty. Operand 25921 states and 81163 transitions. [2019-12-18 20:06:52,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 20:06:52,290 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:06:52,290 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-18 20:06:52,290 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-18 20:06:52,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:06:52,290 INFO L82 PathProgramCache]: Analyzing trace with hash -807176034, now seen corresponding path program 2 times [2019-12-18 20:06:52,290 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:06:52,290 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413379908] [2019-12-18 20:06:52,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:06:52,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:06:52,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:06:52,403 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413379908] [2019-12-18 20:06:52,403 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:06:52,404 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 20:06:52,404 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065307171] [2019-12-18 20:06:52,404 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 20:06:52,405 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:06:52,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 20:06:52,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 20:06:52,405 INFO L87 Difference]: Start difference. First operand 25921 states and 81163 transitions. Second operand 8 states. [2019-12-18 20:06:53,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:06:53,760 INFO L93 Difference]: Finished difference Result 113155 states and 347386 transitions. [2019-12-18 20:06:53,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 20:06:53,760 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 64 [2019-12-18 20:06:53,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:06:53,875 INFO L225 Difference]: With dead ends: 113155 [2019-12-18 20:06:53,875 INFO L226 Difference]: Without dead ends: 77700 [2019-12-18 20:06:53,876 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2019-12-18 20:06:54,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77700 states. [2019-12-18 20:06:54,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77700 to 30188. [2019-12-18 20:06:54,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30188 states. [2019-12-18 20:06:54,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30188 states to 30188 states and 94227 transitions. [2019-12-18 20:06:54,753 INFO L78 Accepts]: Start accepts. Automaton has 30188 states and 94227 transitions. Word has length 64 [2019-12-18 20:06:54,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:06:54,753 INFO L462 AbstractCegarLoop]: Abstraction has 30188 states and 94227 transitions. [2019-12-18 20:06:54,753 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 20:06:54,754 INFO L276 IsEmpty]: Start isEmpty. Operand 30188 states and 94227 transitions. [2019-12-18 20:06:54,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 20:06:54,785 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:06:54,785 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-18 20:06:54,785 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-18 20:06:54,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:06:54,786 INFO L82 PathProgramCache]: Analyzing trace with hash -584020796, now seen corresponding path program 3 times [2019-12-18 20:06:54,786 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:06:54,786 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673313798] [2019-12-18 20:06:54,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:06:54,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:06:54,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:06:54,907 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673313798] [2019-12-18 20:06:54,907 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:06:54,907 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 20:06:54,908 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900270162] [2019-12-18 20:06:54,908 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 20:06:54,908 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:06:54,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 20:06:54,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 20:06:54,909 INFO L87 Difference]: Start difference. First operand 30188 states and 94227 transitions. Second operand 9 states. [2019-12-18 20:06:56,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:06:56,969 INFO L93 Difference]: Finished difference Result 168761 states and 513023 transitions. [2019-12-18 20:06:56,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-18 20:06:56,970 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-18 20:06:56,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:06:57,273 INFO L225 Difference]: With dead ends: 168761 [2019-12-18 20:06:57,273 INFO L226 Difference]: Without dead ends: 133658 [2019-12-18 20:06:57,275 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=347, Invalid=985, Unknown=0, NotChecked=0, Total=1332 [2019-12-18 20:06:57,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133658 states. [2019-12-18 20:06:58,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133658 to 36233. [2019-12-18 20:06:58,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36233 states. [2019-12-18 20:06:58,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36233 states to 36233 states and 113101 transitions. [2019-12-18 20:06:58,605 INFO L78 Accepts]: Start accepts. Automaton has 36233 states and 113101 transitions. Word has length 64 [2019-12-18 20:06:58,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:06:58,605 INFO L462 AbstractCegarLoop]: Abstraction has 36233 states and 113101 transitions. [2019-12-18 20:06:58,605 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 20:06:58,606 INFO L276 IsEmpty]: Start isEmpty. Operand 36233 states and 113101 transitions. [2019-12-18 20:06:58,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 20:06:58,652 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:06:58,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:06:58,655 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-18 20:06:58,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:06:58,655 INFO L82 PathProgramCache]: Analyzing trace with hash -2052967778, now seen corresponding path program 4 times [2019-12-18 20:06:58,655 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:06:58,656 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825222516] [2019-12-18 20:06:58,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:06:58,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:06:58,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:06:58,780 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825222516] [2019-12-18 20:06:58,780 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:06:58,780 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 20:06:58,780 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259143225] [2019-12-18 20:06:58,781 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 20:06:58,781 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:06:58,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 20:06:58,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 20:06:58,783 INFO L87 Difference]: Start difference. First operand 36233 states and 113101 transitions. Second operand 9 states. [2019-12-18 20:06:59,787 WARN L192 SmtUtils]: Spent 281.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-12-18 20:07:00,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:07:00,987 INFO L93 Difference]: Finished difference Result 130509 states and 396058 transitions. [2019-12-18 20:07:00,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-18 20:07:00,988 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-18 20:07:00,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:07:01,174 INFO L225 Difference]: With dead ends: 130509 [2019-12-18 20:07:01,174 INFO L226 Difference]: Without dead ends: 120954 [2019-12-18 20:07:01,175 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=229, Invalid=701, Unknown=0, NotChecked=0, Total=930 [2019-12-18 20:07:01,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120954 states. [2019-12-18 20:07:02,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120954 to 35707. [2019-12-18 20:07:02,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35707 states. [2019-12-18 20:07:02,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35707 states to 35707 states and 111582 transitions. [2019-12-18 20:07:02,470 INFO L78 Accepts]: Start accepts. Automaton has 35707 states and 111582 transitions. Word has length 64 [2019-12-18 20:07:02,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:07:02,471 INFO L462 AbstractCegarLoop]: Abstraction has 35707 states and 111582 transitions. [2019-12-18 20:07:02,471 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 20:07:02,471 INFO L276 IsEmpty]: Start isEmpty. Operand 35707 states and 111582 transitions. [2019-12-18 20:07:02,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 20:07:02,514 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:07:02,514 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-18 20:07:02,514 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-18 20:07:02,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:07:02,515 INFO L82 PathProgramCache]: Analyzing trace with hash 1570564162, now seen corresponding path program 5 times [2019-12-18 20:07:02,515 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:07:02,515 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298051409] [2019-12-18 20:07:02,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:07:02,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:07:02,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:07:02,590 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298051409] [2019-12-18 20:07:02,591 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:07:02,591 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 20:07:02,591 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628004415] [2019-12-18 20:07:02,591 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 20:07:02,591 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:07:02,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 20:07:02,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 20:07:02,595 INFO L87 Difference]: Start difference. First operand 35707 states and 111582 transitions. Second operand 7 states. [2019-12-18 20:07:03,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:07:03,044 INFO L93 Difference]: Finished difference Result 73087 states and 223139 transitions. [2019-12-18 20:07:03,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 20:07:03,045 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 20:07:03,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:07:03,144 INFO L225 Difference]: With dead ends: 73087 [2019-12-18 20:07:03,145 INFO L226 Difference]: Without dead ends: 64189 [2019-12-18 20:07:03,145 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 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-18 20:07:03,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64189 states. [2019-12-18 20:07:04,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64189 to 35771. [2019-12-18 20:07:04,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35771 states. [2019-12-18 20:07:04,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35771 states to 35771 states and 111711 transitions. [2019-12-18 20:07:04,261 INFO L78 Accepts]: Start accepts. Automaton has 35771 states and 111711 transitions. Word has length 64 [2019-12-18 20:07:04,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:07:04,262 INFO L462 AbstractCegarLoop]: Abstraction has 35771 states and 111711 transitions. [2019-12-18 20:07:04,262 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 20:07:04,262 INFO L276 IsEmpty]: Start isEmpty. Operand 35771 states and 111711 transitions. [2019-12-18 20:07:04,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 20:07:04,303 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:07:04,303 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-18 20:07:04,304 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-18 20:07:04,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:07:04,304 INFO L82 PathProgramCache]: Analyzing trace with hash -606436500, now seen corresponding path program 6 times [2019-12-18 20:07:04,304 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:07:04,304 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802566976] [2019-12-18 20:07:04,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:07:04,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:07:04,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:07:04,371 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802566976] [2019-12-18 20:07:04,371 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:07:04,371 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:07:04,371 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018623816] [2019-12-18 20:07:04,373 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:07:04,373 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:07:04,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:07:04,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:07:04,373 INFO L87 Difference]: Start difference. First operand 35771 states and 111711 transitions. Second operand 3 states. [2019-12-18 20:07:04,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:07:04,547 INFO L93 Difference]: Finished difference Result 41432 states and 128476 transitions. [2019-12-18 20:07:04,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:07:04,548 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-18 20:07:04,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:07:04,607 INFO L225 Difference]: With dead ends: 41432 [2019-12-18 20:07:04,608 INFO L226 Difference]: Without dead ends: 41432 [2019-12-18 20:07:04,608 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-18 20:07:04,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41432 states. [2019-12-18 20:07:05,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41432 to 36474. [2019-12-18 20:07:05,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36474 states. [2019-12-18 20:07:05,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36474 states to 36474 states and 114056 transitions. [2019-12-18 20:07:05,234 INFO L78 Accepts]: Start accepts. Automaton has 36474 states and 114056 transitions. Word has length 64 [2019-12-18 20:07:05,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:07:05,236 INFO L462 AbstractCegarLoop]: Abstraction has 36474 states and 114056 transitions. [2019-12-18 20:07:05,236 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:07:05,236 INFO L276 IsEmpty]: Start isEmpty. Operand 36474 states and 114056 transitions. [2019-12-18 20:07:05,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 20:07:05,282 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:07:05,283 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:07:05,283 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-18 20:07:05,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:07:05,283 INFO L82 PathProgramCache]: Analyzing trace with hash -748291407, now seen corresponding path program 1 times [2019-12-18 20:07:05,283 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:07:05,283 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894589392] [2019-12-18 20:07:05,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:07:05,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:07:05,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:07:05,325 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894589392] [2019-12-18 20:07:05,325 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:07:05,326 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 20:07:05,326 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314740729] [2019-12-18 20:07:05,326 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:07:05,326 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:07:05,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:07:05,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:07:05,327 INFO L87 Difference]: Start difference. First operand 36474 states and 114056 transitions. Second operand 4 states. [2019-12-18 20:07:05,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:07:05,615 INFO L93 Difference]: Finished difference Result 45224 states and 139916 transitions. [2019-12-18 20:07:05,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 20:07:05,619 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-18 20:07:05,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:07:05,681 INFO L225 Difference]: With dead ends: 45224 [2019-12-18 20:07:05,681 INFO L226 Difference]: Without dead ends: 45224 [2019-12-18 20:07:05,681 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-18 20:07:05,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45224 states. [2019-12-18 20:07:06,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45224 to 37332. [2019-12-18 20:07:06,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37332 states. [2019-12-18 20:07:06,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37332 states to 37332 states and 116657 transitions. [2019-12-18 20:07:06,817 INFO L78 Accepts]: Start accepts. Automaton has 37332 states and 116657 transitions. Word has length 65 [2019-12-18 20:07:06,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:07:06,817 INFO L462 AbstractCegarLoop]: Abstraction has 37332 states and 116657 transitions. [2019-12-18 20:07:06,817 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:07:06,817 INFO L276 IsEmpty]: Start isEmpty. Operand 37332 states and 116657 transitions. [2019-12-18 20:07:06,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 20:07:06,862 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:07:06,862 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:07:06,862 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-18 20:07:06,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:07:06,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1146257839, now seen corresponding path program 2 times [2019-12-18 20:07:06,863 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:07:06,863 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844972715] [2019-12-18 20:07:06,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:07:06,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:07:06,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:07:06,912 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844972715] [2019-12-18 20:07:06,912 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:07:06,912 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 20:07:06,912 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576671381] [2019-12-18 20:07:06,913 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:07:06,913 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:07:06,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:07:06,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:07:06,913 INFO L87 Difference]: Start difference. First operand 37332 states and 116657 transitions. Second operand 4 states. [2019-12-18 20:07:07,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:07:07,449 INFO L93 Difference]: Finished difference Result 52297 states and 162832 transitions. [2019-12-18 20:07:07,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 20:07:07,449 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-18 20:07:07,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:07:07,596 INFO L225 Difference]: With dead ends: 52297 [2019-12-18 20:07:07,597 INFO L226 Difference]: Without dead ends: 52297 [2019-12-18 20:07:07,597 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-18 20:07:07,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52297 states. [2019-12-18 20:07:08,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52297 to 39234. [2019-12-18 20:07:08,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39234 states. [2019-12-18 20:07:08,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39234 states to 39234 states and 123889 transitions. [2019-12-18 20:07:08,569 INFO L78 Accepts]: Start accepts. Automaton has 39234 states and 123889 transitions. Word has length 65 [2019-12-18 20:07:08,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:07:08,570 INFO L462 AbstractCegarLoop]: Abstraction has 39234 states and 123889 transitions. [2019-12-18 20:07:08,570 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:07:08,570 INFO L276 IsEmpty]: Start isEmpty. Operand 39234 states and 123889 transitions. [2019-12-18 20:07:08,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 20:07:08,618 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:07:08,618 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:07:08,618 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-18 20:07:08,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:07:08,618 INFO L82 PathProgramCache]: Analyzing trace with hash -232484785, now seen corresponding path program 3 times [2019-12-18 20:07:08,619 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:07:08,619 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667668905] [2019-12-18 20:07:08,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:07:08,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:07:08,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:07:08,704 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667668905] [2019-12-18 20:07:08,704 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:07:08,704 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 20:07:08,704 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455220805] [2019-12-18 20:07:08,705 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 20:07:08,705 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:07:08,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 20:07:08,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 20:07:08,705 INFO L87 Difference]: Start difference. First operand 39234 states and 123889 transitions. Second operand 8 states. [2019-12-18 20:07:10,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:07:10,059 INFO L93 Difference]: Finished difference Result 111094 states and 344955 transitions. [2019-12-18 20:07:10,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 20:07:10,060 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-18 20:07:10,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:07:10,230 INFO L225 Difference]: With dead ends: 111094 [2019-12-18 20:07:10,231 INFO L226 Difference]: Without dead ends: 103481 [2019-12-18 20:07:10,231 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2019-12-18 20:07:10,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103481 states. [2019-12-18 20:07:11,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103481 to 39844. [2019-12-18 20:07:11,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39844 states. [2019-12-18 20:07:11,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39844 states to 39844 states and 126150 transitions. [2019-12-18 20:07:11,792 INFO L78 Accepts]: Start accepts. Automaton has 39844 states and 126150 transitions. Word has length 65 [2019-12-18 20:07:11,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:07:11,792 INFO L462 AbstractCegarLoop]: Abstraction has 39844 states and 126150 transitions. [2019-12-18 20:07:11,792 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 20:07:11,792 INFO L276 IsEmpty]: Start isEmpty. Operand 39844 states and 126150 transitions. [2019-12-18 20:07:11,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 20:07:11,838 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:07:11,838 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:07:11,838 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-18 20:07:11,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:07:11,838 INFO L82 PathProgramCache]: Analyzing trace with hash 208975201, now seen corresponding path program 4 times [2019-12-18 20:07:11,838 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:07:11,838 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804042212] [2019-12-18 20:07:11,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:07:11,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:07:11,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:07:11,945 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804042212] [2019-12-18 20:07:11,945 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:07:11,945 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 20:07:11,946 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004707345] [2019-12-18 20:07:11,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 20:07:11,946 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:07:11,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 20:07:11,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 20:07:11,947 INFO L87 Difference]: Start difference. First operand 39844 states and 126150 transitions. Second operand 9 states. [2019-12-18 20:07:13,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:07:13,626 INFO L93 Difference]: Finished difference Result 139645 states and 428305 transitions. [2019-12-18 20:07:13,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-18 20:07:13,626 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-18 20:07:13,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:07:13,837 INFO L225 Difference]: With dead ends: 139645 [2019-12-18 20:07:13,837 INFO L226 Difference]: Without dead ends: 129204 [2019-12-18 20:07:13,837 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=197, Invalid=559, Unknown=0, NotChecked=0, Total=756 [2019-12-18 20:07:14,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129204 states. [2019-12-18 20:07:15,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129204 to 40870. [2019-12-18 20:07:15,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40870 states. [2019-12-18 20:07:15,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40870 states to 40870 states and 128362 transitions. [2019-12-18 20:07:15,949 INFO L78 Accepts]: Start accepts. Automaton has 40870 states and 128362 transitions. Word has length 65 [2019-12-18 20:07:15,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:07:15,949 INFO L462 AbstractCegarLoop]: Abstraction has 40870 states and 128362 transitions. [2019-12-18 20:07:15,949 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 20:07:15,950 INFO L276 IsEmpty]: Start isEmpty. Operand 40870 states and 128362 transitions. [2019-12-18 20:07:15,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 20:07:15,997 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:07:15,997 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:07:15,998 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-18 20:07:15,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:07:15,998 INFO L82 PathProgramCache]: Analyzing trace with hash 652655719, now seen corresponding path program 5 times [2019-12-18 20:07:15,998 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:07:15,998 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809417698] [2019-12-18 20:07:15,998 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:07:16,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:07:16,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:07:16,100 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809417698] [2019-12-18 20:07:16,100 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:07:16,100 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 20:07:16,100 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514521070] [2019-12-18 20:07:16,100 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 20:07:16,100 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:07:16,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 20:07:16,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 20:07:16,101 INFO L87 Difference]: Start difference. First operand 40870 states and 128362 transitions. Second operand 9 states. [2019-12-18 20:07:17,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:07:17,534 INFO L93 Difference]: Finished difference Result 118539 states and 362381 transitions. [2019-12-18 20:07:17,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-18 20:07:17,535 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-18 20:07:17,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:07:17,719 INFO L225 Difference]: With dead ends: 118539 [2019-12-18 20:07:17,719 INFO L226 Difference]: Without dead ends: 113527 [2019-12-18 20:07:17,720 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2019-12-18 20:07:17,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113527 states. [2019-12-18 20:07:18,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113527 to 39267. [2019-12-18 20:07:18,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39267 states. [2019-12-18 20:07:19,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39267 states to 39267 states and 123914 transitions. [2019-12-18 20:07:19,037 INFO L78 Accepts]: Start accepts. Automaton has 39267 states and 123914 transitions. Word has length 65 [2019-12-18 20:07:19,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:07:19,038 INFO L462 AbstractCegarLoop]: Abstraction has 39267 states and 123914 transitions. [2019-12-18 20:07:19,038 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 20:07:19,038 INFO L276 IsEmpty]: Start isEmpty. Operand 39267 states and 123914 transitions. [2019-12-18 20:07:19,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 20:07:19,085 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:07:19,085 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:07:19,085 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-18 20:07:19,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:07:19,086 INFO L82 PathProgramCache]: Analyzing trace with hash -1727661840, now seen corresponding path program 1 times [2019-12-18 20:07:19,086 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:07:19,086 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104755539] [2019-12-18 20:07:19,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:07:19,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:07:19,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:07:19,197 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104755539] [2019-12-18 20:07:19,197 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:07:19,197 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 20:07:19,197 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653428529] [2019-12-18 20:07:19,198 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 20:07:19,198 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:07:19,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 20:07:19,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 20:07:19,198 INFO L87 Difference]: Start difference. First operand 39267 states and 123914 transitions. Second operand 7 states. [2019-12-18 20:07:20,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:07:20,881 INFO L93 Difference]: Finished difference Result 68599 states and 210316 transitions. [2019-12-18 20:07:20,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 20:07:20,882 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-18 20:07:20,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:07:21,329 INFO L225 Difference]: With dead ends: 68599 [2019-12-18 20:07:21,329 INFO L226 Difference]: Without dead ends: 68599 [2019-12-18 20:07:21,330 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2019-12-18 20:07:21,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68599 states. [2019-12-18 20:07:22,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68599 to 39867. [2019-12-18 20:07:22,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39867 states. [2019-12-18 20:07:22,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39867 states to 39867 states and 125706 transitions. [2019-12-18 20:07:22,212 INFO L78 Accepts]: Start accepts. Automaton has 39867 states and 125706 transitions. Word has length 65 [2019-12-18 20:07:22,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:07:22,212 INFO L462 AbstractCegarLoop]: Abstraction has 39867 states and 125706 transitions. [2019-12-18 20:07:22,212 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 20:07:22,212 INFO L276 IsEmpty]: Start isEmpty. Operand 39867 states and 125706 transitions. [2019-12-18 20:07:22,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 20:07:22,256 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:07:22,257 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:07:22,257 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-18 20:07:22,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:07:22,257 INFO L82 PathProgramCache]: Analyzing trace with hash 1601587072, now seen corresponding path program 2 times [2019-12-18 20:07:22,257 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:07:22,257 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487913646] [2019-12-18 20:07:22,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:07:22,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:07:22,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:07:22,384 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487913646] [2019-12-18 20:07:22,384 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:07:22,384 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 20:07:22,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462479667] [2019-12-18 20:07:22,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 20:07:22,385 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:07:22,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 20:07:22,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-18 20:07:22,385 INFO L87 Difference]: Start difference. First operand 39867 states and 125706 transitions. Second operand 8 states. [2019-12-18 20:07:24,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:07:24,314 INFO L93 Difference]: Finished difference Result 77250 states and 236643 transitions. [2019-12-18 20:07:24,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 20:07:24,315 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-18 20:07:24,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:07:24,433 INFO L225 Difference]: With dead ends: 77250 [2019-12-18 20:07:24,433 INFO L226 Difference]: Without dead ends: 77250 [2019-12-18 20:07:24,433 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2019-12-18 20:07:24,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77250 states. [2019-12-18 20:07:25,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77250 to 41332. [2019-12-18 20:07:25,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41332 states. [2019-12-18 20:07:25,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41332 states to 41332 states and 130526 transitions. [2019-12-18 20:07:25,992 INFO L78 Accepts]: Start accepts. Automaton has 41332 states and 130526 transitions. Word has length 65 [2019-12-18 20:07:25,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:07:25,992 INFO L462 AbstractCegarLoop]: Abstraction has 41332 states and 130526 transitions. [2019-12-18 20:07:25,993 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 20:07:25,993 INFO L276 IsEmpty]: Start isEmpty. Operand 41332 states and 130526 transitions. [2019-12-18 20:07:26,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 20:07:26,043 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:07:26,043 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:07:26,043 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-18 20:07:26,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:07:26,044 INFO L82 PathProgramCache]: Analyzing trace with hash 2080466144, now seen corresponding path program 3 times [2019-12-18 20:07:26,044 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:07:26,044 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732748334] [2019-12-18 20:07:26,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:07:26,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:07:26,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:07:26,107 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732748334] [2019-12-18 20:07:26,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:07:26,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:07:26,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44183353] [2019-12-18 20:07:26,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:07:26,108 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:07:26,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:07:26,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:07:26,108 INFO L87 Difference]: Start difference. First operand 41332 states and 130526 transitions. Second operand 3 states. [2019-12-18 20:07:26,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:07:26,206 INFO L93 Difference]: Finished difference Result 30188 states and 94486 transitions. [2019-12-18 20:07:26,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:07:26,206 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 20:07:26,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:07:26,251 INFO L225 Difference]: With dead ends: 30188 [2019-12-18 20:07:26,252 INFO L226 Difference]: Without dead ends: 30188 [2019-12-18 20:07:26,252 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:07:26,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30188 states. [2019-12-18 20:07:26,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30188 to 28101. [2019-12-18 20:07:26,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28101 states. [2019-12-18 20:07:26,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28101 states to 28101 states and 87711 transitions. [2019-12-18 20:07:26,705 INFO L78 Accepts]: Start accepts. Automaton has 28101 states and 87711 transitions. Word has length 65 [2019-12-18 20:07:26,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:07:26,705 INFO L462 AbstractCegarLoop]: Abstraction has 28101 states and 87711 transitions. [2019-12-18 20:07:26,706 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:07:26,706 INFO L276 IsEmpty]: Start isEmpty. Operand 28101 states and 87711 transitions. [2019-12-18 20:07:26,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 20:07:26,738 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:07:26,738 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:07:26,738 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-18 20:07:26,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:07:26,738 INFO L82 PathProgramCache]: Analyzing trace with hash -666708629, now seen corresponding path program 1 times [2019-12-18 20:07:26,739 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:07:26,739 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800743804] [2019-12-18 20:07:26,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:07:26,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:07:26,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:07:26,787 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800743804] [2019-12-18 20:07:26,787 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:07:26,788 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:07:26,788 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189889903] [2019-12-18 20:07:26,788 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:07:26,788 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:07:26,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:07:26,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:07:26,789 INFO L87 Difference]: Start difference. First operand 28101 states and 87711 transitions. Second operand 3 states. [2019-12-18 20:07:26,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:07:26,883 INFO L93 Difference]: Finished difference Result 28101 states and 87710 transitions. [2019-12-18 20:07:26,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:07:26,883 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 20:07:26,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:07:26,930 INFO L225 Difference]: With dead ends: 28101 [2019-12-18 20:07:26,930 INFO L226 Difference]: Without dead ends: 28101 [2019-12-18 20:07:26,930 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:07:27,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28101 states. [2019-12-18 20:07:27,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28101 to 20919. [2019-12-18 20:07:27,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20919 states. [2019-12-18 20:07:27,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20919 states to 20919 states and 65920 transitions. [2019-12-18 20:07:27,318 INFO L78 Accepts]: Start accepts. Automaton has 20919 states and 65920 transitions. Word has length 66 [2019-12-18 20:07:27,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:07:27,319 INFO L462 AbstractCegarLoop]: Abstraction has 20919 states and 65920 transitions. [2019-12-18 20:07:27,319 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:07:27,319 INFO L276 IsEmpty]: Start isEmpty. Operand 20919 states and 65920 transitions. [2019-12-18 20:07:27,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 20:07:27,342 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:07:27,343 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:07:27,343 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:07:27,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:07:27,343 INFO L82 PathProgramCache]: Analyzing trace with hash -190644257, now seen corresponding path program 1 times [2019-12-18 20:07:27,343 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:07:27,344 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502981323] [2019-12-18 20:07:27,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:07:27,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 20:07:27,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 20:07:27,478 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 20:07:27,478 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 20:07:27,482 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [895] [895] ULTIMATE.startENTRY-->L830: Formula: (let ((.cse0 (store |v_#valid_63| 0 0))) (and (= 0 v_~z$r_buff1_thd0~0_25) (= v_~main$tmp_guard1~0_17 0) (= v_~main$tmp_guard0~0_10 0) (= v_~z$r_buff0_thd3~0_76 0) (= 0 v_~__unbuffered_p1_EAX~0_14) (= v_~z$read_delayed_var~0.offset_6 0) (= v_~z$r_buff0_thd0~0_20 0) (= 0 v_~__unbuffered_cnt~0_20) (= v_~z~0_28 0) (= |v_#NULL.offset_6| 0) (= v_~__unbuffered_p1_EBX~0_15 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t153~0.base_19|) (= v_~z$r_buff0_thd2~0_20 0) (= v_~__unbuffered_p2_EBX~0_16 0) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t153~0.base_19| 4) |v_#length_23|) (= v_~z$read_delayed~0_6 0) (= 0 v_~weak$$choice2~0_32) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t153~0.base_19|)) (= 0 v_~z$r_buff1_thd2~0_16) (= 0 v_~z$mem_tmp~0_9) (= v_~z$read_delayed_var~0.base_6 0) (< 0 |v_#StackHeapBarrier_18|) (= 0 v_~__unbuffered_p2_EAX~0_15) (= 0 |v_#NULL.base_6|) (= v_~z$r_buff0_thd1~0_27 0) (= v_~x~0_18 0) (= 0 v_~weak$$choice0~0_7) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t153~0.base_19| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t153~0.base_19|) |v_ULTIMATE.start_main_~#t153~0.offset_15| 0)) |v_#memory_int_19|) (= |v_ULTIMATE.start_main_~#t153~0.offset_15| 0) (= 0 v_~z$w_buff1_used~0_74) (= |v_#valid_61| (store .cse0 |v_ULTIMATE.start_main_~#t153~0.base_19| 1)) (= v_~z$w_buff0_used~0_111 0) (= 0 v_~z$r_buff1_thd1~0_19) (= 0 v_~z$flush_delayed~0_12) (= 0 v_~z$w_buff0~0_25) (= 0 v_~z$r_buff1_thd3~0_50) (= 0 v_~z$w_buff1~0_24) (= 0 v_~y~0_9))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_63|, #memory_int=|v_#memory_int_20|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t154~0.offset=|v_ULTIMATE.start_main_~#t154~0.offset_14|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_16, 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_22|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_20, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, ULTIMATE.start_main_~#t153~0.base=|v_ULTIMATE.start_main_~#t153~0.base_19|, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_15, ~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_74, ~z$flush_delayed~0=v_~z$flush_delayed~0_12, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_~#t155~0.offset=|v_ULTIMATE.start_main_~#t155~0.offset_15|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_19, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_76, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, ~x~0=v_~x~0_18, ULTIMATE.start_main_~#t154~0.base=|v_ULTIMATE.start_main_~#t154~0.base_18|, ULTIMATE.start_main_~#t155~0.base=|v_ULTIMATE.start_main_~#t155~0.base_19|, ~z$read_delayed~0=v_~z$read_delayed~0_6, ~z$w_buff1~0=v_~z$w_buff1~0_24, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_11|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_9|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_25, ~y~0=v_~y~0_9, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_20, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_15, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_7|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_111, ~z$w_buff0~0=v_~z$w_buff0~0_25, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_8|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_50, ULTIMATE.start_main_~#t153~0.offset=|v_ULTIMATE.start_main_~#t153~0.offset_15|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_19|, ~z~0=v_~z~0_28, ~weak$$choice2~0=v_~weak$$choice2~0_32, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_27} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t154~0.offset, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t153~0.base, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~weak$$choice0~0, ULTIMATE.start_main_~#t155~0.offset, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t154~0.base, ULTIMATE.start_main_~#t155~0.base, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ~__unbuffered_p1_EBX~0, 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_~#t153~0.offset, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 20:07:27,483 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [864] [864] L830-1-->L832: Formula: (and (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t154~0.base_11| 4)) (= |v_ULTIMATE.start_main_~#t154~0.offset_9| 0) (= |v_#valid_35| (store |v_#valid_36| |v_ULTIMATE.start_main_~#t154~0.base_11| 1)) (= 0 (select |v_#valid_36| |v_ULTIMATE.start_main_~#t154~0.base_11|)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t154~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t154~0.base_11|) |v_ULTIMATE.start_main_~#t154~0.offset_9| 1)) |v_#memory_int_13|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t154~0.base_11|) (not (= 0 |v_ULTIMATE.start_main_~#t154~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t154~0.offset=|v_ULTIMATE.start_main_~#t154~0.offset_9|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|, ULTIMATE.start_main_~#t154~0.base=|v_ULTIMATE.start_main_~#t154~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t154~0.offset, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length, ULTIMATE.start_main_~#t154~0.base] because there is no mapped edge [2019-12-18 20:07:27,484 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L4-->L748: Formula: (and (= 1 v_~x~0_6) (= v_~z$r_buff0_thd0~0_15 v_~z$r_buff1_thd0~0_11) (= v_~z$r_buff0_thd2~0_15 v_~z$r_buff1_thd2~0_11) (= v_~z$r_buff0_thd3~0_45 v_~z$r_buff1_thd3~0_27) (= v_~z$r_buff0_thd1~0_17 1) (not (= 0 v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_6)) (= v_~z$r_buff0_thd1~0_18 v_~z$r_buff1_thd1~0_11)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_15, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_45, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_6, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_18, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_15} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_15, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_27, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_11, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_11, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_11, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_45, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_6, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_17, ~x~0=v_~x~0_6, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_15} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-18 20:07:27,486 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L771-2-->L771-4: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd2~0_In-1251054974 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1251054974 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite9_Out-1251054974| ~z~0_In-1251054974) (or .cse0 .cse1)) (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite9_Out-1251054974| ~z$w_buff1~0_In-1251054974) (not .cse1)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1251054974, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1251054974, ~z$w_buff1~0=~z$w_buff1~0_In-1251054974, ~z~0=~z~0_In-1251054974} OutVars{P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out-1251054974|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1251054974, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1251054974, ~z$w_buff1~0=~z$w_buff1~0_In-1251054974, ~z~0=~z~0_In-1251054974} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-18 20:07:27,486 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L771-4-->L772: Formula: (= v_~z~0_18 |v_P1Thread1of1ForFork2_#t~ite9_8|) InVars {P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_8|} OutVars{P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_7|, P1Thread1of1ForFork2_#t~ite10=|v_P1Thread1of1ForFork2_#t~ite10_7|, ~z~0=v_~z~0_18} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10, ~z~0] because there is no mapped edge [2019-12-18 20:07:27,486 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L772-->L772-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1126652189 256))) (.cse0 (= (mod ~z$r_buff0_thd2~0_In1126652189 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite11_Out1126652189| ~z$w_buff0_used~0_In1126652189)) (and (not .cse1) (= |P1Thread1of1ForFork2_#t~ite11_Out1126652189| 0) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1126652189, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1126652189} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1126652189, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out1126652189|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1126652189} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-18 20:07:27,487 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L773-->L773-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff0_used~0_In362694674 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd2~0_In362694674 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In362694674 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In362694674 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite12_Out362694674| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= |P1Thread1of1ForFork2_#t~ite12_Out362694674| ~z$w_buff1_used~0_In362694674) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In362694674, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In362694674, ~z$w_buff1_used~0=~z$w_buff1_used~0_In362694674, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In362694674} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In362694674, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In362694674, ~z$w_buff1_used~0=~z$w_buff1_used~0_In362694674, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out362694674|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In362694674} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-18 20:07:27,487 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L832-1-->L834: Formula: (and (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t155~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t155~0.base_9|) |v_ULTIMATE.start_main_~#t155~0.offset_8| 2)) |v_#memory_int_9|) (= |v_ULTIMATE.start_main_~#t155~0.offset_8| 0) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t155~0.base_9|) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t155~0.base_9| 1)) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t155~0.base_9| 4) |v_#length_13|) (not (= |v_ULTIMATE.start_main_~#t155~0.base_9| 0)) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t155~0.base_9|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t155~0.base=|v_ULTIMATE.start_main_~#t155~0.base_9|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t155~0.offset=|v_ULTIMATE.start_main_~#t155~0.offset_8|, #valid=|v_#valid_27|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_4|, #memory_int=|v_#memory_int_9|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t155~0.base, ULTIMATE.start_main_~#t155~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length] because there is no mapped edge [2019-12-18 20:07:27,489 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L796-->L796-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-1888700759 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite21_Out-1888700759| |P2Thread1of1ForFork0_#t~ite20_Out-1888700759|) (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In-1888700759 256) 0))) (or (= 0 (mod ~z$w_buff0_used~0_In-1888700759 256)) (and .cse0 (= (mod ~z$r_buff1_thd3~0_In-1888700759 256) 0)) (and .cse0 (= (mod ~z$w_buff1_used~0_In-1888700759 256) 0)))) (= |P2Thread1of1ForFork0_#t~ite20_Out-1888700759| ~z$w_buff0~0_In-1888700759) .cse1) (and (= |P2Thread1of1ForFork0_#t~ite20_In-1888700759| |P2Thread1of1ForFork0_#t~ite20_Out-1888700759|) (= |P2Thread1of1ForFork0_#t~ite21_Out-1888700759| ~z$w_buff0~0_In-1888700759) (not .cse1)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In-1888700759, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1888700759, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1888700759, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1888700759, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1888700759, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_In-1888700759|, ~weak$$choice2~0=~weak$$choice2~0_In-1888700759} OutVars{P2Thread1of1ForFork0_#t~ite21=|P2Thread1of1ForFork0_#t~ite21_Out-1888700759|, ~z$w_buff0~0=~z$w_buff0~0_In-1888700759, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1888700759, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1888700759, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1888700759, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1888700759, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_Out-1888700759|, ~weak$$choice2~0=~weak$$choice2~0_In-1888700759} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite20] because there is no mapped edge [2019-12-18 20:07:27,490 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [876] [876] L797-->L797-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In215551533 256)))) (or (and .cse0 (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In215551533 256) 0))) (or (= (mod ~z$w_buff0_used~0_In215551533 256) 0) (and (= 0 (mod ~z$r_buff1_thd3~0_In215551533 256)) .cse1) (and .cse1 (= 0 (mod ~z$w_buff1_used~0_In215551533 256))))) (= |P2Thread1of1ForFork0_#t~ite23_Out215551533| ~z$w_buff1~0_In215551533) (= |P2Thread1of1ForFork0_#t~ite24_Out215551533| |P2Thread1of1ForFork0_#t~ite23_Out215551533|)) (and (= |P2Thread1of1ForFork0_#t~ite23_In215551533| |P2Thread1of1ForFork0_#t~ite23_Out215551533|) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite24_Out215551533| ~z$w_buff1~0_In215551533)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In215551533, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In215551533, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_In215551533|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In215551533, ~z$w_buff1~0=~z$w_buff1~0_In215551533, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In215551533, ~weak$$choice2~0=~weak$$choice2~0_In215551533} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In215551533, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_Out215551533|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In215551533, P2Thread1of1ForFork0_#t~ite24=|P2Thread1of1ForFork0_#t~ite24_Out215551533|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In215551533, ~z$w_buff1~0=~z$w_buff1~0_In215551533, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In215551533, ~weak$$choice2~0=~weak$$choice2~0_In215551533} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24] because there is no mapped edge [2019-12-18 20:07:27,491 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L798-->L798-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In496719483 256) 0))) (or (and (= ~z$w_buff0_used~0_In496719483 |P2Thread1of1ForFork0_#t~ite27_Out496719483|) (= |P2Thread1of1ForFork0_#t~ite26_In496719483| |P2Thread1of1ForFork0_#t~ite26_Out496719483|) (not .cse0)) (and .cse0 (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In496719483 256) 0))) (or (and (= (mod ~z$w_buff1_used~0_In496719483 256) 0) .cse1) (and (= 0 (mod ~z$r_buff1_thd3~0_In496719483 256)) .cse1) (= (mod ~z$w_buff0_used~0_In496719483 256) 0))) (= ~z$w_buff0_used~0_In496719483 |P2Thread1of1ForFork0_#t~ite26_Out496719483|) (= |P2Thread1of1ForFork0_#t~ite27_Out496719483| |P2Thread1of1ForFork0_#t~ite26_Out496719483|)))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In496719483|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In496719483, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In496719483, ~z$w_buff1_used~0=~z$w_buff1_used~0_In496719483, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In496719483, ~weak$$choice2~0=~weak$$choice2~0_In496719483} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out496719483|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out496719483|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In496719483, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In496719483, ~z$w_buff1_used~0=~z$w_buff1_used~0_In496719483, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In496719483, ~weak$$choice2~0=~weak$$choice2~0_In496719483} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-18 20:07:27,492 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L800-->L801: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_16 256))) (= v_~z$r_buff0_thd3~0_49 v_~z$r_buff0_thd3~0_48)) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_49, ~weak$$choice2~0=v_~weak$$choice2~0_16} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_9|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_9|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_48, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_8|, ~weak$$choice2~0=v_~weak$$choice2~0_16} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-18 20:07:27,494 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L803-->L807: Formula: (and (= v_~z~0_21 v_~z$mem_tmp~0_5) (not (= (mod v_~z$flush_delayed~0_8 256) 0)) (= 0 v_~z$flush_delayed~0_7)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_8} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_7, ~z~0=v_~z~0_21} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-18 20:07:27,494 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L807-2-->L807-4: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd3~0_In-1877885254 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1877885254 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite38_Out-1877885254| ~z~0_In-1877885254)) (and (= |P2Thread1of1ForFork0_#t~ite38_Out-1877885254| ~z$w_buff1~0_In-1877885254) (not .cse1) (not .cse0)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1877885254, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1877885254, ~z$w_buff1~0=~z$w_buff1~0_In-1877885254, ~z~0=~z~0_In-1877885254} OutVars{P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out-1877885254|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1877885254, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1877885254, ~z$w_buff1~0=~z$w_buff1~0_In-1877885254, ~z~0=~z~0_In-1877885254} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-18 20:07:27,494 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L807-4-->L808: Formula: (= v_~z~0_17 |v_P2Thread1of1ForFork0_#t~ite38_8|) InVars {P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_8|} OutVars{P2Thread1of1ForFork0_#t~ite39=|v_P2Thread1of1ForFork0_#t~ite39_7|, P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_7|, ~z~0=v_~z~0_17} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38, ~z~0] because there is no mapped edge [2019-12-18 20:07:27,495 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L808-->L808-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In1221311718 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In1221311718 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite40_Out1221311718| ~z$w_buff0_used~0_In1221311718) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite40_Out1221311718| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1221311718, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1221311718} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1221311718, P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out1221311718|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1221311718} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-18 20:07:27,495 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L774-->L774-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd2~0_In1639272090 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1639272090 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd2~0_In1639272090 |P1Thread1of1ForFork2_#t~ite13_Out1639272090|)) (and (not .cse1) (= 0 |P1Thread1of1ForFork2_#t~ite13_Out1639272090|) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1639272090, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1639272090} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1639272090, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out1639272090|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1639272090} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-18 20:07:27,496 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L775-->L775-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff1_thd2~0_In-332333136 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-332333136 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-332333136 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-332333136 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork2_#t~ite14_Out-332333136| 0)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite14_Out-332333136| ~z$r_buff1_thd2~0_In-332333136)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-332333136, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-332333136, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-332333136, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-332333136} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-332333136, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-332333136, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-332333136, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-332333136|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-332333136} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-18 20:07:27,496 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [851] [851] L775-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork2_#t~ite14_8| v_~z$r_buff1_thd2~0_12) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_8|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_12, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_7|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-18 20:07:27,498 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L749-->L749-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1350244073 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In-1350244073 256)))) (or (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork1_#t~ite5_Out-1350244073| 0)) (and (= |P0Thread1of1ForFork1_#t~ite5_Out-1350244073| ~z$w_buff0_used~0_In-1350244073) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1350244073, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1350244073} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out-1350244073|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1350244073, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1350244073} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-18 20:07:27,499 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L750-->L750-2: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd1~0_In1420594866 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In1420594866 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd1~0_In1420594866 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In1420594866 256) 0))) (or (and (= |P0Thread1of1ForFork1_#t~ite6_Out1420594866| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P0Thread1of1ForFork1_#t~ite6_Out1420594866| ~z$w_buff1_used~0_In1420594866) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1420594866, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1420594866, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1420594866, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1420594866} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1420594866, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out1420594866|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1420594866, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1420594866, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1420594866} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-18 20:07:27,500 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L751-->L752: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd1~0_In1367718839 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In1367718839 256) 0))) (or (and (= ~z$r_buff0_thd1~0_Out1367718839 ~z$r_buff0_thd1~0_In1367718839) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= ~z$r_buff0_thd1~0_Out1367718839 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1367718839, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1367718839} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1367718839, P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out1367718839|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out1367718839} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 20:07:27,500 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L752-->L752-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-368098421 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd1~0_In-368098421 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-368098421 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd1~0_In-368098421 256)))) (or (and (= 0 |P0Thread1of1ForFork1_#t~ite8_Out-368098421|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$r_buff1_thd1~0_In-368098421 |P0Thread1of1ForFork1_#t~ite8_Out-368098421|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-368098421, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-368098421, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-368098421, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-368098421} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-368098421|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-368098421, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-368098421, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-368098421, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-368098421} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-18 20:07:27,500 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [868] [868] L752-2-->P0EXIT: Formula: (and (= v_~z$r_buff1_thd1~0_16 |v_P0Thread1of1ForFork1_#t~ite8_8|) (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_7|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_16, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 20:07:27,501 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L809-->L809-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In-362530678 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In-362530678 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd3~0_In-362530678 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-362530678 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite41_Out-362530678| ~z$w_buff1_used~0_In-362530678) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork0_#t~ite41_Out-362530678| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-362530678, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-362530678, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-362530678, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-362530678} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-362530678, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-362530678, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-362530678, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-362530678, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out-362530678|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-18 20:07:27,502 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L810-->L810-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-323949806 256))) (.cse1 (= (mod ~z$r_buff0_thd3~0_In-323949806 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite42_Out-323949806| ~z$r_buff0_thd3~0_In-323949806) (or .cse0 .cse1)) (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite42_Out-323949806| 0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-323949806, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-323949806} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-323949806, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-323949806, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out-323949806|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-18 20:07:27,503 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L811-->L811-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In2078939003 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd3~0_In2078939003 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In2078939003 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd3~0_In2078939003 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork0_#t~ite43_Out2078939003|)) (and (= ~z$r_buff1_thd3~0_In2078939003 |P2Thread1of1ForFork0_#t~ite43_Out2078939003|) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2078939003, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In2078939003, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2078939003, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2078939003} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out2078939003|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2078939003, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In2078939003, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2078939003, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2078939003} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-18 20:07:27,504 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [853] [853] L811-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= v_~z$r_buff1_thd3~0_43 |v_P2Thread1of1ForFork0_#t~ite43_8|)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_43, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-18 20:07:27,504 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [807] [807] L834-1-->L840: Formula: (and (= 3 v_~__unbuffered_cnt~0_10) (= v_~main$tmp_guard0~0_5 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 20:07:27,505 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L840-2-->L840-5: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In1316828604 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In1316828604 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite47_Out1316828604| |ULTIMATE.start_main_#t~ite48_Out1316828604|))) (or (and (= |ULTIMATE.start_main_#t~ite47_Out1316828604| ~z~0_In1316828604) (or .cse0 .cse1) .cse2) (and (= |ULTIMATE.start_main_#t~ite47_Out1316828604| ~z$w_buff1~0_In1316828604) (not .cse0) (not .cse1) .cse2))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1316828604, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1316828604, ~z$w_buff1~0=~z$w_buff1~0_In1316828604, ~z~0=~z~0_In1316828604} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1316828604, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out1316828604|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1316828604, ~z$w_buff1~0=~z$w_buff1~0_In1316828604, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out1316828604|, ~z~0=~z~0_In1316828604} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-18 20:07:27,505 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L841-->L841-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-762711743 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-762711743 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite49_Out-762711743| 0)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite49_Out-762711743| ~z$w_buff0_used~0_In-762711743)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-762711743, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-762711743} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-762711743, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-762711743, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-762711743|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-18 20:07:27,507 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L842-->L842-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In-2126009900 256))) (.cse3 (= (mod ~z$r_buff1_thd0~0_In-2126009900 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-2126009900 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-2126009900 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite50_Out-2126009900| 0)) (and (or .cse2 .cse3) (= ~z$w_buff1_used~0_In-2126009900 |ULTIMATE.start_main_#t~ite50_Out-2126009900|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2126009900, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2126009900, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2126009900, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2126009900} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-2126009900|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2126009900, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2126009900, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2126009900, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2126009900} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-18 20:07:27,508 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L843-->L843-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In635388531 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In635388531 256)))) (or (and (= ~z$r_buff0_thd0~0_In635388531 |ULTIMATE.start_main_#t~ite51_Out635388531|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite51_Out635388531|) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In635388531, ~z$w_buff0_used~0=~z$w_buff0_used~0_In635388531} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In635388531, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out635388531|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In635388531} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-18 20:07:27,509 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L844-->L844-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In1292004324 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In1292004324 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd0~0_In1292004324 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In1292004324 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite52_Out1292004324|)) (and (= ~z$r_buff1_thd0~0_In1292004324 |ULTIMATE.start_main_#t~ite52_Out1292004324|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1292004324, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1292004324, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1292004324, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1292004324} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out1292004324|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1292004324, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1292004324, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1292004324, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1292004324} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-18 20:07:27,509 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [882] [882] L844-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~__unbuffered_p2_EAX~0_8 1) (= v_~main$tmp_guard1~0_9 0) (= 2 v_~__unbuffered_p1_EAX~0_7) (= 0 v_~__unbuffered_p1_EBX~0_8) (= v_~__unbuffered_p2_EBX~0_9 0) (= |v_ULTIMATE.start_main_#t~ite52_13| v_~z$r_buff1_thd0~0_18) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10| (mod v_~main$tmp_guard1~0_9 256)) (= v_~x~0_11 2)) InVars {ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_13|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_7, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~x~0=v_~x~0_11} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_12|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_7, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_18, ~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_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} 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-18 20:07:27,611 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 08:07:27 BasicIcfg [2019-12-18 20:07:27,611 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 20:07:27,612 INFO L168 Benchmark]: Toolchain (without parser) took 120530.51 ms. Allocated memory was 137.4 MB in the beginning and 3.1 GB in the end (delta: 3.0 GB). Free memory was 100.7 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-12-18 20:07:27,613 INFO L168 Benchmark]: CDTParser took 0.54 ms. Allocated memory is still 137.4 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-18 20:07:27,613 INFO L168 Benchmark]: CACSL2BoogieTranslator took 818.08 ms. Allocated memory was 137.4 MB in the beginning and 201.3 MB in the end (delta: 64.0 MB). Free memory was 100.4 MB in the beginning and 154.6 MB in the end (delta: -54.1 MB). Peak memory consumption was 25.8 MB. Max. memory is 7.1 GB. [2019-12-18 20:07:27,614 INFO L168 Benchmark]: Boogie Procedure Inliner took 83.87 ms. Allocated memory is still 201.3 MB. Free memory was 154.6 MB in the beginning and 151.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-18 20:07:27,614 INFO L168 Benchmark]: Boogie Preprocessor took 53.79 ms. Allocated memory is still 201.3 MB. Free memory was 151.8 MB in the beginning and 149.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 20:07:27,615 INFO L168 Benchmark]: RCFGBuilder took 880.47 ms. Allocated memory is still 201.3 MB. Free memory was 149.1 MB in the beginning and 99.0 MB in the end (delta: 50.1 MB). Peak memory consumption was 50.1 MB. Max. memory is 7.1 GB. [2019-12-18 20:07:27,615 INFO L168 Benchmark]: TraceAbstraction took 118689.73 ms. Allocated memory was 201.3 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 98.3 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-12-18 20:07:27,617 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.54 ms. Allocated memory is still 137.4 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 818.08 ms. Allocated memory was 137.4 MB in the beginning and 201.3 MB in the end (delta: 64.0 MB). Free memory was 100.4 MB in the beginning and 154.6 MB in the end (delta: -54.1 MB). Peak memory consumption was 25.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 83.87 ms. Allocated memory is still 201.3 MB. Free memory was 154.6 MB in the beginning and 151.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 53.79 ms. Allocated memory is still 201.3 MB. Free memory was 151.8 MB in the beginning and 149.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 880.47 ms. Allocated memory is still 201.3 MB. Free memory was 149.1 MB in the beginning and 99.0 MB in the end (delta: 50.1 MB). Peak memory consumption was 50.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 118689.73 ms. Allocated memory was 201.3 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 98.3 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.0s, 177 ProgramPointsBefore, 95 ProgramPointsAfterwards, 214 TransitionsBefore, 105 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 34 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 30 ConcurrentYvCompositions, 31 ChoiceCompositions, 7246 VarBasedMoverChecksPositive, 203 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 82443 CheckedPairsTotal, 112 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L830] FCALL, FORK 0 pthread_create(&t153, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L832] FCALL, FORK 0 pthread_create(&t154, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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=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] [L733] 1 z$w_buff1 = z$w_buff0 [L734] 1 z$w_buff0 = 1 [L735] 1 z$w_buff1_used = z$w_buff0_used [L736] 1 z$w_buff0_used = (_Bool)1 [L762] 2 x = 2 [L765] 2 __unbuffered_p1_EAX = x [L768] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=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=2, 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] [L771] 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_p1_EAX=2, __unbuffered_p1_EBX=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=2, 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] [L772] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L834] FCALL, FORK 0 pthread_create(&t155, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=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=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L785] 3 y = 1 [L788] 3 __unbuffered_p2_EAX = y [L791] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L792] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L793] 3 z$flush_delayed = weak$$choice2 [L794] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=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=10, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L795] 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_p1_EAX=2, __unbuffered_p1_EBX=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=10, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L795] 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) [L796] 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)) [L797] 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)) [L798] 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)) [L799] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=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=10, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L799] 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)) [L801] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=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=10, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L801] 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)) [L802] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=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=10, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L807] 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=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=10, weak$$choice2=1, 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_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L773] 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 [L774] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L748] 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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=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=10, weak$$choice2=1, 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_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L748] 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) [L749] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L750] 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 [L808] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L809] 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 [L810] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L840] 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_p1_EAX=2, __unbuffered_p1_EBX=0, __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=10, weak$$choice2=1, 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=1, z$w_buff1=0, z$w_buff1_used=0] [L840] 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) [L841] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L842] 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 [L843] 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, 168 locations, 2 error locations. Result: UNSAFE, OverallTime: 118.3s, OverallIterations: 34, TraceHistogramMax: 1, AutomataDifference: 42.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8299 SDtfs, 13275 SDslu, 23522 SDs, 0 SdLazy, 14181 SolverSat, 816 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 455 GetRequests, 74 SyntacticMatches, 20 SemanticMatches, 361 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1731 ImplicationChecksByTransitivity, 5.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=158867occurred 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, 33 MinimizatonAttempts, 809224 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 1541 NumberOfCodeBlocks, 1541 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 1441 ConstructedInterpolants, 0 QuantifiedInterpolants, 265289 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 33 InterpolantComputations, 33 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...