/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix006_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 12:13:07,650 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 12:13:07,652 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 12:13:07,665 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 12:13:07,665 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 12:13:07,666 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 12:13:07,668 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 12:13:07,669 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 12:13:07,671 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 12:13:07,672 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 12:13:07,676 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 12:13:07,677 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 12:13:07,678 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 12:13:07,679 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 12:13:07,680 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 12:13:07,681 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 12:13:07,682 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 12:13:07,682 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 12:13:07,684 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 12:13:07,686 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 12:13:07,687 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 12:13:07,689 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 12:13:07,690 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 12:13:07,690 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 12:13:07,692 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 12:13:07,692 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 12:13:07,693 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 12:13:07,693 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 12:13:07,694 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 12:13:07,695 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 12:13:07,695 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 12:13:07,696 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 12:13:07,697 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 12:13:07,697 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 12:13:07,698 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 12:13:07,698 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 12:13:07,699 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 12:13:07,699 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 12:13:07,700 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 12:13:07,700 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 12:13:07,701 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 12:13:07,702 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 12:13:07,715 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 12:13:07,716 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 12:13:07,717 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 12:13:07,717 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 12:13:07,717 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 12:13:07,718 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 12:13:07,718 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 12:13:07,718 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 12:13:07,718 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 12:13:07,719 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 12:13:07,719 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 12:13:07,719 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 12:13:07,719 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 12:13:07,719 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 12:13:07,720 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 12:13:07,720 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 12:13:07,720 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 12:13:07,720 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 12:13:07,720 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 12:13:07,721 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 12:13:07,721 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 12:13:07,721 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 12:13:07,721 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 12:13:07,722 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 12:13:07,722 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 12:13:07,722 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 12:13:07,722 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 12:13:07,722 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 12:13:07,723 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 12:13:07,723 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 12:13:08,031 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 12:13:08,055 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 12:13:08,059 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 12:13:08,061 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 12:13:08,061 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 12:13:08,062 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 12:13:08,143 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aaea26b17/99ad17433253460a98d481c0cab4c22b/FLAGc67b17977 [2019-12-18 12:13:08,758 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 12:13:08,759 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix006_power.oepc.i [2019-12-18 12:13:08,780 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aaea26b17/99ad17433253460a98d481c0cab4c22b/FLAGc67b17977 [2019-12-18 12:13:08,960 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aaea26b17/99ad17433253460a98d481c0cab4c22b [2019-12-18 12:13:08,972 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 12:13:08,975 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 12:13:08,978 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 12:13:08,979 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 12:13:08,982 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 12:13:08,983 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 12:13:08" (1/1) ... [2019-12-18 12:13:08,987 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@217be98c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:13:08, skipping insertion in model container [2019-12-18 12:13:08,987 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 12:13:08" (1/1) ... [2019-12-18 12:13:08,996 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 12:13:09,060 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 12:13:09,605 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 12:13:09,619 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 12:13:09,686 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 12:13:09,775 INFO L208 MainTranslator]: Completed translation [2019-12-18 12:13:09,775 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:13:09 WrapperNode [2019-12-18 12:13:09,775 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 12:13:09,776 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 12:13:09,776 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 12:13:09,776 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 12:13:09,783 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:13:09" (1/1) ... [2019-12-18 12:13:09,811 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:13:09" (1/1) ... [2019-12-18 12:13:09,843 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 12:13:09,843 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 12:13:09,844 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 12:13:09,844 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 12:13:09,856 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:13:09" (1/1) ... [2019-12-18 12:13:09,856 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:13:09" (1/1) ... [2019-12-18 12:13:09,861 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:13:09" (1/1) ... [2019-12-18 12:13:09,861 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:13:09" (1/1) ... [2019-12-18 12:13:09,875 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:13:09" (1/1) ... [2019-12-18 12:13:09,881 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:13:09" (1/1) ... [2019-12-18 12:13:09,884 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:13:09" (1/1) ... [2019-12-18 12:13:09,890 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 12:13:09,890 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 12:13:09,890 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 12:13:09,890 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 12:13:09,891 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:13:09" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 12:13:09,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 12:13:09,964 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 12:13:09,964 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 12:13:09,964 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 12:13:09,964 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 12:13:09,965 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 12:13:09,965 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 12:13:09,966 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 12:13:09,966 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 12:13:09,967 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 12:13:09,967 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 12:13:09,968 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 12:13:09,968 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 12:13:09,970 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 12:13:10,721 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 12:13:10,721 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 12:13:10,722 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 12:13:10 BoogieIcfgContainer [2019-12-18 12:13:10,723 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 12:13:10,724 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 12:13:10,724 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 12:13:10,728 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 12:13:10,728 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 12:13:08" (1/3) ... [2019-12-18 12:13:10,729 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15fbdbfa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 12:13:10, skipping insertion in model container [2019-12-18 12:13:10,729 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:13:09" (2/3) ... [2019-12-18 12:13:10,730 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15fbdbfa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 12:13:10, skipping insertion in model container [2019-12-18 12:13:10,730 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 12:13:10" (3/3) ... [2019-12-18 12:13:10,733 INFO L109 eAbstractionObserver]: Analyzing ICFG mix006_power.oepc.i [2019-12-18 12:13:10,745 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 12:13:10,745 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 12:13:10,755 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 12:13:10,756 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 12:13:10,801 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,801 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,802 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,802 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,802 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,802 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,803 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,803 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,804 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,804 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,804 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,805 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,805 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,805 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,806 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,806 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,806 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,807 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,807 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,807 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,808 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,808 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,808 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,809 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,809 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,809 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,809 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,810 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,810 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,810 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,811 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,811 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,811 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,811 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,812 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,812 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,812 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,813 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,813 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,814 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,834 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,834 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,834 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,834 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,835 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,835 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,835 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,835 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,835 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,836 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,836 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,836 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,836 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,837 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,838 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,838 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,838 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,838 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,838 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,839 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,839 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,839 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,839 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,840 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,840 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,840 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,840 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,840 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,841 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,841 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,841 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,841 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,842 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,842 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,842 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,842 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,843 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,843 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,843 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,843 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,843 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,844 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,844 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,844 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,844 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,845 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,845 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,845 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,845 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,845 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,846 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,846 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,846 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,846 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,846 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,847 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,847 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,847 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,847 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,848 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,848 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,848 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,848 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,848 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,849 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,849 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,849 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,849 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,849 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,850 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,850 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,850 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,850 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,850 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,851 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,851 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,851 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,851 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,851 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,852 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,852 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,852 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,852 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,853 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,853 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,853 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,853 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,853 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,854 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,854 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,854 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,854 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,854 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,855 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,855 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,855 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,855 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,855 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,856 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,856 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,856 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,856 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,856 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,857 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,857 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,857 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,857 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,858 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,858 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,858 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,858 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,858 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,859 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,859 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,859 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,859 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,859 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,860 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,860 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,860 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,860 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,860 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,861 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,861 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,861 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,861 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,861 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,862 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,862 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,862 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,862 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,866 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,866 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,866 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,866 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,867 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,867 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,867 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,867 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,867 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,868 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,868 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,868 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,868 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,868 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,868 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,869 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,869 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,869 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,869 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,869 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,870 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,870 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,870 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,870 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,870 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,871 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,871 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,871 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,871 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,871 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,872 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,872 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,872 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,876 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,876 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,876 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,877 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,877 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,877 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,877 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,877 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,878 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,878 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,878 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,878 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,880 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,880 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,880 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,881 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,881 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,881 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,881 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,881 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,882 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,882 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:10,901 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 12:13:10,923 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 12:13:10,923 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 12:13:10,923 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 12:13:10,923 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 12:13:10,923 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 12:13:10,923 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 12:13:10,923 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 12:13:10,924 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 12:13:10,939 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 177 places, 214 transitions [2019-12-18 12:13:10,942 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 214 transitions [2019-12-18 12:13:11,060 INFO L126 PetriNetUnfolder]: 47/211 cut-off events. [2019-12-18 12:13:11,061 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 12:13:11,086 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 12:13:11,112 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 214 transitions [2019-12-18 12:13:11,182 INFO L126 PetriNetUnfolder]: 47/211 cut-off events. [2019-12-18 12:13:11,182 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 12:13:11,192 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 12:13:11,218 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-18 12:13:11,220 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 12:13:16,826 WARN L192 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-12-18 12:13:16,947 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-18 12:13:16,975 INFO L206 etLargeBlockEncoding]: Checked pairs total: 78628 [2019-12-18 12:13:16,975 INFO L214 etLargeBlockEncoding]: Total number of compositions: 115 [2019-12-18 12:13:16,979 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 93 places, 102 transitions [2019-12-18 12:13:34,373 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 110182 states. [2019-12-18 12:13:34,376 INFO L276 IsEmpty]: Start isEmpty. Operand 110182 states. [2019-12-18 12:13:34,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 12:13:34,381 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:13:34,381 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 12:13:34,382 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 12:13:34,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:13:34,387 INFO L82 PathProgramCache]: Analyzing trace with hash 917838, now seen corresponding path program 1 times [2019-12-18 12:13:34,396 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:13:34,397 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755544733] [2019-12-18 12:13:34,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:13:34,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:13:34,611 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 12:13:34,611 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755544733] [2019-12-18 12:13:34,612 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:13:34,613 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 12:13:34,613 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651058868] [2019-12-18 12:13:34,620 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:13:34,621 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:13:34,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:13:34,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:13:34,639 INFO L87 Difference]: Start difference. First operand 110182 states. Second operand 3 states. [2019-12-18 12:13:36,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:13:36,153 INFO L93 Difference]: Finished difference Result 109312 states and 463550 transitions. [2019-12-18 12:13:36,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:13:36,155 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 12:13:36,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:13:36,761 INFO L225 Difference]: With dead ends: 109312 [2019-12-18 12:13:36,761 INFO L226 Difference]: Without dead ends: 102592 [2019-12-18 12:13:36,762 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 12:13:43,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102592 states. [2019-12-18 12:13:46,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102592 to 102592. [2019-12-18 12:13:46,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102592 states. [2019-12-18 12:13:46,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102592 states to 102592 states and 434430 transitions. [2019-12-18 12:13:46,626 INFO L78 Accepts]: Start accepts. Automaton has 102592 states and 434430 transitions. Word has length 3 [2019-12-18 12:13:46,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:13:46,627 INFO L462 AbstractCegarLoop]: Abstraction has 102592 states and 434430 transitions. [2019-12-18 12:13:46,627 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:13:46,627 INFO L276 IsEmpty]: Start isEmpty. Operand 102592 states and 434430 transitions. [2019-12-18 12:13:46,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 12:13:46,630 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:13:46,630 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:13:46,630 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 12:13:46,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:13:46,631 INFO L82 PathProgramCache]: Analyzing trace with hash 1857942485, now seen corresponding path program 1 times [2019-12-18 12:13:46,631 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:13:46,631 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138606337] [2019-12-18 12:13:46,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:13:46,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:13:46,764 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 12:13:46,765 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138606337] [2019-12-18 12:13:46,765 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:13:46,765 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:13:46,766 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551342036] [2019-12-18 12:13:46,767 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:13:46,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:13:46,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:13:46,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:13:46,768 INFO L87 Difference]: Start difference. First operand 102592 states and 434430 transitions. Second operand 4 states. [2019-12-18 12:13:52,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:13:52,491 INFO L93 Difference]: Finished difference Result 159508 states and 648686 transitions. [2019-12-18 12:13:52,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:13:52,492 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 12:13:52,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:13:53,075 INFO L225 Difference]: With dead ends: 159508 [2019-12-18 12:13:53,075 INFO L226 Difference]: Without dead ends: 159459 [2019-12-18 12:13:53,076 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 12:14:00,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159459 states. [2019-12-18 12:14:04,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159459 to 146095. [2019-12-18 12:14:04,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146095 states. [2019-12-18 12:14:04,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146095 states to 146095 states and 601450 transitions. [2019-12-18 12:14:04,577 INFO L78 Accepts]: Start accepts. Automaton has 146095 states and 601450 transitions. Word has length 11 [2019-12-18 12:14:04,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:14:04,578 INFO L462 AbstractCegarLoop]: Abstraction has 146095 states and 601450 transitions. [2019-12-18 12:14:04,578 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:14:04,578 INFO L276 IsEmpty]: Start isEmpty. Operand 146095 states and 601450 transitions. [2019-12-18 12:14:04,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 12:14:04,585 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:14:04,585 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:14:04,585 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 12:14:04,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:14:04,586 INFO L82 PathProgramCache]: Analyzing trace with hash 230844073, now seen corresponding path program 1 times [2019-12-18 12:14:04,586 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:14:04,586 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283789720] [2019-12-18 12:14:04,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:14:04,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:14:04,678 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 12:14:04,679 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283789720] [2019-12-18 12:14:04,679 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:14:04,679 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:14:04,679 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548247469] [2019-12-18 12:14:04,680 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:14:04,680 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:14:04,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:14:04,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:14:04,681 INFO L87 Difference]: Start difference. First operand 146095 states and 601450 transitions. Second operand 3 states. [2019-12-18 12:14:04,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:14:04,805 INFO L93 Difference]: Finished difference Result 32284 states and 104220 transitions. [2019-12-18 12:14:04,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:14:04,806 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 12:14:04,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:14:04,858 INFO L225 Difference]: With dead ends: 32284 [2019-12-18 12:14:04,858 INFO L226 Difference]: Without dead ends: 32284 [2019-12-18 12:14:04,859 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 12:14:09,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32284 states. [2019-12-18 12:14:10,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32284 to 32284. [2019-12-18 12:14:10,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32284 states. [2019-12-18 12:14:10,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32284 states to 32284 states and 104220 transitions. [2019-12-18 12:14:10,105 INFO L78 Accepts]: Start accepts. Automaton has 32284 states and 104220 transitions. Word has length 13 [2019-12-18 12:14:10,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:14:10,105 INFO L462 AbstractCegarLoop]: Abstraction has 32284 states and 104220 transitions. [2019-12-18 12:14:10,106 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:14:10,106 INFO L276 IsEmpty]: Start isEmpty. Operand 32284 states and 104220 transitions. [2019-12-18 12:14:10,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 12:14:10,109 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:14:10,110 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:14:10,110 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 12:14:10,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:14:10,110 INFO L82 PathProgramCache]: Analyzing trace with hash 1069845708, now seen corresponding path program 1 times [2019-12-18 12:14:10,110 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:14:10,111 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921298500] [2019-12-18 12:14:10,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:14:10,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:14:10,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:14:10,230 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921298500] [2019-12-18 12:14:10,230 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:14:10,230 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:14:10,230 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289837191] [2019-12-18 12:14:10,231 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:14:10,231 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:14:10,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:14:10,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:14:10,232 INFO L87 Difference]: Start difference. First operand 32284 states and 104220 transitions. Second operand 4 states. [2019-12-18 12:14:10,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:14:10,637 INFO L93 Difference]: Finished difference Result 40215 states and 129418 transitions. [2019-12-18 12:14:10,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:14:10,637 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 12:14:10,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:14:10,701 INFO L225 Difference]: With dead ends: 40215 [2019-12-18 12:14:10,701 INFO L226 Difference]: Without dead ends: 40215 [2019-12-18 12:14:10,702 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 12:14:10,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40215 states. [2019-12-18 12:14:11,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40215 to 36090. [2019-12-18 12:14:11,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36090 states. [2019-12-18 12:14:11,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36090 states to 36090 states and 116495 transitions. [2019-12-18 12:14:11,330 INFO L78 Accepts]: Start accepts. Automaton has 36090 states and 116495 transitions. Word has length 16 [2019-12-18 12:14:11,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:14:11,331 INFO L462 AbstractCegarLoop]: Abstraction has 36090 states and 116495 transitions. [2019-12-18 12:14:11,331 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:14:11,331 INFO L276 IsEmpty]: Start isEmpty. Operand 36090 states and 116495 transitions. [2019-12-18 12:14:11,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 12:14:11,340 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:14:11,340 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 12:14:11,340 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 12:14:11,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:14:11,340 INFO L82 PathProgramCache]: Analyzing trace with hash 6986775, now seen corresponding path program 1 times [2019-12-18 12:14:11,341 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:14:11,341 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556030930] [2019-12-18 12:14:11,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:14:11,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:14:11,478 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 12:14:11,478 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556030930] [2019-12-18 12:14:11,479 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:14:11,479 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:14:11,479 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684395738] [2019-12-18 12:14:11,479 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:14:11,480 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:14:11,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:14:11,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:14:11,480 INFO L87 Difference]: Start difference. First operand 36090 states and 116495 transitions. Second operand 5 states. [2019-12-18 12:14:12,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:14:12,077 INFO L93 Difference]: Finished difference Result 46566 states and 147831 transitions. [2019-12-18 12:14:12,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 12:14:12,078 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 12:14:12,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:14:12,147 INFO L225 Difference]: With dead ends: 46566 [2019-12-18 12:14:12,147 INFO L226 Difference]: Without dead ends: 46559 [2019-12-18 12:14:12,148 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 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 12:14:12,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46559 states. [2019-12-18 12:14:13,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46559 to 35784. [2019-12-18 12:14:13,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35784 states. [2019-12-18 12:14:13,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35784 states to 35784 states and 115349 transitions. [2019-12-18 12:14:13,237 INFO L78 Accepts]: Start accepts. Automaton has 35784 states and 115349 transitions. Word has length 22 [2019-12-18 12:14:13,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:14:13,238 INFO L462 AbstractCegarLoop]: Abstraction has 35784 states and 115349 transitions. [2019-12-18 12:14:13,238 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:14:13,238 INFO L276 IsEmpty]: Start isEmpty. Operand 35784 states and 115349 transitions. [2019-12-18 12:14:13,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 12:14:13,250 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:14:13,250 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 12:14:13,250 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 12:14:13,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:14:13,251 INFO L82 PathProgramCache]: Analyzing trace with hash -1437372217, now seen corresponding path program 1 times [2019-12-18 12:14:13,251 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:14:13,251 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738883322] [2019-12-18 12:14:13,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:14:13,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:14:13,303 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 12:14:13,304 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738883322] [2019-12-18 12:14:13,304 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:14:13,304 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:14:13,304 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456744668] [2019-12-18 12:14:13,305 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:14:13,305 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:14:13,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:14:13,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:14:13,305 INFO L87 Difference]: Start difference. First operand 35784 states and 115349 transitions. Second operand 4 states. [2019-12-18 12:14:13,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:14:13,361 INFO L93 Difference]: Finished difference Result 14498 states and 44125 transitions. [2019-12-18 12:14:13,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 12:14:13,362 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 12:14:13,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:14:13,381 INFO L225 Difference]: With dead ends: 14498 [2019-12-18 12:14:13,381 INFO L226 Difference]: Without dead ends: 14498 [2019-12-18 12:14:13,381 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 12:14:13,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14498 states. [2019-12-18 12:14:13,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14498 to 14254. [2019-12-18 12:14:13,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14254 states. [2019-12-18 12:14:13,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14254 states to 14254 states and 43429 transitions. [2019-12-18 12:14:13,600 INFO L78 Accepts]: Start accepts. Automaton has 14254 states and 43429 transitions. Word has length 25 [2019-12-18 12:14:13,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:14:13,600 INFO L462 AbstractCegarLoop]: Abstraction has 14254 states and 43429 transitions. [2019-12-18 12:14:13,600 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:14:13,600 INFO L276 IsEmpty]: Start isEmpty. Operand 14254 states and 43429 transitions. [2019-12-18 12:14:13,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 12:14:13,611 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:14:13,611 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 12:14:13,611 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 12:14:13,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:14:13,612 INFO L82 PathProgramCache]: Analyzing trace with hash 1947963172, now seen corresponding path program 1 times [2019-12-18 12:14:13,612 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:14:13,612 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770175623] [2019-12-18 12:14:13,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:14:13,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:14:13,713 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 12:14:13,714 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770175623] [2019-12-18 12:14:13,714 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:14:13,714 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:14:13,714 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473010133] [2019-12-18 12:14:13,715 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 12:14:13,715 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:14:13,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 12:14:13,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:14:13,715 INFO L87 Difference]: Start difference. First operand 14254 states and 43429 transitions. Second operand 6 states. [2019-12-18 12:14:14,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:14:14,489 INFO L93 Difference]: Finished difference Result 39008 states and 118911 transitions. [2019-12-18 12:14:14,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 12:14:14,490 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-18 12:14:14,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:14:14,550 INFO L225 Difference]: With dead ends: 39008 [2019-12-18 12:14:14,550 INFO L226 Difference]: Without dead ends: 39008 [2019-12-18 12:14:14,551 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-18 12:14:14,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39008 states. [2019-12-18 12:14:14,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39008 to 21620. [2019-12-18 12:14:14,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21620 states. [2019-12-18 12:14:15,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21620 states to 21620 states and 66985 transitions. [2019-12-18 12:14:15,027 INFO L78 Accepts]: Start accepts. Automaton has 21620 states and 66985 transitions. Word has length 27 [2019-12-18 12:14:15,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:14:15,027 INFO L462 AbstractCegarLoop]: Abstraction has 21620 states and 66985 transitions. [2019-12-18 12:14:15,027 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 12:14:15,028 INFO L276 IsEmpty]: Start isEmpty. Operand 21620 states and 66985 transitions. [2019-12-18 12:14:15,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 12:14:15,045 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:14:15,045 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 12:14:15,045 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 12:14:15,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:14:15,046 INFO L82 PathProgramCache]: Analyzing trace with hash -89566793, now seen corresponding path program 1 times [2019-12-18 12:14:15,046 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:14:15,046 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464124092] [2019-12-18 12:14:15,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:14:15,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:14:15,131 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 12:14:15,131 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464124092] [2019-12-18 12:14:15,131 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:14:15,132 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:14:15,132 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557471993] [2019-12-18 12:14:15,132 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 12:14:15,132 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:14:15,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 12:14:15,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:14:15,133 INFO L87 Difference]: Start difference. First operand 21620 states and 66985 transitions. Second operand 6 states. [2019-12-18 12:14:16,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:14:16,172 INFO L93 Difference]: Finished difference Result 43584 states and 132186 transitions. [2019-12-18 12:14:16,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 12:14:16,172 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-12-18 12:14:16,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:14:16,241 INFO L225 Difference]: With dead ends: 43584 [2019-12-18 12:14:16,241 INFO L226 Difference]: Without dead ends: 43584 [2019-12-18 12:14:16,242 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-18 12:14:16,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43584 states. [2019-12-18 12:14:16,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43584 to 21360. [2019-12-18 12:14:16,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21360 states. [2019-12-18 12:14:16,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21360 states to 21360 states and 66500 transitions. [2019-12-18 12:14:16,724 INFO L78 Accepts]: Start accepts. Automaton has 21360 states and 66500 transitions. Word has length 28 [2019-12-18 12:14:16,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:14:16,724 INFO L462 AbstractCegarLoop]: Abstraction has 21360 states and 66500 transitions. [2019-12-18 12:14:16,724 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 12:14:16,724 INFO L276 IsEmpty]: Start isEmpty. Operand 21360 states and 66500 transitions. [2019-12-18 12:14:16,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 12:14:16,748 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:14:16,748 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 12:14:16,748 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 12:14:16,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:14:16,749 INFO L82 PathProgramCache]: Analyzing trace with hash -1720610055, now seen corresponding path program 1 times [2019-12-18 12:14:16,749 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:14:16,749 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427326460] [2019-12-18 12:14:16,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:14:16,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:14:16,850 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 12:14:16,851 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427326460] [2019-12-18 12:14:16,851 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:14:16,851 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 12:14:16,852 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379631288] [2019-12-18 12:14:16,852 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:14:16,852 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:14:16,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:14:16,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:14:16,853 INFO L87 Difference]: Start difference. First operand 21360 states and 66500 transitions. Second operand 7 states. [2019-12-18 12:14:18,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:14:18,278 INFO L93 Difference]: Finished difference Result 51613 states and 157651 transitions. [2019-12-18 12:14:18,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 12:14:18,278 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-18 12:14:18,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:14:18,376 INFO L225 Difference]: With dead ends: 51613 [2019-12-18 12:14:18,376 INFO L226 Difference]: Without dead ends: 51613 [2019-12-18 12:14:18,377 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2019-12-18 12:14:18,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51613 states. [2019-12-18 12:14:18,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51613 to 23540. [2019-12-18 12:14:18,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23540 states. [2019-12-18 12:14:18,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23540 states to 23540 states and 73219 transitions. [2019-12-18 12:14:18,958 INFO L78 Accepts]: Start accepts. Automaton has 23540 states and 73219 transitions. Word has length 33 [2019-12-18 12:14:18,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:14:18,958 INFO L462 AbstractCegarLoop]: Abstraction has 23540 states and 73219 transitions. [2019-12-18 12:14:18,958 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:14:18,958 INFO L276 IsEmpty]: Start isEmpty. Operand 23540 states and 73219 transitions. [2019-12-18 12:14:18,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 12:14:18,985 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:14:18,985 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 12:14:18,985 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 12:14:18,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:14:18,985 INFO L82 PathProgramCache]: Analyzing trace with hash -1518720007, now seen corresponding path program 2 times [2019-12-18 12:14:18,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:14:18,986 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715913226] [2019-12-18 12:14:18,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:14:19,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:14:19,092 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 12:14:19,092 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715913226] [2019-12-18 12:14:19,093 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:14:19,093 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:14:19,093 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596711577] [2019-12-18 12:14:19,093 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 12:14:19,094 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:14:19,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 12:14:19,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-18 12:14:19,094 INFO L87 Difference]: Start difference. First operand 23540 states and 73219 transitions. Second operand 8 states. [2019-12-18 12:14:21,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:14:21,304 INFO L93 Difference]: Finished difference Result 79921 states and 239364 transitions. [2019-12-18 12:14:21,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-18 12:14:21,305 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2019-12-18 12:14:21,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:14:21,425 INFO L225 Difference]: With dead ends: 79921 [2019-12-18 12:14:21,425 INFO L226 Difference]: Without dead ends: 79921 [2019-12-18 12:14:21,426 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=224, Invalid=646, Unknown=0, NotChecked=0, Total=870 [2019-12-18 12:14:21,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79921 states. [2019-12-18 12:14:22,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79921 to 22493. [2019-12-18 12:14:22,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22493 states. [2019-12-18 12:14:22,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22493 states to 22493 states and 69836 transitions. [2019-12-18 12:14:22,187 INFO L78 Accepts]: Start accepts. Automaton has 22493 states and 69836 transitions. Word has length 33 [2019-12-18 12:14:22,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:14:22,187 INFO L462 AbstractCegarLoop]: Abstraction has 22493 states and 69836 transitions. [2019-12-18 12:14:22,188 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 12:14:22,188 INFO L276 IsEmpty]: Start isEmpty. Operand 22493 states and 69836 transitions. [2019-12-18 12:14:22,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-18 12:14:22,214 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:14:22,214 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 12:14:22,214 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 12:14:22,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:14:22,215 INFO L82 PathProgramCache]: Analyzing trace with hash -2146187134, now seen corresponding path program 1 times [2019-12-18 12:14:22,215 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:14:22,215 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099681712] [2019-12-18 12:14:22,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:14:22,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:14:22,385 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 12:14:22,385 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099681712] [2019-12-18 12:14:22,386 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:14:22,386 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 12:14:22,386 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088164325] [2019-12-18 12:14:22,387 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:14:22,387 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:14:22,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:14:22,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:14:22,388 INFO L87 Difference]: Start difference. First operand 22493 states and 69836 transitions. Second operand 7 states. [2019-12-18 12:14:23,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:14:23,823 INFO L93 Difference]: Finished difference Result 45327 states and 136889 transitions. [2019-12-18 12:14:23,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 12:14:23,824 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2019-12-18 12:14:23,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:14:23,888 INFO L225 Difference]: With dead ends: 45327 [2019-12-18 12:14:23,888 INFO L226 Difference]: Without dead ends: 45327 [2019-12-18 12:14:23,889 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2019-12-18 12:14:24,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45327 states. [2019-12-18 12:14:24,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45327 to 20305. [2019-12-18 12:14:24,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20305 states. [2019-12-18 12:14:24,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20305 states to 20305 states and 63138 transitions. [2019-12-18 12:14:24,763 INFO L78 Accepts]: Start accepts. Automaton has 20305 states and 63138 transitions. Word has length 34 [2019-12-18 12:14:24,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:14:24,763 INFO L462 AbstractCegarLoop]: Abstraction has 20305 states and 63138 transitions. [2019-12-18 12:14:24,764 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:14:24,764 INFO L276 IsEmpty]: Start isEmpty. Operand 20305 states and 63138 transitions. [2019-12-18 12:14:24,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-18 12:14:24,782 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:14:24,782 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 12:14:24,783 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 12:14:24,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:14:24,783 INFO L82 PathProgramCache]: Analyzing trace with hash 1401085166, now seen corresponding path program 2 times [2019-12-18 12:14:24,783 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:14:24,784 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561938288] [2019-12-18 12:14:24,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:14:24,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:14:24,946 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 12:14:24,947 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561938288] [2019-12-18 12:14:24,947 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:14:24,947 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:14:24,948 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483800988] [2019-12-18 12:14:24,949 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 12:14:24,950 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:14:24,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 12:14:24,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-18 12:14:24,950 INFO L87 Difference]: Start difference. First operand 20305 states and 63138 transitions. Second operand 8 states. [2019-12-18 12:14:26,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:14:26,899 INFO L93 Difference]: Finished difference Result 60447 states and 179980 transitions. [2019-12-18 12:14:26,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 12:14:26,900 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2019-12-18 12:14:26,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:14:27,071 INFO L225 Difference]: With dead ends: 60447 [2019-12-18 12:14:27,071 INFO L226 Difference]: Without dead ends: 60447 [2019-12-18 12:14:27,072 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=209, Invalid=603, Unknown=0, NotChecked=0, Total=812 [2019-12-18 12:14:27,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60447 states. [2019-12-18 12:14:27,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60447 to 18462. [2019-12-18 12:14:27,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18462 states. [2019-12-18 12:14:28,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18462 states to 18462 states and 57434 transitions. [2019-12-18 12:14:28,068 INFO L78 Accepts]: Start accepts. Automaton has 18462 states and 57434 transitions. Word has length 34 [2019-12-18 12:14:28,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:14:28,068 INFO L462 AbstractCegarLoop]: Abstraction has 18462 states and 57434 transitions. [2019-12-18 12:14:28,069 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 12:14:28,069 INFO L276 IsEmpty]: Start isEmpty. Operand 18462 states and 57434 transitions. [2019-12-18 12:14:28,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 12:14:28,104 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:14:28,104 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 12:14:28,105 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 12:14:28,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:14:28,105 INFO L82 PathProgramCache]: Analyzing trace with hash 342833665, now seen corresponding path program 1 times [2019-12-18 12:14:28,106 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:14:28,106 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596880929] [2019-12-18 12:14:28,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:14:28,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:14:28,200 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 12:14:28,201 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596880929] [2019-12-18 12:14:28,201 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:14:28,202 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 12:14:28,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548031163] [2019-12-18 12:14:28,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:14:28,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:14:28,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:14:28,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:14:28,204 INFO L87 Difference]: Start difference. First operand 18462 states and 57434 transitions. Second operand 3 states. [2019-12-18 12:14:28,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:14:28,319 INFO L93 Difference]: Finished difference Result 18461 states and 57432 transitions. [2019-12-18 12:14:28,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:14:28,320 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-18 12:14:28,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:14:28,369 INFO L225 Difference]: With dead ends: 18461 [2019-12-18 12:14:28,370 INFO L226 Difference]: Without dead ends: 18461 [2019-12-18 12:14:28,375 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 12:14:28,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18461 states. [2019-12-18 12:14:28,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18461 to 18461. [2019-12-18 12:14:28,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18461 states. [2019-12-18 12:14:28,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18461 states to 18461 states and 57432 transitions. [2019-12-18 12:14:28,893 INFO L78 Accepts]: Start accepts. Automaton has 18461 states and 57432 transitions. Word has length 39 [2019-12-18 12:14:28,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:14:28,894 INFO L462 AbstractCegarLoop]: Abstraction has 18461 states and 57432 transitions. [2019-12-18 12:14:28,894 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:14:28,894 INFO L276 IsEmpty]: Start isEmpty. Operand 18461 states and 57432 transitions. [2019-12-18 12:14:28,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 12:14:28,922 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:14:28,922 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 12:14:28,922 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 12:14:28,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:14:28,923 INFO L82 PathProgramCache]: Analyzing trace with hash 1054064562, now seen corresponding path program 1 times [2019-12-18 12:14:28,923 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:14:28,924 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370763864] [2019-12-18 12:14:28,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:14:28,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:14:28,977 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 12:14:28,978 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370763864] [2019-12-18 12:14:28,978 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:14:28,978 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:14:28,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611868375] [2019-12-18 12:14:28,979 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:14:28,979 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:14:28,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:14:28,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:14:28,980 INFO L87 Difference]: Start difference. First operand 18461 states and 57432 transitions. Second operand 3 states. [2019-12-18 12:14:29,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:14:29,129 INFO L93 Difference]: Finished difference Result 32125 states and 100306 transitions. [2019-12-18 12:14:29,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:14:29,129 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-18 12:14:29,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:14:29,164 INFO L225 Difference]: With dead ends: 32125 [2019-12-18 12:14:29,164 INFO L226 Difference]: Without dead ends: 16527 [2019-12-18 12:14:29,164 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 12:14:29,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16527 states. [2019-12-18 12:14:29,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16527 to 16461. [2019-12-18 12:14:29,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16461 states. [2019-12-18 12:14:29,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16461 states to 16461 states and 50424 transitions. [2019-12-18 12:14:29,442 INFO L78 Accepts]: Start accepts. Automaton has 16461 states and 50424 transitions. Word has length 40 [2019-12-18 12:14:29,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:14:29,442 INFO L462 AbstractCegarLoop]: Abstraction has 16461 states and 50424 transitions. [2019-12-18 12:14:29,442 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:14:29,442 INFO L276 IsEmpty]: Start isEmpty. Operand 16461 states and 50424 transitions. [2019-12-18 12:14:29,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 12:14:29,465 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:14:29,466 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 12:14:29,466 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 12:14:29,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:14:29,466 INFO L82 PathProgramCache]: Analyzing trace with hash 1620503104, now seen corresponding path program 2 times [2019-12-18 12:14:29,466 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:14:29,467 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933803627] [2019-12-18 12:14:29,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:14:29,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:14:29,547 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 12:14:29,547 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933803627] [2019-12-18 12:14:29,547 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:14:29,548 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 12:14:29,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862222159] [2019-12-18 12:14:29,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:14:29,548 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:14:29,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:14:29,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:14:29,549 INFO L87 Difference]: Start difference. First operand 16461 states and 50424 transitions. Second operand 5 states. [2019-12-18 12:14:30,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:14:30,345 INFO L93 Difference]: Finished difference Result 27952 states and 83792 transitions. [2019-12-18 12:14:30,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 12:14:30,346 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 12:14:30,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:14:30,397 INFO L225 Difference]: With dead ends: 27952 [2019-12-18 12:14:30,397 INFO L226 Difference]: Without dead ends: 27952 [2019-12-18 12:14:30,398 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 12:14:30,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27952 states. [2019-12-18 12:14:30,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27952 to 22733. [2019-12-18 12:14:30,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22733 states. [2019-12-18 12:14:30,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22733 states to 22733 states and 69291 transitions. [2019-12-18 12:14:30,755 INFO L78 Accepts]: Start accepts. Automaton has 22733 states and 69291 transitions. Word has length 40 [2019-12-18 12:14:30,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:14:30,756 INFO L462 AbstractCegarLoop]: Abstraction has 22733 states and 69291 transitions. [2019-12-18 12:14:30,756 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:14:30,756 INFO L276 IsEmpty]: Start isEmpty. Operand 22733 states and 69291 transitions. [2019-12-18 12:14:30,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 12:14:30,778 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:14:30,778 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 12:14:30,778 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 12:14:30,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:14:30,778 INFO L82 PathProgramCache]: Analyzing trace with hash 2071452234, now seen corresponding path program 3 times [2019-12-18 12:14:30,778 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:14:30,779 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883829852] [2019-12-18 12:14:30,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:14:30,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:14:30,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:14:30,859 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883829852] [2019-12-18 12:14:30,860 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:14:30,860 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:14:30,860 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136663746] [2019-12-18 12:14:30,860 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 12:14:30,860 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:14:30,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 12:14:30,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:14:30,861 INFO L87 Difference]: Start difference. First operand 22733 states and 69291 transitions. Second operand 6 states. [2019-12-18 12:14:31,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:14:31,669 INFO L93 Difference]: Finished difference Result 38413 states and 116262 transitions. [2019-12-18 12:14:31,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 12:14:31,670 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-18 12:14:31,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:14:31,725 INFO L225 Difference]: With dead ends: 38413 [2019-12-18 12:14:31,725 INFO L226 Difference]: Without dead ends: 38413 [2019-12-18 12:14:31,725 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 12:14:31,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38413 states. [2019-12-18 12:14:32,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38413 to 26717. [2019-12-18 12:14:32,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26717 states. [2019-12-18 12:14:32,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26717 states to 26717 states and 81414 transitions. [2019-12-18 12:14:32,220 INFO L78 Accepts]: Start accepts. Automaton has 26717 states and 81414 transitions. Word has length 40 [2019-12-18 12:14:32,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:14:32,220 INFO L462 AbstractCegarLoop]: Abstraction has 26717 states and 81414 transitions. [2019-12-18 12:14:32,220 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 12:14:32,220 INFO L276 IsEmpty]: Start isEmpty. Operand 26717 states and 81414 transitions. [2019-12-18 12:14:32,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 12:14:32,248 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:14:32,248 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 12:14:32,248 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 12:14:32,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:14:32,248 INFO L82 PathProgramCache]: Analyzing trace with hash 1944149328, now seen corresponding path program 4 times [2019-12-18 12:14:32,249 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:14:32,249 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140097966] [2019-12-18 12:14:32,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:14:32,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:14:32,300 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 12:14:32,300 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140097966] [2019-12-18 12:14:32,301 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:14:32,301 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:14:32,301 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186679813] [2019-12-18 12:14:32,301 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:14:32,302 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:14:32,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:14:32,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:14:32,302 INFO L87 Difference]: Start difference. First operand 26717 states and 81414 transitions. Second operand 5 states. [2019-12-18 12:14:32,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:14:32,440 INFO L93 Difference]: Finished difference Result 25359 states and 78201 transitions. [2019-12-18 12:14:32,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:14:32,440 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 12:14:32,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:14:32,497 INFO L225 Difference]: With dead ends: 25359 [2019-12-18 12:14:32,497 INFO L226 Difference]: Without dead ends: 23331 [2019-12-18 12:14:32,498 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 12:14:32,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23331 states. [2019-12-18 12:14:32,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23331 to 22246. [2019-12-18 12:14:32,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22246 states. [2019-12-18 12:14:33,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22246 states to 22246 states and 70322 transitions. [2019-12-18 12:14:33,009 INFO L78 Accepts]: Start accepts. Automaton has 22246 states and 70322 transitions. Word has length 40 [2019-12-18 12:14:33,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:14:33,009 INFO L462 AbstractCegarLoop]: Abstraction has 22246 states and 70322 transitions. [2019-12-18 12:14:33,009 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:14:33,009 INFO L276 IsEmpty]: Start isEmpty. Operand 22246 states and 70322 transitions. [2019-12-18 12:14:33,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 12:14:33,035 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:14:33,035 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 12:14:33,035 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 12:14:33,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:14:33,036 INFO L82 PathProgramCache]: Analyzing trace with hash 275512574, now seen corresponding path program 1 times [2019-12-18 12:14:33,036 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:14:33,036 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791610385] [2019-12-18 12:14:33,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:14:33,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:14:33,115 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 12:14:33,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791610385] [2019-12-18 12:14:33,115 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:14:33,116 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:14:33,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603156433] [2019-12-18 12:14:33,116 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:14:33,116 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:14:33,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:14:33,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:14:33,117 INFO L87 Difference]: Start difference. First operand 22246 states and 70322 transitions. Second operand 7 states. [2019-12-18 12:14:34,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:14:34,063 INFO L93 Difference]: Finished difference Result 72025 states and 224764 transitions. [2019-12-18 12:14:34,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 12:14:34,064 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 12:14:34,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:14:34,134 INFO L225 Difference]: With dead ends: 72025 [2019-12-18 12:14:34,134 INFO L226 Difference]: Without dead ends: 50174 [2019-12-18 12:14:34,134 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 12:14:34,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50174 states. [2019-12-18 12:14:34,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50174 to 25630. [2019-12-18 12:14:34,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25630 states. [2019-12-18 12:14:34,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25630 states to 25630 states and 81003 transitions. [2019-12-18 12:14:34,691 INFO L78 Accepts]: Start accepts. Automaton has 25630 states and 81003 transitions. Word has length 64 [2019-12-18 12:14:34,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:14:34,691 INFO L462 AbstractCegarLoop]: Abstraction has 25630 states and 81003 transitions. [2019-12-18 12:14:34,692 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:14:34,692 INFO L276 IsEmpty]: Start isEmpty. Operand 25630 states and 81003 transitions. [2019-12-18 12:14:34,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 12:14:34,723 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:14:34,723 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 12:14:34,723 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 12:14:34,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:14:34,723 INFO L82 PathProgramCache]: Analyzing trace with hash 474826606, now seen corresponding path program 2 times [2019-12-18 12:14:34,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:14:34,724 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981820893] [2019-12-18 12:14:34,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:14:34,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:14:34,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:14:34,811 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981820893] [2019-12-18 12:14:34,811 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:14:34,811 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 12:14:34,811 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879148072] [2019-12-18 12:14:34,812 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 12:14:34,812 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:14:34,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 12:14:34,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 12:14:34,812 INFO L87 Difference]: Start difference. First operand 25630 states and 81003 transitions. Second operand 8 states. [2019-12-18 12:14:36,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:14:36,165 INFO L93 Difference]: Finished difference Result 121805 states and 379916 transitions. [2019-12-18 12:14:36,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 12:14:36,165 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 64 [2019-12-18 12:14:36,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:14:36,306 INFO L225 Difference]: With dead ends: 121805 [2019-12-18 12:14:36,306 INFO L226 Difference]: Without dead ends: 83754 [2019-12-18 12:14:36,306 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 12:14:36,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83754 states. [2019-12-18 12:14:37,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83754 to 29901. [2019-12-18 12:14:37,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29901 states. [2019-12-18 12:14:37,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29901 states to 29901 states and 94342 transitions. [2019-12-18 12:14:37,265 INFO L78 Accepts]: Start accepts. Automaton has 29901 states and 94342 transitions. Word has length 64 [2019-12-18 12:14:37,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:14:37,265 INFO L462 AbstractCegarLoop]: Abstraction has 29901 states and 94342 transitions. [2019-12-18 12:14:37,265 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 12:14:37,265 INFO L276 IsEmpty]: Start isEmpty. Operand 29901 states and 94342 transitions. [2019-12-18 12:14:37,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 12:14:37,303 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:14:37,304 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 12:14:37,304 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 12:14:37,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:14:37,304 INFO L82 PathProgramCache]: Analyzing trace with hash 1554423936, now seen corresponding path program 3 times [2019-12-18 12:14:37,304 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:14:37,304 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143570845] [2019-12-18 12:14:37,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:14:37,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:14:37,837 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 12:14:37,837 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143570845] [2019-12-18 12:14:37,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:14:37,838 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:14:37,838 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737367138] [2019-12-18 12:14:37,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:14:37,838 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:14:37,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:14:37,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:14:37,839 INFO L87 Difference]: Start difference. First operand 29901 states and 94342 transitions. Second operand 9 states. [2019-12-18 12:14:39,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:14:39,861 INFO L93 Difference]: Finished difference Result 183880 states and 570924 transitions. [2019-12-18 12:14:39,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-12-18 12:14:39,862 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-18 12:14:39,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:14:40,119 INFO L225 Difference]: With dead ends: 183880 [2019-12-18 12:14:40,119 INFO L226 Difference]: Without dead ends: 147650 [2019-12-18 12:14:40,120 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 389 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=363, Invalid=1043, Unknown=0, NotChecked=0, Total=1406 [2019-12-18 12:14:40,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147650 states. [2019-12-18 12:14:41,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147650 to 36955. [2019-12-18 12:14:41,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36955 states. [2019-12-18 12:14:41,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36955 states to 36955 states and 116388 transitions. [2019-12-18 12:14:41,517 INFO L78 Accepts]: Start accepts. Automaton has 36955 states and 116388 transitions. Word has length 64 [2019-12-18 12:14:41,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:14:41,517 INFO L462 AbstractCegarLoop]: Abstraction has 36955 states and 116388 transitions. [2019-12-18 12:14:41,517 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:14:41,517 INFO L276 IsEmpty]: Start isEmpty. Operand 36955 states and 116388 transitions. [2019-12-18 12:14:41,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 12:14:41,557 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:14:41,557 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 12:14:41,557 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 12:14:41,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:14:41,558 INFO L82 PathProgramCache]: Analyzing trace with hash 85476954, now seen corresponding path program 4 times [2019-12-18 12:14:41,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:14:41,558 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243405303] [2019-12-18 12:14:41,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:14:41,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:14:41,651 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 12:14:41,652 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243405303] [2019-12-18 12:14:41,652 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:14:41,652 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:14:41,652 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858748053] [2019-12-18 12:14:41,653 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:14:41,653 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:14:41,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:14:41,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:14:41,654 INFO L87 Difference]: Start difference. First operand 36955 states and 116388 transitions. Second operand 9 states. [2019-12-18 12:14:42,467 WARN L192 SmtUtils]: Spent 345.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-12-18 12:14:43,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:14:43,769 INFO L93 Difference]: Finished difference Result 152885 states and 470048 transitions. [2019-12-18 12:14:43,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-18 12:14:43,770 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-18 12:14:43,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:14:43,994 INFO L225 Difference]: With dead ends: 152885 [2019-12-18 12:14:43,994 INFO L226 Difference]: Without dead ends: 136778 [2019-12-18 12:14:43,995 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=268, Invalid=788, Unknown=0, NotChecked=0, Total=1056 [2019-12-18 12:14:44,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136778 states. [2019-12-18 12:14:45,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136778 to 36142. [2019-12-18 12:14:45,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36142 states. [2019-12-18 12:14:45,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36142 states to 36142 states and 113529 transitions. [2019-12-18 12:14:45,355 INFO L78 Accepts]: Start accepts. Automaton has 36142 states and 113529 transitions. Word has length 64 [2019-12-18 12:14:45,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:14:45,355 INFO L462 AbstractCegarLoop]: Abstraction has 36142 states and 113529 transitions. [2019-12-18 12:14:45,355 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:14:45,355 INFO L276 IsEmpty]: Start isEmpty. Operand 36142 states and 113529 transitions. [2019-12-18 12:14:45,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 12:14:45,396 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:14:45,397 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 12:14:45,397 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 12:14:45,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:14:45,397 INFO L82 PathProgramCache]: Analyzing trace with hash 812479892, now seen corresponding path program 5 times [2019-12-18 12:14:45,397 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:14:45,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39522260] [2019-12-18 12:14:45,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:14:45,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:14:45,461 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 12:14:45,461 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39522260] [2019-12-18 12:14:45,462 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:14:45,462 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:14:45,462 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697626093] [2019-12-18 12:14:45,462 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:14:45,462 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:14:45,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:14:45,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:14:45,463 INFO L87 Difference]: Start difference. First operand 36142 states and 113529 transitions. Second operand 7 states. [2019-12-18 12:14:45,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:14:45,954 INFO L93 Difference]: Finished difference Result 78673 states and 242006 transitions. [2019-12-18 12:14:45,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 12:14:45,954 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 12:14:45,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:14:46,056 INFO L225 Difference]: With dead ends: 78673 [2019-12-18 12:14:46,056 INFO L226 Difference]: Without dead ends: 67651 [2019-12-18 12:14:46,056 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 12:14:46,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67651 states. [2019-12-18 12:14:47,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67651 to 36206. [2019-12-18 12:14:47,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36206 states. [2019-12-18 12:14:47,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36206 states to 36206 states and 113658 transitions. [2019-12-18 12:14:47,238 INFO L78 Accepts]: Start accepts. Automaton has 36206 states and 113658 transitions. Word has length 64 [2019-12-18 12:14:47,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:14:47,238 INFO L462 AbstractCegarLoop]: Abstraction has 36206 states and 113658 transitions. [2019-12-18 12:14:47,238 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:14:47,238 INFO L276 IsEmpty]: Start isEmpty. Operand 36206 states and 113658 transitions. [2019-12-18 12:14:47,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 12:14:47,286 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:14:47,287 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 12:14:47,287 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 12:14:47,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:14:47,287 INFO L82 PathProgramCache]: Analyzing trace with hash 1442601312, now seen corresponding path program 6 times [2019-12-18 12:14:47,287 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:14:47,288 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202281286] [2019-12-18 12:14:47,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:14:47,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:14:47,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:14:47,345 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202281286] [2019-12-18 12:14:47,346 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:14:47,346 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:14:47,346 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570568276] [2019-12-18 12:14:47,346 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:14:47,346 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:14:47,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:14:47,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:14:47,347 INFO L87 Difference]: Start difference. First operand 36206 states and 113658 transitions. Second operand 3 states. [2019-12-18 12:14:47,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:14:47,590 INFO L93 Difference]: Finished difference Result 43673 states and 135917 transitions. [2019-12-18 12:14:47,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:14:47,591 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-18 12:14:47,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:14:47,709 INFO L225 Difference]: With dead ends: 43673 [2019-12-18 12:14:47,709 INFO L226 Difference]: Without dead ends: 43673 [2019-12-18 12:14:47,710 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 12:14:47,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43673 states. [2019-12-18 12:14:48,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43673 to 37805. [2019-12-18 12:14:48,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37805 states. [2019-12-18 12:14:48,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37805 states to 37805 states and 118379 transitions. [2019-12-18 12:14:48,825 INFO L78 Accepts]: Start accepts. Automaton has 37805 states and 118379 transitions. Word has length 64 [2019-12-18 12:14:48,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:14:48,826 INFO L462 AbstractCegarLoop]: Abstraction has 37805 states and 118379 transitions. [2019-12-18 12:14:48,826 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:14:48,826 INFO L276 IsEmpty]: Start isEmpty. Operand 37805 states and 118379 transitions. [2019-12-18 12:14:48,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:14:48,873 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:14:48,873 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 12:14:48,874 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 12:14:48,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:14:48,874 INFO L82 PathProgramCache]: Analyzing trace with hash 318332456, now seen corresponding path program 1 times [2019-12-18 12:14:48,874 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:14:48,874 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090816759] [2019-12-18 12:14:48,874 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:14:48,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:14:48,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:14:48,964 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090816759] [2019-12-18 12:14:48,964 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:14:48,964 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 12:14:48,964 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467229681] [2019-12-18 12:14:48,965 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 12:14:48,965 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:14:48,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 12:14:48,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 12:14:48,965 INFO L87 Difference]: Start difference. First operand 37805 states and 118379 transitions. Second operand 8 states. [2019-12-18 12:14:50,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:14:50,146 INFO L93 Difference]: Finished difference Result 110886 states and 342679 transitions. [2019-12-18 12:14:50,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 12:14:50,146 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-18 12:14:50,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:14:50,341 INFO L225 Difference]: With dead ends: 110886 [2019-12-18 12:14:50,341 INFO L226 Difference]: Without dead ends: 104510 [2019-12-18 12:14:50,342 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2019-12-18 12:14:50,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104510 states. [2019-12-18 12:14:51,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104510 to 38340. [2019-12-18 12:14:51,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38340 states. [2019-12-18 12:14:52,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38340 states to 38340 states and 120322 transitions. [2019-12-18 12:14:52,036 INFO L78 Accepts]: Start accepts. Automaton has 38340 states and 120322 transitions. Word has length 65 [2019-12-18 12:14:52,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:14:52,037 INFO L462 AbstractCegarLoop]: Abstraction has 38340 states and 120322 transitions. [2019-12-18 12:14:52,037 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 12:14:52,037 INFO L276 IsEmpty]: Start isEmpty. Operand 38340 states and 120322 transitions. [2019-12-18 12:14:52,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:14:52,084 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:14:52,084 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 12:14:52,084 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 12:14:52,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:14:52,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1590918528, now seen corresponding path program 2 times [2019-12-18 12:14:52,085 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:14:52,085 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393966095] [2019-12-18 12:14:52,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:14:52,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:14:52,188 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 12:14:52,188 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393966095] [2019-12-18 12:14:52,188 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:14:52,189 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:14:52,189 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164262314] [2019-12-18 12:14:52,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:14:52,190 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:14:52,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:14:52,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:14:52,190 INFO L87 Difference]: Start difference. First operand 38340 states and 120322 transitions. Second operand 9 states. [2019-12-18 12:14:54,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:14:54,196 INFO L93 Difference]: Finished difference Result 163120 states and 501153 transitions. [2019-12-18 12:14:54,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-18 12:14:54,197 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-18 12:14:54,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:14:54,420 INFO L225 Difference]: With dead ends: 163120 [2019-12-18 12:14:54,420 INFO L226 Difference]: Without dead ends: 134485 [2019-12-18 12:14:54,421 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=289, Invalid=767, Unknown=0, NotChecked=0, Total=1056 [2019-12-18 12:14:54,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134485 states. [2019-12-18 12:14:56,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134485 to 40212. [2019-12-18 12:14:56,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40212 states. [2019-12-18 12:14:56,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40212 states to 40212 states and 125303 transitions. [2019-12-18 12:14:56,356 INFO L78 Accepts]: Start accepts. Automaton has 40212 states and 125303 transitions. Word has length 65 [2019-12-18 12:14:56,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:14:56,356 INFO L462 AbstractCegarLoop]: Abstraction has 40212 states and 125303 transitions. [2019-12-18 12:14:56,356 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:14:56,356 INFO L276 IsEmpty]: Start isEmpty. Operand 40212 states and 125303 transitions. [2019-12-18 12:14:56,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:14:56,400 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:14:56,400 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 12:14:56,400 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 12:14:56,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:14:56,401 INFO L82 PathProgramCache]: Analyzing trace with hash 704301340, now seen corresponding path program 3 times [2019-12-18 12:14:56,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:14:56,401 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139360247] [2019-12-18 12:14:56,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:14:56,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:14:56,499 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 12:14:56,499 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139360247] [2019-12-18 12:14:56,499 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:14:56,499 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:14:56,500 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496623895] [2019-12-18 12:14:56,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:14:56,500 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:14:56,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:14:56,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:14:56,501 INFO L87 Difference]: Start difference. First operand 40212 states and 125303 transitions. Second operand 9 states. [2019-12-18 12:14:58,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:14:58,039 INFO L93 Difference]: Finished difference Result 132812 states and 405190 transitions. [2019-12-18 12:14:58,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-18 12:14:58,039 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-18 12:14:58,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:14:58,229 INFO L225 Difference]: With dead ends: 132812 [2019-12-18 12:14:58,229 INFO L226 Difference]: Without dead ends: 124029 [2019-12-18 12:14:58,230 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=205, Invalid=607, Unknown=0, NotChecked=0, Total=812 [2019-12-18 12:14:58,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124029 states. [2019-12-18 12:15:00,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124029 to 38469. [2019-12-18 12:15:00,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38469 states. [2019-12-18 12:15:00,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38469 states to 38469 states and 120398 transitions. [2019-12-18 12:15:00,262 INFO L78 Accepts]: Start accepts. Automaton has 38469 states and 120398 transitions. Word has length 65 [2019-12-18 12:15:00,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:15:00,262 INFO L462 AbstractCegarLoop]: Abstraction has 38469 states and 120398 transitions. [2019-12-18 12:15:00,262 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:15:00,262 INFO L276 IsEmpty]: Start isEmpty. Operand 38469 states and 120398 transitions. [2019-12-18 12:15:00,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:15:00,306 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:15:00,306 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 12:15:00,306 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 12:15:00,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:15:00,307 INFO L82 PathProgramCache]: Analyzing trace with hash 1422061222, now seen corresponding path program 1 times [2019-12-18 12:15:00,307 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:15:00,307 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016616581] [2019-12-18 12:15:00,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:15:00,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:15:00,429 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 12:15:00,430 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016616581] [2019-12-18 12:15:00,430 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:15:00,430 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 12:15:00,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745977771] [2019-12-18 12:15:00,431 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:15:00,431 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:15:00,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:15:00,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:15:00,432 INFO L87 Difference]: Start difference. First operand 38469 states and 120398 transitions. Second operand 7 states. [2019-12-18 12:15:02,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:15:02,057 INFO L93 Difference]: Finished difference Result 72617 states and 222939 transitions. [2019-12-18 12:15:02,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 12:15:02,058 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-18 12:15:02,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:15:02,191 INFO L225 Difference]: With dead ends: 72617 [2019-12-18 12:15:02,191 INFO L226 Difference]: Without dead ends: 72617 [2019-12-18 12:15:02,191 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 12:15:02,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72617 states. [2019-12-18 12:15:03,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72617 to 39272. [2019-12-18 12:15:03,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39272 states. [2019-12-18 12:15:03,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39272 states to 39272 states and 122780 transitions. [2019-12-18 12:15:03,143 INFO L78 Accepts]: Start accepts. Automaton has 39272 states and 122780 transitions. Word has length 65 [2019-12-18 12:15:03,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:15:03,143 INFO L462 AbstractCegarLoop]: Abstraction has 39272 states and 122780 transitions. [2019-12-18 12:15:03,143 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:15:03,143 INFO L276 IsEmpty]: Start isEmpty. Operand 39272 states and 122780 transitions. [2019-12-18 12:15:03,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:15:03,191 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:15:03,191 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 12:15:03,191 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 12:15:03,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:15:03,192 INFO L82 PathProgramCache]: Analyzing trace with hash -1551355630, now seen corresponding path program 4 times [2019-12-18 12:15:03,192 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:15:03,192 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252758863] [2019-12-18 12:15:03,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:15:03,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:15:03,271 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 12:15:03,271 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252758863] [2019-12-18 12:15:03,271 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:15:03,272 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 12:15:03,272 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639375006] [2019-12-18 12:15:03,272 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:15:03,272 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:15:03,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:15:03,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:15:03,273 INFO L87 Difference]: Start difference. First operand 39272 states and 122780 transitions. Second operand 7 states. [2019-12-18 12:15:04,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:15:04,838 INFO L93 Difference]: Finished difference Result 71507 states and 217949 transitions. [2019-12-18 12:15:04,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 12:15:04,839 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-18 12:15:04,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:15:04,966 INFO L225 Difference]: With dead ends: 71507 [2019-12-18 12:15:04,966 INFO L226 Difference]: Without dead ends: 71507 [2019-12-18 12:15:04,967 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2019-12-18 12:15:05,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71507 states. [2019-12-18 12:15:06,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71507 to 40699. [2019-12-18 12:15:06,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40699 states. [2019-12-18 12:15:06,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40699 states to 40699 states and 126651 transitions. [2019-12-18 12:15:06,318 INFO L78 Accepts]: Start accepts. Automaton has 40699 states and 126651 transitions. Word has length 65 [2019-12-18 12:15:06,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:15:06,318 INFO L462 AbstractCegarLoop]: Abstraction has 40699 states and 126651 transitions. [2019-12-18 12:15:06,319 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:15:06,319 INFO L276 IsEmpty]: Start isEmpty. Operand 40699 states and 126651 transitions. [2019-12-18 12:15:06,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:15:06,368 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:15:06,368 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 12:15:06,368 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 12:15:06,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:15:06,369 INFO L82 PathProgramCache]: Analyzing trace with hash 372067404, now seen corresponding path program 2 times [2019-12-18 12:15:06,369 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:15:06,369 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907586571] [2019-12-18 12:15:06,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:15:06,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:15:06,530 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 12:15:06,530 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907586571] [2019-12-18 12:15:06,531 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:15:06,531 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:15:06,531 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891016185] [2019-12-18 12:15:06,532 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 12:15:06,532 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:15:06,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 12:15:06,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-18 12:15:06,533 INFO L87 Difference]: Start difference. First operand 40699 states and 126651 transitions. Second operand 8 states. [2019-12-18 12:15:08,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:15:08,532 INFO L93 Difference]: Finished difference Result 83238 states and 255936 transitions. [2019-12-18 12:15:08,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 12:15:08,533 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-18 12:15:08,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:15:08,680 INFO L225 Difference]: With dead ends: 83238 [2019-12-18 12:15:08,681 INFO L226 Difference]: Without dead ends: 83238 [2019-12-18 12:15:08,681 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2019-12-18 12:15:08,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83238 states. [2019-12-18 12:15:09,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83238 to 43093. [2019-12-18 12:15:09,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43093 states. [2019-12-18 12:15:09,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43093 states to 43093 states and 135136 transitions. [2019-12-18 12:15:09,723 INFO L78 Accepts]: Start accepts. Automaton has 43093 states and 135136 transitions. Word has length 65 [2019-12-18 12:15:09,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:15:09,724 INFO L462 AbstractCegarLoop]: Abstraction has 43093 states and 135136 transitions. [2019-12-18 12:15:09,724 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 12:15:09,724 INFO L276 IsEmpty]: Start isEmpty. Operand 43093 states and 135136 transitions. [2019-12-18 12:15:10,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:15:10,281 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:15:10,281 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:15:10,281 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 12:15:10,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:15:10,282 INFO L82 PathProgramCache]: Analyzing trace with hash 140793632, now seen corresponding path program 3 times [2019-12-18 12:15:10,282 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:15:10,282 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120652710] [2019-12-18 12:15:10,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:15:10,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:15:10,345 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 12:15:10,345 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120652710] [2019-12-18 12:15:10,345 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:15:10,345 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:15:10,346 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560467010] [2019-12-18 12:15:10,346 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:15:10,346 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:15:10,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:15:10,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:15:10,347 INFO L87 Difference]: Start difference. First operand 43093 states and 135136 transitions. Second operand 3 states. [2019-12-18 12:15:10,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:15:10,567 INFO L93 Difference]: Finished difference Result 43093 states and 135135 transitions. [2019-12-18 12:15:10,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:15:10,568 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 12:15:10,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:15:10,682 INFO L225 Difference]: With dead ends: 43093 [2019-12-18 12:15:10,682 INFO L226 Difference]: Without dead ends: 43093 [2019-12-18 12:15:10,685 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 12:15:10,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43093 states. [2019-12-18 12:15:11,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43093 to 31980. [2019-12-18 12:15:11,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31980 states. [2019-12-18 12:15:11,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31980 states to 31980 states and 100810 transitions. [2019-12-18 12:15:11,676 INFO L78 Accepts]: Start accepts. Automaton has 31980 states and 100810 transitions. Word has length 65 [2019-12-18 12:15:11,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:15:11,676 INFO L462 AbstractCegarLoop]: Abstraction has 31980 states and 100810 transitions. [2019-12-18 12:15:11,677 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:15:11,677 INFO L276 IsEmpty]: Start isEmpty. Operand 31980 states and 100810 transitions. [2019-12-18 12:15:11,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:15:11,717 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:15:11,717 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 12:15:11,717 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 12:15:11,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:15:11,718 INFO L82 PathProgramCache]: Analyzing trace with hash -1242482118, now seen corresponding path program 1 times [2019-12-18 12:15:11,718 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:15:11,718 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197690123] [2019-12-18 12:15:11,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:15:11,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:15:11,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:15:11,823 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197690123] [2019-12-18 12:15:11,823 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:15:11,824 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:15:11,824 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122043817] [2019-12-18 12:15:11,824 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 12:15:11,824 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:15:11,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 12:15:11,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 12:15:11,825 INFO L87 Difference]: Start difference. First operand 31980 states and 100810 transitions. Second operand 8 states. [2019-12-18 12:15:13,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:15:13,998 INFO L93 Difference]: Finished difference Result 58825 states and 182632 transitions. [2019-12-18 12:15:13,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-18 12:15:13,999 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 66 [2019-12-18 12:15:13,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:15:14,102 INFO L225 Difference]: With dead ends: 58825 [2019-12-18 12:15:14,103 INFO L226 Difference]: Without dead ends: 58825 [2019-12-18 12:15:14,103 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=192, Invalid=738, Unknown=0, NotChecked=0, Total=930 [2019-12-18 12:15:14,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58825 states. [2019-12-18 12:15:14,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58825 to 31833. [2019-12-18 12:15:14,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31833 states. [2019-12-18 12:15:14,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31833 states to 31833 states and 100313 transitions. [2019-12-18 12:15:14,829 INFO L78 Accepts]: Start accepts. Automaton has 31833 states and 100313 transitions. Word has length 66 [2019-12-18 12:15:14,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:15:14,829 INFO L462 AbstractCegarLoop]: Abstraction has 31833 states and 100313 transitions. [2019-12-18 12:15:14,829 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 12:15:14,829 INFO L276 IsEmpty]: Start isEmpty. Operand 31833 states and 100313 transitions. [2019-12-18 12:15:14,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:15:14,867 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:15:14,867 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 12:15:14,867 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 12:15:14,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:15:14,868 INFO L82 PathProgramCache]: Analyzing trace with hash -927878062, now seen corresponding path program 2 times [2019-12-18 12:15:14,868 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:15:14,868 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089883817] [2019-12-18 12:15:14,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:15:14,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:15:14,920 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 12:15:14,920 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089883817] [2019-12-18 12:15:14,920 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:15:14,920 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:15:14,921 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093434688] [2019-12-18 12:15:14,921 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:15:14,921 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:15:14,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:15:14,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:15:14,922 INFO L87 Difference]: Start difference. First operand 31833 states and 100313 transitions. Second operand 3 states. [2019-12-18 12:15:15,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:15:15,326 INFO L93 Difference]: Finished difference Result 23212 states and 72688 transitions. [2019-12-18 12:15:15,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:15:15,327 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 12:15:15,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:15:15,374 INFO L225 Difference]: With dead ends: 23212 [2019-12-18 12:15:15,374 INFO L226 Difference]: Without dead ends: 23212 [2019-12-18 12:15:15,374 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 12:15:15,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23212 states. [2019-12-18 12:15:15,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23212 to 20876. [2019-12-18 12:15:15,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20876 states. [2019-12-18 12:15:15,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20876 states to 20876 states and 65082 transitions. [2019-12-18 12:15:15,933 INFO L78 Accepts]: Start accepts. Automaton has 20876 states and 65082 transitions. Word has length 66 [2019-12-18 12:15:15,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:15:15,934 INFO L462 AbstractCegarLoop]: Abstraction has 20876 states and 65082 transitions. [2019-12-18 12:15:15,934 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:15:15,934 INFO L276 IsEmpty]: Start isEmpty. Operand 20876 states and 65082 transitions. [2019-12-18 12:15:15,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 12:15:15,975 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:15:15,975 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 12:15:15,975 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 12:15:15,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:15:15,975 INFO L82 PathProgramCache]: Analyzing trace with hash 763340387, now seen corresponding path program 1 times [2019-12-18 12:15:15,976 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:15:15,976 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371760786] [2019-12-18 12:15:15,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:15:16,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 12:15:16,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 12:15:16,126 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 12:15:16,126 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 12:15:16,131 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [899] [899] ULTIMATE.startENTRY-->L830: Formula: (let ((.cse0 (store |v_#valid_75| 0 0))) (and (= v_~__unbuffered_p1_EBX~0_48 0) (= v_~main$tmp_guard0~0_30 0) (= 0 v_~z$r_buff0_thd3~0_367) (= v_~z$r_buff0_thd0~0_147 0) (= v_~z$w_buff0_used~0_850 0) (= v_~z$w_buff0~0_393 0) (= v_~z$read_delayed_var~0.offset_6 0) (= |v_#NULL.offset_6| 0) (= 0 v_~z$r_buff1_thd3~0_322) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t153~0.base_27| 4) |v_#length_23|) (= v_~weak$$choice2~0_147 0) (= v_~z$read_delayed~0_6 0) (= v_~z$r_buff1_thd1~0_158 0) (= v_~z$read_delayed_var~0.base_6 0) (< 0 |v_#StackHeapBarrier_18|) (= v_~z$r_buff1_thd2~0_168 0) (= |v_ULTIMATE.start_main_~#t153~0.offset_17| 0) (= v_~z$w_buff1_used~0_568 0) (= v_~main$tmp_guard1~0_41 0) (= 0 v_~__unbuffered_p2_EAX~0_41) (= 0 |v_#NULL.base_6|) (= (store .cse0 |v_ULTIMATE.start_main_~#t153~0.base_27| 1) |v_#valid_73|) (= 0 v_~z$flush_delayed~0_26) (= v_~__unbuffered_p2_EBX~0_49 0) (= 0 v_~__unbuffered_p1_EAX~0_47) (= v_~z$r_buff0_thd1~0_210 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t153~0.base_27|) 0) (= 0 v_~x~0_154) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t153~0.base_27|) (= v_~z$r_buff0_thd2~0_129 0) (= 0 v_~__unbuffered_cnt~0_88) (= v_~z~0_181 0) (= v_~z$mem_tmp~0_15 0) (= 0 v_~weak$$choice0~0_13) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t153~0.base_27| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t153~0.base_27|) |v_ULTIMATE.start_main_~#t153~0.offset_17| 0)) |v_#memory_int_19|) (= v_~y~0_31 0) (= v_~z$r_buff1_thd0~0_191 0) (= v_~z$w_buff1~0_253 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_75|, #memory_int=|v_#memory_int_20|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t154~0.offset=|v_ULTIMATE.start_main_~#t154~0.offset_16|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_168, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_31|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_61|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_191|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_76|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_147, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_47, ULTIMATE.start_main_~#t153~0.base=|v_ULTIMATE.start_main_~#t153~0.base_27|, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_41, ~z$mem_tmp~0=v_~z$mem_tmp~0_15, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_49, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_8|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_568, ~z$flush_delayed~0=v_~z$flush_delayed~0_26, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_~#t155~0.offset=|v_ULTIMATE.start_main_~#t155~0.offset_17|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_158, ~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_367, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_88, ~x~0=v_~x~0_154, ULTIMATE.start_main_~#t154~0.base=|v_ULTIMATE.start_main_~#t154~0.base_22|, ULTIMATE.start_main_~#t155~0.base=|v_ULTIMATE.start_main_~#t155~0.base_23|, ~z$read_delayed~0=v_~z$read_delayed~0_6, ~z$w_buff1~0=v_~z$w_buff1~0_253, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_41, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_39|, ~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_43|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_191, ~y~0=v_~y~0_31, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_129, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_48, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_27|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_850, ~z$w_buff0~0=v_~z$w_buff0~0_393, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_8|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_322, ULTIMATE.start_main_~#t153~0.offset=|v_ULTIMATE.start_main_~#t153~0.offset_17|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_30, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_25|, #valid=|v_#valid_73|, #memory_int=|v_#memory_int_19|, ~z~0=v_~z~0_181, ~weak$$choice2~0=v_~weak$$choice2~0_147, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_210} 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 12:15:16,132 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [866] [866] 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 12:15:16,133 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L4-->L748: Formula: (and (= v_~z$r_buff0_thd0~0_17 v_~z$r_buff1_thd0~0_13) (= 1 v_~x~0_6) (= v_~z$r_buff0_thd1~0_21 1) (= v_~z$r_buff0_thd3~0_47 v_~z$r_buff1_thd3~0_31) (= v_~z$r_buff0_thd1~0_22 v_~z$r_buff1_thd1~0_11) (= v_~z$r_buff0_thd2~0_15 v_~z$r_buff1_thd2~0_11) (not (= 0 v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_6))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_17, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_47, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_6, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_22, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_15} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_17, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_31, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_13, ~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_47, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_6, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_21, ~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 12:15:16,134 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L771-2-->L771-4: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In804853791 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd2~0_In804853791 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite9_Out804853791| ~z$w_buff1~0_In804853791) (not .cse0) (not .cse1)) (and (= |P1Thread1of1ForFork2_#t~ite9_Out804853791| ~z~0_In804853791) (or .cse0 .cse1)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In804853791, ~z$w_buff1_used~0=~z$w_buff1_used~0_In804853791, ~z$w_buff1~0=~z$w_buff1~0_In804853791, ~z~0=~z~0_In804853791} OutVars{P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out804853791|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In804853791, ~z$w_buff1_used~0=~z$w_buff1_used~0_In804853791, ~z$w_buff1~0=~z$w_buff1~0_In804853791, ~z~0=~z~0_In804853791} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-18 12:15:16,134 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L771-4-->L772: Formula: (= |v_P1Thread1of1ForFork2_#t~ite9_12| v_~z~0_27) InVars {P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_12|} OutVars{P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_11|, P1Thread1of1ForFork2_#t~ite10=|v_P1Thread1of1ForFork2_#t~ite10_17|, ~z~0=v_~z~0_27} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10, ~z~0] because there is no mapped edge [2019-12-18 12:15:16,134 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L772-->L772-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1320102238 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd2~0_In-1320102238 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-1320102238 |P1Thread1of1ForFork2_#t~ite11_Out-1320102238|)) (and (= 0 |P1Thread1of1ForFork2_#t~ite11_Out-1320102238|) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1320102238, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1320102238} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1320102238, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out-1320102238|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1320102238} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-18 12:15:16,135 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L773-->L773-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In968806814 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd2~0_In968806814 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd2~0_In968806814 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In968806814 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork2_#t~ite12_Out968806814| ~z$w_buff1_used~0_In968806814)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork2_#t~ite12_Out968806814| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In968806814, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In968806814, ~z$w_buff1_used~0=~z$w_buff1_used~0_In968806814, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In968806814} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In968806814, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In968806814, ~z$w_buff1_used~0=~z$w_buff1_used~0_In968806814, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out968806814|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In968806814} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-18 12:15:16,135 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 12:15:16,138 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L796-->L796-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1136653629 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite21_Out-1136653629| ~z$w_buff0~0_In-1136653629) (= |P2Thread1of1ForFork0_#t~ite20_In-1136653629| |P2Thread1of1ForFork0_#t~ite20_Out-1136653629|)) (and (= |P2Thread1of1ForFork0_#t~ite21_Out-1136653629| |P2Thread1of1ForFork0_#t~ite20_Out-1136653629|) (= |P2Thread1of1ForFork0_#t~ite20_Out-1136653629| ~z$w_buff0~0_In-1136653629) .cse0 (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In-1136653629 256) 0))) (or (and .cse1 (= 0 (mod ~z$w_buff1_used~0_In-1136653629 256))) (and .cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-1136653629 256))) (= 0 (mod ~z$w_buff0_used~0_In-1136653629 256))))))) InVars {~z$w_buff0~0=~z$w_buff0~0_In-1136653629, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1136653629, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1136653629, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1136653629, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1136653629, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_In-1136653629|, ~weak$$choice2~0=~weak$$choice2~0_In-1136653629} OutVars{P2Thread1of1ForFork0_#t~ite21=|P2Thread1of1ForFork0_#t~ite21_Out-1136653629|, ~z$w_buff0~0=~z$w_buff0~0_In-1136653629, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1136653629, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1136653629, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1136653629, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1136653629, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_Out-1136653629|, ~weak$$choice2~0=~weak$$choice2~0_In-1136653629} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite20] because there is no mapped edge [2019-12-18 12:15:16,139 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L774-->L774-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In227261433 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd2~0_In227261433 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite13_Out227261433| 0) (not .cse1)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork2_#t~ite13_Out227261433| ~z$r_buff0_thd2~0_In227261433)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In227261433, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In227261433} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In227261433, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out227261433|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In227261433} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-18 12:15:16,140 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L775-->L775-2: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In-1283555461 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd2~0_In-1283555461 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd2~0_In-1283555461 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-1283555461 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite14_Out-1283555461| ~z$r_buff1_thd2~0_In-1283555461) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork2_#t~ite14_Out-1283555461| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1283555461, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1283555461, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1283555461, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1283555461} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1283555461, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1283555461, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1283555461, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-1283555461|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1283555461} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-18 12:15:16,140 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [853] [853] L775-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_44 1) v_~__unbuffered_cnt~0_43) (= |v_P1Thread1of1ForFork2_#t~ite14_32| v_~z$r_buff1_thd2~0_56) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_44, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_32|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_56, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_31|, 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 12:15:16,141 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [879] [879] L797-->L797-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In227333529 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite24_Out227333529| |P2Thread1of1ForFork0_#t~ite23_Out227333529|) (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In227333529 256)))) (or (= 0 (mod ~z$w_buff0_used~0_In227333529 256)) (and .cse0 (= 0 (mod ~z$r_buff1_thd3~0_In227333529 256))) (and .cse0 (= (mod ~z$w_buff1_used~0_In227333529 256) 0)))) (= |P2Thread1of1ForFork0_#t~ite23_Out227333529| ~z$w_buff1~0_In227333529) .cse1) (and (not .cse1) (= |P2Thread1of1ForFork0_#t~ite24_Out227333529| ~z$w_buff1~0_In227333529) (= |P2Thread1of1ForFork0_#t~ite23_In227333529| |P2Thread1of1ForFork0_#t~ite23_Out227333529|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In227333529, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In227333529, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_In227333529|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In227333529, ~z$w_buff1~0=~z$w_buff1~0_In227333529, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In227333529, ~weak$$choice2~0=~weak$$choice2~0_In227333529} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In227333529, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_Out227333529|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In227333529, P2Thread1of1ForFork0_#t~ite24=|P2Thread1of1ForFork0_#t~ite24_Out227333529|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In227333529, ~z$w_buff1~0=~z$w_buff1~0_In227333529, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In227333529, ~weak$$choice2~0=~weak$$choice2~0_In227333529} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24] because there is no mapped edge [2019-12-18 12:15:16,141 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L798-->L798-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-755884683 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite27_Out-755884683| ~z$w_buff0_used~0_In-755884683) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite26_In-755884683| |P2Thread1of1ForFork0_#t~ite26_Out-755884683|)) (and (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-755884683 256)))) (or (and .cse1 (= 0 (mod ~z$w_buff1_used~0_In-755884683 256))) (and (= 0 (mod ~z$r_buff1_thd3~0_In-755884683 256)) .cse1) (= 0 (mod ~z$w_buff0_used~0_In-755884683 256)))) .cse0 (= |P2Thread1of1ForFork0_#t~ite27_Out-755884683| |P2Thread1of1ForFork0_#t~ite26_Out-755884683|) (= ~z$w_buff0_used~0_In-755884683 |P2Thread1of1ForFork0_#t~ite26_Out-755884683|)))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In-755884683|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-755884683, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-755884683, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-755884683, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-755884683, ~weak$$choice2~0=~weak$$choice2~0_In-755884683} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out-755884683|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out-755884683|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-755884683, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-755884683, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-755884683, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-755884683, ~weak$$choice2~0=~weak$$choice2~0_In-755884683} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-18 12:15:16,143 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_67 v_~z$r_buff0_thd3~0_66)) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_67, ~weak$$choice2~0=v_~weak$$choice2~0_16} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_9|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_11|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_66, 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 12:15:16,145 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L803-->L807: Formula: (and (= 0 v_~z$flush_delayed~0_11) (= v_~z~0_50 v_~z$mem_tmp~0_5) (not (= 0 (mod v_~z$flush_delayed~0_12 256)))) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_12} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_13|, ~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_11, ~z~0=v_~z~0_50} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-18 12:15:16,146 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L749-->L749-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In654966931 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In654966931 256)))) (or (and (= 0 |P0Thread1of1ForFork1_#t~ite5_Out654966931|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In654966931 |P0Thread1of1ForFork1_#t~ite5_Out654966931|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In654966931, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In654966931} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out654966931|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In654966931, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In654966931} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-18 12:15:16,146 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L807-2-->L807-4: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-1089374552 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1089374552 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite38_Out-1089374552| ~z~0_In-1089374552) (or .cse0 .cse1)) (and (= |P2Thread1of1ForFork0_#t~ite38_Out-1089374552| ~z$w_buff1~0_In-1089374552) (not .cse1) (not .cse0)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1089374552, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1089374552, ~z$w_buff1~0=~z$w_buff1~0_In-1089374552, ~z~0=~z~0_In-1089374552} OutVars{P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out-1089374552|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1089374552, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1089374552, ~z$w_buff1~0=~z$w_buff1~0_In-1089374552, ~z~0=~z~0_In-1089374552} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-18 12:15:16,147 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L750-->L750-2: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In1229335800 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd1~0_In1229335800 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In1229335800 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In1229335800 256) 0))) (or (and (= ~z$w_buff1_used~0_In1229335800 |P0Thread1of1ForFork1_#t~ite6_Out1229335800|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |P0Thread1of1ForFork1_#t~ite6_Out1229335800|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1229335800, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1229335800, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1229335800, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1229335800} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1229335800, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out1229335800|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1229335800, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1229335800, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1229335800} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-18 12:15:16,147 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L751-->L752: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In-338723976 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-338723976 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd1~0_Out-338723976 ~z$r_buff0_thd1~0_In-338723976)) (and (not .cse0) (not .cse1) (= 0 ~z$r_buff0_thd1~0_Out-338723976)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-338723976, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-338723976} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-338723976, P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out-338723976|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-338723976} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 12:15:16,147 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L752-->L752-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff1_used~0_In1535740364 256))) (.cse2 (= (mod ~z$r_buff1_thd1~0_In1535740364 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In1535740364 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1535740364 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork1_#t~ite8_Out1535740364| 0)) (and (= |P0Thread1of1ForFork1_#t~ite8_Out1535740364| ~z$r_buff1_thd1~0_In1535740364) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1535740364, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1535740364, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1535740364, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1535740364} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out1535740364|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1535740364, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1535740364, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1535740364, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1535740364} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-18 12:15:16,148 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [870] [870] L752-2-->P0EXIT: Formula: (and (= v_~z$r_buff1_thd1~0_72 |v_P0Thread1of1ForFork1_#t~ite8_32|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_64 1) v_~__unbuffered_cnt~0_63)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_31|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_72, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63} 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 12:15:16,148 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L807-4-->L808: Formula: (= v_~z~0_20 |v_P2Thread1of1ForFork0_#t~ite38_12|) InVars {P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_12|} OutVars{P2Thread1of1ForFork0_#t~ite39=|v_P2Thread1of1ForFork0_#t~ite39_7|, P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_11|, ~z~0=v_~z~0_20} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38, ~z~0] because there is no mapped edge [2019-12-18 12:15:16,148 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L808-->L808-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In326972810 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In326972810 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork0_#t~ite40_Out326972810|)) (and (or .cse1 .cse0) (= ~z$w_buff0_used~0_In326972810 |P2Thread1of1ForFork0_#t~ite40_Out326972810|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In326972810, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In326972810} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In326972810, P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out326972810|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In326972810} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-18 12:15:16,149 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L809-->L809-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In-2084084457 256))) (.cse1 (= (mod ~z$r_buff1_thd3~0_In-2084084457 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd3~0_In-2084084457 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-2084084457 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite41_Out-2084084457| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite41_Out-2084084457| ~z$w_buff1_used~0_In-2084084457) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2084084457, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-2084084457, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2084084457, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2084084457} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-2084084457, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-2084084457, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2084084457, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2084084457, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out-2084084457|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-18 12:15:16,149 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L810-->L810-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-337145726 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-337145726 256)))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite42_Out-337145726| 0)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork0_#t~ite42_Out-337145726| ~z$r_buff0_thd3~0_In-337145726)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-337145726, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-337145726} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-337145726, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-337145726, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out-337145726|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-18 12:15:16,150 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L811-->L811-2: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In-2022006577 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd3~0_In-2022006577 256))) (.cse1 (= (mod ~z$r_buff0_thd3~0_In-2022006577 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-2022006577 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite43_Out-2022006577| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |P2Thread1of1ForFork0_#t~ite43_Out-2022006577| ~z$r_buff1_thd3~0_In-2022006577)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2022006577, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-2022006577, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2022006577, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2022006577} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out-2022006577|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2022006577, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-2022006577, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2022006577, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2022006577} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-18 12:15:16,150 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [855] [855] L811-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_54 1) v_~__unbuffered_cnt~0_53) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= v_~z$r_buff1_thd3~0_121 |v_P2Thread1of1ForFork0_#t~ite43_30|)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_29|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_121, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_53, 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 12:15:16,151 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [807] [807] L834-1-->L840: Formula: (and (= v_~main$tmp_guard0~0_11 1) (= 3 v_~__unbuffered_cnt~0_28)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_28} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_28, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 12:15:16,151 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L840-2-->L840-5: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-430032497 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-430032497 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite47_Out-430032497| |ULTIMATE.start_main_#t~ite48_Out-430032497|))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite47_Out-430032497| ~z$w_buff1~0_In-430032497) .cse2) (and (or .cse1 .cse0) .cse2 (= |ULTIMATE.start_main_#t~ite47_Out-430032497| ~z~0_In-430032497)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-430032497, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-430032497, ~z$w_buff1~0=~z$w_buff1~0_In-430032497, ~z~0=~z~0_In-430032497} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-430032497, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-430032497|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-430032497, ~z$w_buff1~0=~z$w_buff1~0_In-430032497, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out-430032497|, ~z~0=~z~0_In-430032497} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-18 12:15:16,152 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L841-->L841-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1265619351 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-1265619351 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite49_Out-1265619351|) (not .cse0) (not .cse1)) (and (= ~z$w_buff0_used~0_In-1265619351 |ULTIMATE.start_main_#t~ite49_Out-1265619351|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1265619351, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1265619351} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1265619351, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1265619351, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-1265619351|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-18 12:15:16,153 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L842-->L842-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff1_used~0_In1391545840 256))) (.cse2 (= (mod ~z$r_buff1_thd0~0_In1391545840 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd0~0_In1391545840 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In1391545840 256) 0))) (or (and (= ~z$w_buff1_used~0_In1391545840 |ULTIMATE.start_main_#t~ite50_Out1391545840|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite50_Out1391545840|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1391545840, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1391545840, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1391545840, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1391545840} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out1391545840|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1391545840, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1391545840, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1391545840, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1391545840} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-18 12:15:16,154 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L843-->L843-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-655773842 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-655773842 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite51_Out-655773842| 0) (not .cse0) (not .cse1)) (and (= ~z$r_buff0_thd0~0_In-655773842 |ULTIMATE.start_main_#t~ite51_Out-655773842|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-655773842, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-655773842} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-655773842, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-655773842|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-655773842} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-18 12:15:16,154 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L844-->L844-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In923623615 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd0~0_In923623615 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In923623615 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd0~0_In923623615 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd0~0_In923623615 |ULTIMATE.start_main_#t~ite52_Out923623615|) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite52_Out923623615| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In923623615, ~z$w_buff0_used~0=~z$w_buff0_used~0_In923623615, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In923623615, ~z$w_buff1_used~0=~z$w_buff1_used~0_In923623615} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out923623615|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In923623615, ~z$w_buff0_used~0=~z$w_buff0_used~0_In923623615, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In923623615, ~z$w_buff1_used~0=~z$w_buff1_used~0_In923623615} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-18 12:15:16,155 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [886] [886] L844-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_18 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13| (mod v_~main$tmp_guard1~0_18 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= 2 v_~__unbuffered_p1_EAX~0_22) (= v_~x~0_65 2) (= v_~__unbuffered_p2_EBX~0_27 0) (= v_~z$r_buff1_thd0~0_101 |v_ULTIMATE.start_main_#t~ite52_39|) (= v_~__unbuffered_p1_EBX~0_23 0) (= 1 v_~__unbuffered_p2_EAX~0_23)) InVars {ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_39|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_23, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_22, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ~x~0=v_~x~0_65} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_38|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_19, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_23, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_22, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_101, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ~x~0=v_~x~0_65, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} 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 12:15:16,263 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 12:15:16 BasicIcfg [2019-12-18 12:15:16,263 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 12:15:16,265 INFO L168 Benchmark]: Toolchain (without parser) took 127290.99 ms. Allocated memory was 137.4 MB in the beginning and 3.6 GB in the end (delta: 3.5 GB). Free memory was 100.6 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-12-18 12:15:16,265 INFO L168 Benchmark]: CDTParser took 0.50 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 12:15:16,266 INFO L168 Benchmark]: CACSL2BoogieTranslator took 797.24 ms. Allocated memory was 137.4 MB in the beginning and 201.9 MB in the end (delta: 64.5 MB). Free memory was 100.4 MB in the beginning and 153.0 MB in the end (delta: -52.6 MB). Peak memory consumption was 24.7 MB. Max. memory is 7.1 GB. [2019-12-18 12:15:16,266 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.32 ms. Allocated memory is still 201.9 MB. Free memory was 153.0 MB in the beginning and 150.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 12:15:16,267 INFO L168 Benchmark]: Boogie Preprocessor took 46.41 ms. Allocated memory is still 201.9 MB. Free memory was 150.2 MB in the beginning and 148.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-18 12:15:16,267 INFO L168 Benchmark]: RCFGBuilder took 832.77 ms. Allocated memory is still 201.9 MB. Free memory was 148.2 MB in the beginning and 97.2 MB in the end (delta: 51.0 MB). Peak memory consumption was 51.0 MB. Max. memory is 7.1 GB. [2019-12-18 12:15:16,268 INFO L168 Benchmark]: TraceAbstraction took 125539.41 ms. Allocated memory was 201.9 MB in the beginning and 3.6 GB in the end (delta: 3.4 GB). Free memory was 97.2 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-12-18 12:15:16,270 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.50 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 797.24 ms. Allocated memory was 137.4 MB in the beginning and 201.9 MB in the end (delta: 64.5 MB). Free memory was 100.4 MB in the beginning and 153.0 MB in the end (delta: -52.6 MB). Peak memory consumption was 24.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 67.32 ms. Allocated memory is still 201.9 MB. Free memory was 153.0 MB in the beginning and 150.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 46.41 ms. Allocated memory is still 201.9 MB. Free memory was 150.2 MB in the beginning and 148.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 832.77 ms. Allocated memory is still 201.9 MB. Free memory was 148.2 MB in the beginning and 97.2 MB in the end (delta: 51.0 MB). Peak memory consumption was 51.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 125539.41 ms. Allocated memory was 201.9 MB in the beginning and 3.6 GB in the end (delta: 3.4 GB). Free memory was 97.2 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.0s, 177 ProgramPointsBefore, 93 ProgramPointsAfterwards, 214 TransitionsBefore, 102 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 34 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 32 ChoiceCompositions, 7398 VarBasedMoverChecksPositive, 271 VarBasedMoverChecksNegative, 70 SemBasedMoverChecksPositive, 270 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.9s, 0 MoverChecksTotal, 78628 CheckedPairsTotal, 115 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)) [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=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_buff1=0, z$w_buff1_used=0] [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 [\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, 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_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 [\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, 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_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 [\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=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_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) [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 [\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_buff1=0, z$w_buff1_used=0] [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=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [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: 125.2s, OverallIterations: 33, TraceHistogramMax: 1, AutomataDifference: 43.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8524 SDtfs, 14606 SDslu, 24273 SDs, 0 SdLazy, 15604 SolverSat, 981 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 520 GetRequests, 83 SyntacticMatches, 20 SemanticMatches, 417 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2302 ImplicationChecksByTransitivity, 6.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=146095occurred 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: 52.7s AutomataMinimizationTime, 32 MinimizatonAttempts, 956477 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 1516 NumberOfCodeBlocks, 1516 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 1417 ConstructedInterpolants, 0 QuantifiedInterpolants, 259258 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 32 InterpolantComputations, 32 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...