/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix010_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 15:50:08,699 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 15:50:08,702 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 15:50:08,715 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 15:50:08,715 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 15:50:08,716 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 15:50:08,718 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 15:50:08,720 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 15:50:08,725 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 15:50:08,726 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 15:50:08,731 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 15:50:08,732 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 15:50:08,733 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 15:50:08,735 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 15:50:08,736 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 15:50:08,738 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 15:50:08,739 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 15:50:08,740 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 15:50:08,744 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 15:50:08,746 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 15:50:08,749 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 15:50:08,753 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 15:50:08,754 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 15:50:08,756 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 15:50:08,759 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 15:50:08,759 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 15:50:08,761 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 15:50:08,762 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 15:50:08,764 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 15:50:08,766 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 15:50:08,766 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 15:50:08,768 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 15:50:08,768 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 15:50:08,770 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 15:50:08,772 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 15:50:08,773 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 15:50:08,773 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 15:50:08,773 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 15:50:08,774 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 15:50:08,774 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 15:50:08,775 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 15:50:08,776 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf [2019-12-27 15:50:08,790 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 15:50:08,790 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 15:50:08,791 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 15:50:08,792 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 15:50:08,792 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 15:50:08,792 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 15:50:08,792 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 15:50:08,792 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 15:50:08,793 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 15:50:08,793 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 15:50:08,793 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 15:50:08,793 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 15:50:08,793 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 15:50:08,794 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 15:50:08,794 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 15:50:08,794 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 15:50:08,794 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 15:50:08,794 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 15:50:08,795 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 15:50:08,795 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 15:50:08,795 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 15:50:08,795 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 15:50:08,796 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 15:50:08,796 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 15:50:08,796 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 15:50:08,796 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 15:50:08,796 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 15:50:08,797 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 15:50:08,797 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 15:50:08,797 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 15:50:08,797 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 15:50:09,107 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 15:50:09,121 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 15:50:09,124 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 15:50:09,126 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 15:50:09,126 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 15:50:09,127 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix010_power.oepc.i [2019-12-27 15:50:09,184 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce123fb8a/175460ca0ca2486fb15fdba48509a590/FLAGf6a051bb8 [2019-12-27 15:50:09,724 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 15:50:09,725 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix010_power.oepc.i [2019-12-27 15:50:09,741 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce123fb8a/175460ca0ca2486fb15fdba48509a590/FLAGf6a051bb8 [2019-12-27 15:50:10,031 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce123fb8a/175460ca0ca2486fb15fdba48509a590 [2019-12-27 15:50:10,042 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 15:50:10,044 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 15:50:10,045 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 15:50:10,045 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 15:50:10,048 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 15:50:10,049 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:50:10" (1/1) ... [2019-12-27 15:50:10,052 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18e7580e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:50:10, skipping insertion in model container [2019-12-27 15:50:10,052 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:50:10" (1/1) ... [2019-12-27 15:50:10,058 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 15:50:10,115 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 15:50:10,655 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 15:50:10,671 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 15:50:10,784 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 15:50:10,869 INFO L208 MainTranslator]: Completed translation [2019-12-27 15:50:10,869 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:50:10 WrapperNode [2019-12-27 15:50:10,870 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 15:50:10,871 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 15:50:10,871 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 15:50:10,871 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 15:50:10,882 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:50:10" (1/1) ... [2019-12-27 15:50:10,913 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:50:10" (1/1) ... [2019-12-27 15:50:10,945 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 15:50:10,945 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 15:50:10,945 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 15:50:10,945 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 15:50:10,955 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:50:10" (1/1) ... [2019-12-27 15:50:10,955 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:50:10" (1/1) ... [2019-12-27 15:50:10,959 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:50:10" (1/1) ... [2019-12-27 15:50:10,960 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:50:10" (1/1) ... [2019-12-27 15:50:10,972 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:50:10" (1/1) ... [2019-12-27 15:50:10,977 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:50:10" (1/1) ... [2019-12-27 15:50:10,981 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:50:10" (1/1) ... [2019-12-27 15:50:10,987 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 15:50:10,987 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 15:50:10,987 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 15:50:10,987 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 15:50:10,988 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:50:10" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 15:50:11,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 15:50:11,071 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 15:50:11,071 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 15:50:11,071 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 15:50:11,072 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 15:50:11,072 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 15:50:11,073 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 15:50:11,073 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 15:50:11,074 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 15:50:11,074 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 15:50:11,074 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 15:50:11,074 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 15:50:11,075 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 15:50:11,077 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 15:50:11,858 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 15:50:11,858 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 15:50:11,859 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:50:11 BoogieIcfgContainer [2019-12-27 15:50:11,859 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 15:50:11,861 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 15:50:11,861 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 15:50:11,863 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 15:50:11,864 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 03:50:10" (1/3) ... [2019-12-27 15:50:11,864 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ac81be1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:50:11, skipping insertion in model container [2019-12-27 15:50:11,864 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:50:10" (2/3) ... [2019-12-27 15:50:11,865 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ac81be1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:50:11, skipping insertion in model container [2019-12-27 15:50:11,865 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:50:11" (3/3) ... [2019-12-27 15:50:11,867 INFO L109 eAbstractionObserver]: Analyzing ICFG mix010_power.oepc.i [2019-12-27 15:50:11,875 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 15:50:11,875 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 15:50:11,882 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 15:50:11,883 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 15:50:11,922 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:11,923 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:11,923 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:11,924 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:11,924 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:11,924 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:11,925 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:11,925 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:11,926 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:11,926 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:11,927 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:11,927 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:11,927 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:11,927 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:11,928 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:11,928 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:11,928 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:11,929 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:11,929 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:11,929 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:11,929 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:11,930 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:11,930 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:11,930 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:11,931 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:11,931 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:11,931 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:11,931 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:11,933 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:11,934 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:11,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:11,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:11,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:11,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:11,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:11,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:11,939 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:11,939 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:11,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:11,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:11,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:11,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:11,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:11,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:11,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:11,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:11,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:11,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:11,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:11,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:11,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:11,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:11,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:11,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:11,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:11,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:11,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:11,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:11,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:11,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:11,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:11,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:11,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:11,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:11,955 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:11,955 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:11,956 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:11,956 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:11,956 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:11,956 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:11,957 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:11,957 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:11,957 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:11,957 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:11,958 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:11,958 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:11,958 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:11,958 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:11,959 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:11,960 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:11,960 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:11,960 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:11,960 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:11,961 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:11,987 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:11,988 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:11,988 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:11,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:11,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:11,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:11,990 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:11,990 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:11,990 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:11,990 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:11,990 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:11,990 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:11,991 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:11,991 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:11,991 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:11,991 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:11,992 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:11,995 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:11,996 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:11,996 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:11,997 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:12,004 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:12,004 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:12,004 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:12,005 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:12,006 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:12,006 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:12,006 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:12,006 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:12,006 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:12,007 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:12,007 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:12,007 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:12,007 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:12,007 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:12,007 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:12,008 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:12,008 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:12,008 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:12,008 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:12,008 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:12,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:12,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:12,012 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:12,012 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:12,012 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:12,012 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:12,012 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:12,012 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:12,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:12,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:12,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:12,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:12,015 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:12,015 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:12,015 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:12,015 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:12,015 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:12,015 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:12,016 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:12,016 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:12,016 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:12,016 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:12,016 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:12,017 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:12,017 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:12,017 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:12,017 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:12,017 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:12,017 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:12,018 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:12,018 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:12,018 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:12,018 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:12,018 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:12,018 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:12,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:12,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:12,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:12,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:12,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:12,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:12,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:12,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:12,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:12,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:12,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:12,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:12,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:12,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:12,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:12,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:12,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:12,022 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:12,022 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:12,022 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:12,022 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:12,023 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:12,030 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:12,030 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:12,030 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:12,030 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:12,031 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:12,031 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:12,031 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:12,031 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:12,031 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:12,031 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:12,032 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:12,032 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:12,032 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:12,032 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:12,032 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:12,032 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:12,032 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:12,033 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:12,033 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:12,033 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:12,033 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:12,033 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:12,033 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:12,034 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:12,034 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:12,034 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:12,034 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:12,034 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:12,034 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:12,035 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:12,035 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:12,035 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:12,035 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:12,039 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:12,040 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:12,040 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:12,040 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:12,046 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:12,046 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:12,046 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:12,046 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:12,047 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:12,047 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:12,047 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:12,047 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:12,049 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:12,049 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:12,049 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:12,049 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:12,050 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:12,050 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:12,050 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:12,050 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:12,050 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:12,050 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:50:12,064 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 15:50:12,081 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 15:50:12,081 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 15:50:12,081 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 15:50:12,081 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 15:50:12,082 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 15:50:12,082 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 15:50:12,082 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 15:50:12,082 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 15:50:12,096 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 179 places, 216 transitions [2019-12-27 15:50:12,098 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 216 transitions [2019-12-27 15:50:12,199 INFO L132 PetriNetUnfolder]: 47/213 cut-off events. [2019-12-27 15:50:12,200 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 15:50:12,217 INFO L76 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 213 events. 47/213 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 431 event pairs. 0/164 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 15:50:12,241 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 216 transitions [2019-12-27 15:50:12,296 INFO L132 PetriNetUnfolder]: 47/213 cut-off events. [2019-12-27 15:50:12,297 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 15:50:12,305 INFO L76 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 213 events. 47/213 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 431 event pairs. 0/164 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 15:50:12,325 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 15:50:12,326 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 15:50:17,615 WARN L192 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-12-27 15:50:17,784 WARN L192 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-12-27 15:50:17,815 INFO L206 etLargeBlockEncoding]: Checked pairs total: 91218 [2019-12-27 15:50:17,816 INFO L214 etLargeBlockEncoding]: Total number of compositions: 116 [2019-12-27 15:50:17,820 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 95 places, 105 transitions [2019-12-27 15:50:39,101 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 126452 states. [2019-12-27 15:50:39,103 INFO L276 IsEmpty]: Start isEmpty. Operand 126452 states. [2019-12-27 15:50:39,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 15:50:39,109 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:50:39,109 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 15:50:39,110 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:50:39,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:50:39,116 INFO L82 PathProgramCache]: Analyzing trace with hash 921826, now seen corresponding path program 1 times [2019-12-27 15:50:39,127 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:50:39,129 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136589645] [2019-12-27 15:50:39,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:50:39,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:50:39,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:50:39,366 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136589645] [2019-12-27 15:50:39,367 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:50:39,367 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 15:50:39,368 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1470875719] [2019-12-27 15:50:39,368 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:50:39,372 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:50:39,384 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 15:50:39,384 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:50:39,388 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:50:39,388 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:50:39,388 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:50:39,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:50:39,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:50:39,404 INFO L87 Difference]: Start difference. First operand 126452 states. Second operand 3 states. [2019-12-27 15:50:41,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:50:41,111 INFO L93 Difference]: Finished difference Result 125226 states and 534182 transitions. [2019-12-27 15:50:41,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:50:41,112 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 15:50:41,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:50:45,285 INFO L225 Difference]: With dead ends: 125226 [2019-12-27 15:50:45,285 INFO L226 Difference]: Without dead ends: 117946 [2019-12-27 15:50:45,289 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:50:50,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117946 states. [2019-12-27 15:50:53,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117946 to 117946. [2019-12-27 15:50:53,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117946 states. [2019-12-27 15:50:53,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117946 states to 117946 states and 502500 transitions. [2019-12-27 15:50:53,845 INFO L78 Accepts]: Start accepts. Automaton has 117946 states and 502500 transitions. Word has length 3 [2019-12-27 15:50:53,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:50:53,845 INFO L462 AbstractCegarLoop]: Abstraction has 117946 states and 502500 transitions. [2019-12-27 15:50:53,845 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:50:53,845 INFO L276 IsEmpty]: Start isEmpty. Operand 117946 states and 502500 transitions. [2019-12-27 15:50:53,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 15:50:53,850 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:50:53,850 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:50:53,851 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:50:53,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:50:53,851 INFO L82 PathProgramCache]: Analyzing trace with hash -2034548154, now seen corresponding path program 1 times [2019-12-27 15:50:53,852 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:50:53,852 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192183392] [2019-12-27 15:50:53,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:50:53,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:50:53,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:50:53,958 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192183392] [2019-12-27 15:50:53,958 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:50:53,958 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:50:53,959 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2135084302] [2019-12-27 15:50:53,959 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:50:53,961 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:50:53,964 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 15:50:53,964 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:50:53,965 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:50:53,966 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 15:50:53,966 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:50:53,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 15:50:53,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 15:50:53,967 INFO L87 Difference]: Start difference. First operand 117946 states and 502500 transitions. Second operand 4 states. [2019-12-27 15:50:58,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:50:58,790 INFO L93 Difference]: Finished difference Result 183040 states and 750092 transitions. [2019-12-27 15:50:58,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 15:50:58,791 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 15:50:58,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:50:59,392 INFO L225 Difference]: With dead ends: 183040 [2019-12-27 15:50:59,392 INFO L226 Difference]: Without dead ends: 182991 [2019-12-27 15:50:59,393 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 15:51:06,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182991 states. [2019-12-27 15:51:14,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182991 to 168271. [2019-12-27 15:51:14,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168271 states. [2019-12-27 15:51:15,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168271 states to 168271 states and 697811 transitions. [2019-12-27 15:51:15,248 INFO L78 Accepts]: Start accepts. Automaton has 168271 states and 697811 transitions. Word has length 11 [2019-12-27 15:51:15,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:51:15,248 INFO L462 AbstractCegarLoop]: Abstraction has 168271 states and 697811 transitions. [2019-12-27 15:51:15,248 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 15:51:15,248 INFO L276 IsEmpty]: Start isEmpty. Operand 168271 states and 697811 transitions. [2019-12-27 15:51:15,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 15:51:15,254 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:51:15,254 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:51:15,254 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:51:15,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:51:15,255 INFO L82 PathProgramCache]: Analyzing trace with hash -579003435, now seen corresponding path program 1 times [2019-12-27 15:51:15,255 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:51:15,255 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381966778] [2019-12-27 15:51:15,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:51:15,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:51:15,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:51:15,331 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381966778] [2019-12-27 15:51:15,331 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:51:15,332 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:51:15,332 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [768352617] [2019-12-27 15:51:15,332 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:51:15,333 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:51:15,335 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 15:51:15,335 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:51:15,335 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:51:15,335 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:51:15,335 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:51:15,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:51:15,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:51:15,336 INFO L87 Difference]: Start difference. First operand 168271 states and 697811 transitions. Second operand 3 states. [2019-12-27 15:51:15,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:51:15,474 INFO L93 Difference]: Finished difference Result 35531 states and 115505 transitions. [2019-12-27 15:51:15,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:51:15,474 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 15:51:15,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:51:15,565 INFO L225 Difference]: With dead ends: 35531 [2019-12-27 15:51:15,565 INFO L226 Difference]: Without dead ends: 35531 [2019-12-27 15:51:15,566 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:51:15,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35531 states. [2019-12-27 15:51:16,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35531 to 35531. [2019-12-27 15:51:16,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35531 states. [2019-12-27 15:51:16,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35531 states to 35531 states and 115505 transitions. [2019-12-27 15:51:16,285 INFO L78 Accepts]: Start accepts. Automaton has 35531 states and 115505 transitions. Word has length 13 [2019-12-27 15:51:16,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:51:16,285 INFO L462 AbstractCegarLoop]: Abstraction has 35531 states and 115505 transitions. [2019-12-27 15:51:16,285 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:51:16,285 INFO L276 IsEmpty]: Start isEmpty. Operand 35531 states and 115505 transitions. [2019-12-27 15:51:16,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 15:51:16,289 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:51:16,289 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:51:16,289 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:51:16,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:51:16,290 INFO L82 PathProgramCache]: Analyzing trace with hash -1458626840, now seen corresponding path program 1 times [2019-12-27 15:51:16,290 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:51:16,290 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573636975] [2019-12-27 15:51:16,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:51:16,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:51:16,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:51:16,387 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573636975] [2019-12-27 15:51:16,388 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:51:16,388 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 15:51:16,388 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1561782803] [2019-12-27 15:51:16,388 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:51:16,391 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:51:16,395 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 15:51:16,395 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:51:16,395 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:51:16,396 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 15:51:16,396 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:51:16,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 15:51:16,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 15:51:16,397 INFO L87 Difference]: Start difference. First operand 35531 states and 115505 transitions. Second operand 5 states. [2019-12-27 15:51:19,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:51:19,351 INFO L93 Difference]: Finished difference Result 49606 states and 159424 transitions. [2019-12-27 15:51:19,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 15:51:19,352 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-27 15:51:19,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:51:19,448 INFO L225 Difference]: With dead ends: 49606 [2019-12-27 15:51:19,448 INFO L226 Difference]: Without dead ends: 49606 [2019-12-27 15:51:19,448 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 15:51:19,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49606 states. [2019-12-27 15:51:20,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49606 to 42335. [2019-12-27 15:51:20,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42335 states. [2019-12-27 15:51:20,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42335 states to 42335 states and 137188 transitions. [2019-12-27 15:51:20,318 INFO L78 Accepts]: Start accepts. Automaton has 42335 states and 137188 transitions. Word has length 16 [2019-12-27 15:51:20,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:51:20,319 INFO L462 AbstractCegarLoop]: Abstraction has 42335 states and 137188 transitions. [2019-12-27 15:51:20,320 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 15:51:20,320 INFO L276 IsEmpty]: Start isEmpty. Operand 42335 states and 137188 transitions. [2019-12-27 15:51:20,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 15:51:20,331 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:51:20,331 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:51:20,332 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:51:20,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:51:20,332 INFO L82 PathProgramCache]: Analyzing trace with hash -311730194, now seen corresponding path program 1 times [2019-12-27 15:51:20,333 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:51:20,333 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048485633] [2019-12-27 15:51:20,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:51:20,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:51:20,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:51:20,455 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048485633] [2019-12-27 15:51:20,455 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:51:20,455 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 15:51:20,455 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2052424923] [2019-12-27 15:51:20,456 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:51:20,460 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:51:20,469 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 41 states and 58 transitions. [2019-12-27 15:51:20,469 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:51:20,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 15:51:20,564 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 15:51:20,565 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 15:51:20,565 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:51:20,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 15:51:20,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-27 15:51:20,566 INFO L87 Difference]: Start difference. First operand 42335 states and 137188 transitions. Second operand 9 states. [2019-12-27 15:51:21,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:51:21,978 INFO L93 Difference]: Finished difference Result 68217 states and 214442 transitions. [2019-12-27 15:51:21,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 15:51:21,979 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2019-12-27 15:51:21,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:51:22,141 INFO L225 Difference]: With dead ends: 68217 [2019-12-27 15:51:22,141 INFO L226 Difference]: Without dead ends: 68203 [2019-12-27 15:51:22,142 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2019-12-27 15:51:22,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68203 states. [2019-12-27 15:51:23,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68203 to 42009. [2019-12-27 15:51:23,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42009 states. [2019-12-27 15:51:23,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42009 states to 42009 states and 135594 transitions. [2019-12-27 15:51:23,489 INFO L78 Accepts]: Start accepts. Automaton has 42009 states and 135594 transitions. Word has length 22 [2019-12-27 15:51:23,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:51:23,489 INFO L462 AbstractCegarLoop]: Abstraction has 42009 states and 135594 transitions. [2019-12-27 15:51:23,490 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 15:51:23,490 INFO L276 IsEmpty]: Start isEmpty. Operand 42009 states and 135594 transitions. [2019-12-27 15:51:23,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 15:51:23,506 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:51:23,506 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:51:23,506 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:51:23,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:51:23,507 INFO L82 PathProgramCache]: Analyzing trace with hash 573582081, now seen corresponding path program 1 times [2019-12-27 15:51:23,507 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:51:23,507 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528484868] [2019-12-27 15:51:23,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:51:23,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:51:23,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:51:23,566 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528484868] [2019-12-27 15:51:23,566 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:51:23,566 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 15:51:23,567 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1602072796] [2019-12-27 15:51:23,567 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:51:23,570 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:51:23,580 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 73 transitions. [2019-12-27 15:51:23,580 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:51:23,599 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 15:51:23,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 15:51:23,600 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:51:23,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 15:51:23,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 15:51:23,601 INFO L87 Difference]: Start difference. First operand 42009 states and 135594 transitions. Second operand 5 states. [2019-12-27 15:51:23,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:51:23,680 INFO L93 Difference]: Finished difference Result 16636 states and 50803 transitions. [2019-12-27 15:51:23,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 15:51:23,681 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 15:51:23,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:51:23,704 INFO L225 Difference]: With dead ends: 16636 [2019-12-27 15:51:23,704 INFO L226 Difference]: Without dead ends: 16636 [2019-12-27 15:51:23,704 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 15:51:23,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16636 states. [2019-12-27 15:51:23,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16636 to 16378. [2019-12-27 15:51:23,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16378 states. [2019-12-27 15:51:23,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16378 states to 16378 states and 50067 transitions. [2019-12-27 15:51:23,965 INFO L78 Accepts]: Start accepts. Automaton has 16378 states and 50067 transitions. Word has length 25 [2019-12-27 15:51:23,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:51:23,965 INFO L462 AbstractCegarLoop]: Abstraction has 16378 states and 50067 transitions. [2019-12-27 15:51:23,965 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 15:51:23,965 INFO L276 IsEmpty]: Start isEmpty. Operand 16378 states and 50067 transitions. [2019-12-27 15:51:23,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 15:51:23,977 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:51:23,977 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:51:23,978 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:51:23,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:51:23,978 INFO L82 PathProgramCache]: Analyzing trace with hash 574668024, now seen corresponding path program 1 times [2019-12-27 15:51:23,978 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:51:23,979 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502725306] [2019-12-27 15:51:23,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:51:23,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:51:24,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:51:24,070 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502725306] [2019-12-27 15:51:24,071 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:51:24,071 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 15:51:24,071 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1304074417] [2019-12-27 15:51:24,071 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:51:24,075 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:51:24,081 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 15:51:24,081 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:51:24,081 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:51:24,082 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 15:51:24,082 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:51:24,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 15:51:24,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 15:51:24,083 INFO L87 Difference]: Start difference. First operand 16378 states and 50067 transitions. Second operand 6 states. [2019-12-27 15:51:24,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:51:24,621 INFO L93 Difference]: Finished difference Result 23754 states and 70239 transitions. [2019-12-27 15:51:24,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 15:51:24,621 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 15:51:24,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:51:24,655 INFO L225 Difference]: With dead ends: 23754 [2019-12-27 15:51:24,655 INFO L226 Difference]: Without dead ends: 23754 [2019-12-27 15:51:24,655 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 15:51:24,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23754 states. [2019-12-27 15:51:24,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23754 to 19127. [2019-12-27 15:51:24,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19127 states. [2019-12-27 15:51:24,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19127 states to 19127 states and 57723 transitions. [2019-12-27 15:51:24,979 INFO L78 Accepts]: Start accepts. Automaton has 19127 states and 57723 transitions. Word has length 27 [2019-12-27 15:51:24,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:51:24,979 INFO L462 AbstractCegarLoop]: Abstraction has 19127 states and 57723 transitions. [2019-12-27 15:51:24,979 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 15:51:24,979 INFO L276 IsEmpty]: Start isEmpty. Operand 19127 states and 57723 transitions. [2019-12-27 15:51:24,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 15:51:24,999 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:51:25,000 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:51:25,000 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:51:25,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:51:25,000 INFO L82 PathProgramCache]: Analyzing trace with hash -1393723506, now seen corresponding path program 1 times [2019-12-27 15:51:25,000 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:51:25,001 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587168617] [2019-12-27 15:51:25,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:51:25,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:51:25,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:51:25,079 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587168617] [2019-12-27 15:51:25,079 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:51:25,079 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 15:51:25,080 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1240351614] [2019-12-27 15:51:25,080 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:51:25,088 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:51:25,106 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 55 states and 74 transitions. [2019-12-27 15:51:25,106 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:51:25,134 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 15:51:25,134 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 15:51:25,134 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:51:25,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 15:51:25,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 15:51:25,135 INFO L87 Difference]: Start difference. First operand 19127 states and 57723 transitions. Second operand 6 states. [2019-12-27 15:51:25,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:51:25,799 INFO L93 Difference]: Finished difference Result 23902 states and 71215 transitions. [2019-12-27 15:51:25,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 15:51:25,799 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-12-27 15:51:25,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:51:25,841 INFO L225 Difference]: With dead ends: 23902 [2019-12-27 15:51:25,842 INFO L226 Difference]: Without dead ends: 23902 [2019-12-27 15:51:25,842 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-27 15:51:25,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23902 states. [2019-12-27 15:51:26,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23902 to 20179. [2019-12-27 15:51:26,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20179 states. [2019-12-27 15:51:26,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20179 states to 20179 states and 61180 transitions. [2019-12-27 15:51:26,187 INFO L78 Accepts]: Start accepts. Automaton has 20179 states and 61180 transitions. Word has length 33 [2019-12-27 15:51:26,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:51:26,187 INFO L462 AbstractCegarLoop]: Abstraction has 20179 states and 61180 transitions. [2019-12-27 15:51:26,187 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 15:51:26,187 INFO L276 IsEmpty]: Start isEmpty. Operand 20179 states and 61180 transitions. [2019-12-27 15:51:26,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 15:51:26,211 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:51:26,212 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:51:26,212 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:51:26,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:51:26,212 INFO L82 PathProgramCache]: Analyzing trace with hash 305072172, now seen corresponding path program 2 times [2019-12-27 15:51:26,213 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:51:26,213 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933763120] [2019-12-27 15:51:26,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:51:26,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:51:26,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-27 15:51:26,345 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933763120] [2019-12-27 15:51:26,345 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:51:26,346 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 15:51:26,347 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [398038332] [2019-12-27 15:51:26,347 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:51:26,353 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:51:26,369 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 54 states and 73 transitions. [2019-12-27 15:51:26,370 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:51:26,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 15:51:26,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 15:51:26,470 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 15:51:26,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 15:51:26,471 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:51:26,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 15:51:26,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-12-27 15:51:26,472 INFO L87 Difference]: Start difference. First operand 20179 states and 61180 transitions. Second operand 11 states. [2019-12-27 15:51:28,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:51:28,213 INFO L93 Difference]: Finished difference Result 37996 states and 112910 transitions. [2019-12-27 15:51:28,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 15:51:28,213 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 33 [2019-12-27 15:51:28,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:51:28,268 INFO L225 Difference]: With dead ends: 37996 [2019-12-27 15:51:28,268 INFO L226 Difference]: Without dead ends: 37996 [2019-12-27 15:51:28,269 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2019-12-27 15:51:28,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37996 states. [2019-12-27 15:51:28,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37996 to 20600. [2019-12-27 15:51:28,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20600 states. [2019-12-27 15:51:28,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20600 states to 20600 states and 62975 transitions. [2019-12-27 15:51:28,691 INFO L78 Accepts]: Start accepts. Automaton has 20600 states and 62975 transitions. Word has length 33 [2019-12-27 15:51:28,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:51:28,692 INFO L462 AbstractCegarLoop]: Abstraction has 20600 states and 62975 transitions. [2019-12-27 15:51:28,692 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 15:51:28,692 INFO L276 IsEmpty]: Start isEmpty. Operand 20600 states and 62975 transitions. [2019-12-27 15:51:28,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 15:51:28,717 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:51:28,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] [2019-12-27 15:51:28,717 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:51:28,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:51:28,718 INFO L82 PathProgramCache]: Analyzing trace with hash -1779229683, now seen corresponding path program 1 times [2019-12-27 15:51:28,718 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:51:28,719 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116550510] [2019-12-27 15:51:28,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:51:28,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:51:28,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:51:28,786 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116550510] [2019-12-27 15:51:28,787 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:51:28,787 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 15:51:28,787 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1603150907] [2019-12-27 15:51:28,787 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:51:28,796 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:51:28,842 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 151 states and 296 transitions. [2019-12-27 15:51:28,843 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:51:28,845 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:51:28,845 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:51:28,845 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:51:28,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:51:28,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:51:28,846 INFO L87 Difference]: Start difference. First operand 20600 states and 62975 transitions. Second operand 3 states. [2019-12-27 15:51:28,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:51:28,915 INFO L93 Difference]: Finished difference Result 20599 states and 62973 transitions. [2019-12-27 15:51:28,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:51:28,915 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 15:51:28,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:51:28,942 INFO L225 Difference]: With dead ends: 20599 [2019-12-27 15:51:28,942 INFO L226 Difference]: Without dead ends: 20599 [2019-12-27 15:51:28,943 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:51:29,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20599 states. [2019-12-27 15:51:29,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20599 to 20599. [2019-12-27 15:51:29,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20599 states. [2019-12-27 15:51:29,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20599 states to 20599 states and 62973 transitions. [2019-12-27 15:51:29,372 INFO L78 Accepts]: Start accepts. Automaton has 20599 states and 62973 transitions. Word has length 39 [2019-12-27 15:51:29,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:51:29,373 INFO L462 AbstractCegarLoop]: Abstraction has 20599 states and 62973 transitions. [2019-12-27 15:51:29,373 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:51:29,373 INFO L276 IsEmpty]: Start isEmpty. Operand 20599 states and 62973 transitions. [2019-12-27 15:51:29,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 15:51:29,393 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:51:29,393 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:51:29,394 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:51:29,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:51:29,394 INFO L82 PathProgramCache]: Analyzing trace with hash 1175786798, now seen corresponding path program 1 times [2019-12-27 15:51:29,395 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:51:29,395 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368321837] [2019-12-27 15:51:29,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:51:29,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:51:29,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:51:29,499 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368321837] [2019-12-27 15:51:29,499 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:51:29,499 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 15:51:29,500 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1368354514] [2019-12-27 15:51:29,500 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:51:29,508 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:51:29,581 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 181 states and 358 transitions. [2019-12-27 15:51:29,582 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:51:29,745 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 15 times. [2019-12-27 15:51:29,746 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 15:51:29,746 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:51:29,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 15:51:29,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-12-27 15:51:29,747 INFO L87 Difference]: Start difference. First operand 20599 states and 62973 transitions. Second operand 11 states. [2019-12-27 15:51:32,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:51:32,114 INFO L93 Difference]: Finished difference Result 76331 states and 229097 transitions. [2019-12-27 15:51:32,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 15:51:32,115 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 40 [2019-12-27 15:51:32,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:51:32,246 INFO L225 Difference]: With dead ends: 76331 [2019-12-27 15:51:32,246 INFO L226 Difference]: Without dead ends: 76331 [2019-12-27 15:51:32,247 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 19 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=125, Invalid=295, Unknown=0, NotChecked=0, Total=420 [2019-12-27 15:51:32,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76331 states. [2019-12-27 15:51:33,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76331 to 26089. [2019-12-27 15:51:33,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26089 states. [2019-12-27 15:51:33,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26089 states to 26089 states and 80005 transitions. [2019-12-27 15:51:33,053 INFO L78 Accepts]: Start accepts. Automaton has 26089 states and 80005 transitions. Word has length 40 [2019-12-27 15:51:33,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:51:33,053 INFO L462 AbstractCegarLoop]: Abstraction has 26089 states and 80005 transitions. [2019-12-27 15:51:33,053 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 15:51:33,053 INFO L276 IsEmpty]: Start isEmpty. Operand 26089 states and 80005 transitions. [2019-12-27 15:51:33,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 15:51:33,080 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:51:33,080 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:51:33,080 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:51:33,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:51:33,081 INFO L82 PathProgramCache]: Analyzing trace with hash -93454286, now seen corresponding path program 2 times [2019-12-27 15:51:33,081 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:51:33,081 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82334584] [2019-12-27 15:51:33,082 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:51:33,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:51:33,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:51:33,190 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82334584] [2019-12-27 15:51:33,191 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:51:33,191 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 15:51:33,191 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1160716534] [2019-12-27 15:51:33,191 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:51:33,199 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:51:33,428 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 205 states and 404 transitions. [2019-12-27 15:51:33,429 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:51:33,458 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 15:51:33,458 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 15:51:33,458 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:51:33,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 15:51:33,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 15:51:33,459 INFO L87 Difference]: Start difference. First operand 26089 states and 80005 transitions. Second operand 6 states. [2019-12-27 15:51:34,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:51:34,304 INFO L93 Difference]: Finished difference Result 36507 states and 111194 transitions. [2019-12-27 15:51:34,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 15:51:34,305 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-27 15:51:34,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:51:34,357 INFO L225 Difference]: With dead ends: 36507 [2019-12-27 15:51:34,357 INFO L226 Difference]: Without dead ends: 36507 [2019-12-27 15:51:34,357 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 15:51:34,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36507 states. [2019-12-27 15:51:34,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36507 to 31861. [2019-12-27 15:51:34,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31861 states. [2019-12-27 15:51:34,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31861 states to 31861 states and 98004 transitions. [2019-12-27 15:51:34,872 INFO L78 Accepts]: Start accepts. Automaton has 31861 states and 98004 transitions. Word has length 40 [2019-12-27 15:51:34,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:51:34,872 INFO L462 AbstractCegarLoop]: Abstraction has 31861 states and 98004 transitions. [2019-12-27 15:51:34,873 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 15:51:34,873 INFO L276 IsEmpty]: Start isEmpty. Operand 31861 states and 98004 transitions. [2019-12-27 15:51:34,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 15:51:34,914 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:51:34,914 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:51:34,914 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:51:34,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:51:34,915 INFO L82 PathProgramCache]: Analyzing trace with hash 152430908, now seen corresponding path program 3 times [2019-12-27 15:51:34,915 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:51:34,915 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961947791] [2019-12-27 15:51:34,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:51:34,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:51:34,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:51:34,970 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961947791] [2019-12-27 15:51:34,970 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:51:34,970 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 15:51:34,970 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [163292124] [2019-12-27 15:51:34,970 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:51:34,978 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:51:35,058 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 203 states and 424 transitions. [2019-12-27 15:51:35,058 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:51:35,102 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 15:51:35,103 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 15:51:35,103 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:51:35,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 15:51:35,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 15:51:35,103 INFO L87 Difference]: Start difference. First operand 31861 states and 98004 transitions. Second operand 7 states. [2019-12-27 15:51:35,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:51:35,230 INFO L93 Difference]: Finished difference Result 30285 states and 94325 transitions. [2019-12-27 15:51:35,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 15:51:35,230 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2019-12-27 15:51:35,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:51:35,272 INFO L225 Difference]: With dead ends: 30285 [2019-12-27 15:51:35,272 INFO L226 Difference]: Without dead ends: 30285 [2019-12-27 15:51:35,273 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 15:51:35,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30285 states. [2019-12-27 15:51:35,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30285 to 29133. [2019-12-27 15:51:35,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29133 states. [2019-12-27 15:51:35,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29133 states to 29133 states and 91216 transitions. [2019-12-27 15:51:35,738 INFO L78 Accepts]: Start accepts. Automaton has 29133 states and 91216 transitions. Word has length 40 [2019-12-27 15:51:35,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:51:35,738 INFO L462 AbstractCegarLoop]: Abstraction has 29133 states and 91216 transitions. [2019-12-27 15:51:35,738 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 15:51:35,738 INFO L276 IsEmpty]: Start isEmpty. Operand 29133 states and 91216 transitions. [2019-12-27 15:51:35,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 15:51:35,770 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:51:35,770 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:51:35,770 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:51:35,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:51:35,770 INFO L82 PathProgramCache]: Analyzing trace with hash 8761726, now seen corresponding path program 1 times [2019-12-27 15:51:35,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:51:35,771 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115784336] [2019-12-27 15:51:35,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:51:35,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:51:35,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:51:35,820 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115784336] [2019-12-27 15:51:35,820 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:51:35,820 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 15:51:35,820 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1384130653] [2019-12-27 15:51:35,820 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:51:35,842 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:51:36,285 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 286 states and 514 transitions. [2019-12-27 15:51:36,285 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:51:36,299 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 15:51:36,299 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:51:36,299 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:51:36,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:51:36,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:51:36,300 INFO L87 Difference]: Start difference. First operand 29133 states and 91216 transitions. Second operand 3 states. [2019-12-27 15:51:36,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:51:36,444 INFO L93 Difference]: Finished difference Result 37246 states and 115086 transitions. [2019-12-27 15:51:36,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:51:36,444 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 15:51:36,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:51:36,495 INFO L225 Difference]: With dead ends: 37246 [2019-12-27 15:51:36,495 INFO L226 Difference]: Without dead ends: 37246 [2019-12-27 15:51:36,496 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:51:36,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37246 states. [2019-12-27 15:51:36,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37246 to 27242. [2019-12-27 15:51:36,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27242 states. [2019-12-27 15:51:36,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27242 states to 27242 states and 84793 transitions. [2019-12-27 15:51:36,986 INFO L78 Accepts]: Start accepts. Automaton has 27242 states and 84793 transitions. Word has length 64 [2019-12-27 15:51:36,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:51:36,986 INFO L462 AbstractCegarLoop]: Abstraction has 27242 states and 84793 transitions. [2019-12-27 15:51:36,986 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:51:36,986 INFO L276 IsEmpty]: Start isEmpty. Operand 27242 states and 84793 transitions. [2019-12-27 15:51:37,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 15:51:37,014 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:51:37,014 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:51:37,015 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:51:37,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:51:37,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1487362447, now seen corresponding path program 1 times [2019-12-27 15:51:37,015 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:51:37,016 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835255921] [2019-12-27 15:51:37,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:51:37,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:51:37,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:51:37,114 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835255921] [2019-12-27 15:51:37,114 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:51:37,114 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 15:51:37,114 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2005111044] [2019-12-27 15:51:37,114 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:51:37,135 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:51:37,478 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 286 states and 514 transitions. [2019-12-27 15:51:37,478 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:51:37,595 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 13 times. [2019-12-27 15:51:37,595 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 15:51:37,595 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:51:37,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 15:51:37,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 15:51:37,596 INFO L87 Difference]: Start difference. First operand 27242 states and 84793 transitions. Second operand 9 states. [2019-12-27 15:51:39,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:51:39,881 INFO L93 Difference]: Finished difference Result 102455 states and 313287 transitions. [2019-12-27 15:51:39,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 15:51:39,881 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-27 15:51:39,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:51:39,989 INFO L225 Difference]: With dead ends: 102455 [2019-12-27 15:51:39,989 INFO L226 Difference]: Without dead ends: 77192 [2019-12-27 15:51:39,989 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 11 SyntacticMatches, 6 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=135, Invalid=465, Unknown=0, NotChecked=0, Total=600 [2019-12-27 15:51:40,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77192 states. [2019-12-27 15:51:40,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77192 to 31602. [2019-12-27 15:51:40,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31602 states. [2019-12-27 15:51:40,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31602 states to 31602 states and 98387 transitions. [2019-12-27 15:51:40,876 INFO L78 Accepts]: Start accepts. Automaton has 31602 states and 98387 transitions. Word has length 64 [2019-12-27 15:51:40,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:51:40,876 INFO L462 AbstractCegarLoop]: Abstraction has 31602 states and 98387 transitions. [2019-12-27 15:51:40,876 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 15:51:40,876 INFO L276 IsEmpty]: Start isEmpty. Operand 31602 states and 98387 transitions. [2019-12-27 15:51:40,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 15:51:40,911 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:51:40,911 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:51:40,911 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:51:40,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:51:40,912 INFO L82 PathProgramCache]: Analyzing trace with hash 1007546921, now seen corresponding path program 2 times [2019-12-27 15:51:40,912 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:51:40,912 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593966291] [2019-12-27 15:51:40,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:51:40,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:51:41,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:51:41,006 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593966291] [2019-12-27 15:51:41,006 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:51:41,006 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 15:51:41,006 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [184217682] [2019-12-27 15:51:41,007 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:51:41,028 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:51:41,344 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 286 states and 547 transitions. [2019-12-27 15:51:41,344 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:51:41,376 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 15:51:41,376 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 15:51:41,376 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:51:41,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 15:51:41,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 15:51:41,377 INFO L87 Difference]: Start difference. First operand 31602 states and 98387 transitions. Second operand 7 states. [2019-12-27 15:51:42,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:51:42,164 INFO L93 Difference]: Finished difference Result 81455 states and 249397 transitions. [2019-12-27 15:51:42,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 15:51:42,165 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 15:51:42,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:51:42,279 INFO L225 Difference]: With dead ends: 81455 [2019-12-27 15:51:42,279 INFO L226 Difference]: Without dead ends: 57810 [2019-12-27 15:51:42,280 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-27 15:51:42,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57810 states. [2019-12-27 15:51:42,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57810 to 35472. [2019-12-27 15:51:42,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35472 states. [2019-12-27 15:51:43,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35472 states to 35472 states and 110059 transitions. [2019-12-27 15:51:43,043 INFO L78 Accepts]: Start accepts. Automaton has 35472 states and 110059 transitions. Word has length 64 [2019-12-27 15:51:43,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:51:43,043 INFO L462 AbstractCegarLoop]: Abstraction has 35472 states and 110059 transitions. [2019-12-27 15:51:43,043 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 15:51:43,043 INFO L276 IsEmpty]: Start isEmpty. Operand 35472 states and 110059 transitions. [2019-12-27 15:51:43,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 15:51:43,085 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:51:43,086 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:51:43,086 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:51:43,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:51:43,086 INFO L82 PathProgramCache]: Analyzing trace with hash 1228276157, now seen corresponding path program 3 times [2019-12-27 15:51:43,087 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:51:43,087 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603288373] [2019-12-27 15:51:43,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:51:43,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:51:43,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:51:43,192 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603288373] [2019-12-27 15:51:43,192 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:51:43,192 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 15:51:43,192 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [768310631] [2019-12-27 15:51:43,193 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:51:43,213 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:51:43,423 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 232 states and 433 transitions. [2019-12-27 15:51:43,423 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:51:43,481 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 10 times. [2019-12-27 15:51:43,481 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 15:51:43,481 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:51:43,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 15:51:43,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 15:51:43,482 INFO L87 Difference]: Start difference. First operand 35472 states and 110059 transitions. Second operand 8 states. [2019-12-27 15:51:44,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:51:44,636 INFO L93 Difference]: Finished difference Result 100376 states and 308903 transitions. [2019-12-27 15:51:44,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 15:51:44,636 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 64 [2019-12-27 15:51:44,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:51:44,786 INFO L225 Difference]: With dead ends: 100376 [2019-12-27 15:51:44,786 INFO L226 Difference]: Without dead ends: 89606 [2019-12-27 15:51:44,787 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 13 SyntacticMatches, 5 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2019-12-27 15:51:45,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89606 states. [2019-12-27 15:51:46,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89606 to 35918. [2019-12-27 15:51:46,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35918 states. [2019-12-27 15:51:46,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35918 states to 35918 states and 111803 transitions. [2019-12-27 15:51:46,158 INFO L78 Accepts]: Start accepts. Automaton has 35918 states and 111803 transitions. Word has length 64 [2019-12-27 15:51:46,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:51:46,159 INFO L462 AbstractCegarLoop]: Abstraction has 35918 states and 111803 transitions. [2019-12-27 15:51:46,159 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 15:51:46,159 INFO L276 IsEmpty]: Start isEmpty. Operand 35918 states and 111803 transitions. [2019-12-27 15:51:46,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 15:51:46,202 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:51:46,202 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:51:46,202 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:51:46,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:51:46,202 INFO L82 PathProgramCache]: Analyzing trace with hash -2056816817, now seen corresponding path program 4 times [2019-12-27 15:51:46,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:51:46,203 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58325856] [2019-12-27 15:51:46,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:51:46,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:51:46,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:51:46,328 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58325856] [2019-12-27 15:51:46,328 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:51:46,329 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 15:51:46,329 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1117085800] [2019-12-27 15:51:46,329 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:51:46,349 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:51:46,538 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 229 states and 382 transitions. [2019-12-27 15:51:46,538 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:51:46,636 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 10 times. [2019-12-27 15:51:46,637 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 15:51:46,637 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:51:46,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 15:51:46,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-12-27 15:51:46,638 INFO L87 Difference]: Start difference. First operand 35918 states and 111803 transitions. Second operand 11 states. [2019-12-27 15:51:49,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:51:49,941 INFO L93 Difference]: Finished difference Result 146852 states and 447287 transitions. [2019-12-27 15:51:49,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-12-27 15:51:49,941 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2019-12-27 15:51:49,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:51:50,156 INFO L225 Difference]: With dead ends: 146852 [2019-12-27 15:51:50,156 INFO L226 Difference]: Without dead ends: 131648 [2019-12-27 15:51:50,157 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 19 SyntacticMatches, 7 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 870 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=569, Invalid=2083, Unknown=0, NotChecked=0, Total=2652 [2019-12-27 15:51:50,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131648 states. [2019-12-27 15:51:51,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131648 to 35991. [2019-12-27 15:51:51,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35991 states. [2019-12-27 15:51:51,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35991 states to 35991 states and 112122 transitions. [2019-12-27 15:51:51,483 INFO L78 Accepts]: Start accepts. Automaton has 35991 states and 112122 transitions. Word has length 64 [2019-12-27 15:51:51,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:51:51,484 INFO L462 AbstractCegarLoop]: Abstraction has 35991 states and 112122 transitions. [2019-12-27 15:51:51,484 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 15:51:51,484 INFO L276 IsEmpty]: Start isEmpty. Operand 35991 states and 112122 transitions. [2019-12-27 15:51:51,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 15:51:51,525 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:51:51,526 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:51:51,526 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:51:51,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:51:51,526 INFO L82 PathProgramCache]: Analyzing trace with hash -17789391, now seen corresponding path program 5 times [2019-12-27 15:51:51,527 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:51:51,527 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280242998] [2019-12-27 15:51:51,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:51:51,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:51:51,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:51:51,595 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280242998] [2019-12-27 15:51:51,596 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:51:51,596 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:51:51,596 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [839604369] [2019-12-27 15:51:51,596 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:51:51,615 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:51:51,849 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 250 states and 432 transitions. [2019-12-27 15:51:51,849 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:51:51,851 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 15:51:51,851 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:51:51,851 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:51:51,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:51:51,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:51:51,851 INFO L87 Difference]: Start difference. First operand 35991 states and 112122 transitions. Second operand 3 states. [2019-12-27 15:51:52,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:51:52,028 INFO L93 Difference]: Finished difference Result 42761 states and 132453 transitions. [2019-12-27 15:51:52,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:51:52,028 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 15:51:52,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:51:52,088 INFO L225 Difference]: With dead ends: 42761 [2019-12-27 15:51:52,088 INFO L226 Difference]: Without dead ends: 42761 [2019-12-27 15:51:52,088 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:51:52,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42761 states. [2019-12-27 15:51:52,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42761 to 37261. [2019-12-27 15:51:52,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37261 states. [2019-12-27 15:51:52,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37261 states to 37261 states and 116146 transitions. [2019-12-27 15:51:52,944 INFO L78 Accepts]: Start accepts. Automaton has 37261 states and 116146 transitions. Word has length 64 [2019-12-27 15:51:52,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:51:52,945 INFO L462 AbstractCegarLoop]: Abstraction has 37261 states and 116146 transitions. [2019-12-27 15:51:52,945 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:51:52,945 INFO L276 IsEmpty]: Start isEmpty. Operand 37261 states and 116146 transitions. [2019-12-27 15:51:52,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 15:51:52,984 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:51:52,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:51:52,985 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:51:52,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:51:52,985 INFO L82 PathProgramCache]: Analyzing trace with hash 1046831716, now seen corresponding path program 1 times [2019-12-27 15:51:52,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:51:52,986 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211852503] [2019-12-27 15:51:52,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:51:53,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:51:53,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:51:53,068 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211852503] [2019-12-27 15:51:53,069 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:51:53,069 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 15:51:53,069 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1642146631] [2019-12-27 15:51:53,069 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:51:53,089 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:51:53,361 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 240 states and 451 transitions. [2019-12-27 15:51:53,362 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:51:53,399 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 10 times. [2019-12-27 15:51:53,400 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 15:51:53,400 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:51:53,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 15:51:53,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 15:51:53,401 INFO L87 Difference]: Start difference. First operand 37261 states and 116146 transitions. Second operand 8 states. [2019-12-27 15:51:54,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:51:54,711 INFO L93 Difference]: Finished difference Result 113442 states and 345656 transitions. [2019-12-27 15:51:54,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 15:51:54,711 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-27 15:51:54,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:51:54,856 INFO L225 Difference]: With dead ends: 113442 [2019-12-27 15:51:54,857 INFO L226 Difference]: Without dead ends: 101309 [2019-12-27 15:51:54,857 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 9 SyntacticMatches, 5 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2019-12-27 15:51:55,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101309 states. [2019-12-27 15:51:56,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101309 to 37263. [2019-12-27 15:51:56,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37263 states. [2019-12-27 15:51:56,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37263 states to 37263 states and 116161 transitions. [2019-12-27 15:51:56,268 INFO L78 Accepts]: Start accepts. Automaton has 37263 states and 116161 transitions. Word has length 65 [2019-12-27 15:51:56,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:51:56,269 INFO L462 AbstractCegarLoop]: Abstraction has 37263 states and 116161 transitions. [2019-12-27 15:51:56,269 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 15:51:56,269 INFO L276 IsEmpty]: Start isEmpty. Operand 37263 states and 116161 transitions. [2019-12-27 15:51:56,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 15:51:56,306 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:51:56,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-27 15:51:56,306 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:51:56,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:51:56,307 INFO L82 PathProgramCache]: Analyzing trace with hash 501635668, now seen corresponding path program 2 times [2019-12-27 15:51:56,307 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:51:56,307 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642904925] [2019-12-27 15:51:56,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:51:56,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:51:56,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:51:56,406 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642904925] [2019-12-27 15:51:56,407 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:51:56,407 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 15:51:56,407 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1355246721] [2019-12-27 15:51:56,407 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:51:56,429 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:51:56,687 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 195 states and 348 transitions. [2019-12-27 15:51:56,688 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:51:57,105 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 15:51:57,105 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 15:51:57,106 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:51:57,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 15:51:57,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-12-27 15:51:57,106 INFO L87 Difference]: Start difference. First operand 37263 states and 116161 transitions. Second operand 12 states. [2019-12-27 15:52:03,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:52:03,712 INFO L93 Difference]: Finished difference Result 190788 states and 580742 transitions. [2019-12-27 15:52:03,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-12-27 15:52:03,712 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 65 [2019-12-27 15:52:03,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:52:03,937 INFO L225 Difference]: With dead ends: 190788 [2019-12-27 15:52:03,938 INFO L226 Difference]: Without dead ends: 157366 [2019-12-27 15:52:03,939 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 6 SyntacticMatches, 10 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1619 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=870, Invalid=3822, Unknown=0, NotChecked=0, Total=4692 [2019-12-27 15:52:04,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157366 states. [2019-12-27 15:52:05,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157366 to 40689. [2019-12-27 15:52:05,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40689 states. [2019-12-27 15:52:05,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40689 states to 40689 states and 127368 transitions. [2019-12-27 15:52:05,432 INFO L78 Accepts]: Start accepts. Automaton has 40689 states and 127368 transitions. Word has length 65 [2019-12-27 15:52:05,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:52:05,433 INFO L462 AbstractCegarLoop]: Abstraction has 40689 states and 127368 transitions. [2019-12-27 15:52:05,433 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 15:52:05,433 INFO L276 IsEmpty]: Start isEmpty. Operand 40689 states and 127368 transitions. [2019-12-27 15:52:05,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 15:52:05,475 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:52:05,475 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:52:05,475 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:52:05,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:52:05,476 INFO L82 PathProgramCache]: Analyzing trace with hash 1049644216, now seen corresponding path program 3 times [2019-12-27 15:52:05,476 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:52:05,476 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451049273] [2019-12-27 15:52:05,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:52:05,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:52:05,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:52:05,598 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451049273] [2019-12-27 15:52:05,598 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:52:05,598 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 15:52:05,598 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1285252599] [2019-12-27 15:52:05,598 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:52:05,619 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:52:05,926 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 233 states and 388 transitions. [2019-12-27 15:52:05,927 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:52:06,035 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 15:52:06,036 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 15:52:06,036 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:52:06,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 15:52:06,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 15:52:06,037 INFO L87 Difference]: Start difference. First operand 40689 states and 127368 transitions. Second operand 9 states. [2019-12-27 15:52:07,731 WARN L192 SmtUtils]: Spent 255.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-12-27 15:52:08,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:52:08,295 INFO L93 Difference]: Finished difference Result 160410 states and 489471 transitions. [2019-12-27 15:52:08,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 15:52:08,296 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-27 15:52:08,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:52:08,505 INFO L225 Difference]: With dead ends: 160410 [2019-12-27 15:52:08,506 INFO L226 Difference]: Without dead ends: 132271 [2019-12-27 15:52:08,506 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 4 SyntacticMatches, 7 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=261, Invalid=669, Unknown=0, NotChecked=0, Total=930 [2019-12-27 15:52:08,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132271 states. [2019-12-27 15:52:09,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132271 to 43049. [2019-12-27 15:52:09,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43049 states. [2019-12-27 15:52:09,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43049 states to 43049 states and 134585 transitions. [2019-12-27 15:52:09,932 INFO L78 Accepts]: Start accepts. Automaton has 43049 states and 134585 transitions. Word has length 65 [2019-12-27 15:52:09,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:52:09,932 INFO L462 AbstractCegarLoop]: Abstraction has 43049 states and 134585 transitions. [2019-12-27 15:52:09,932 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 15:52:09,932 INFO L276 IsEmpty]: Start isEmpty. Operand 43049 states and 134585 transitions. [2019-12-27 15:52:09,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 15:52:09,976 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:52:09,976 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:52:09,976 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:52:09,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:52:09,977 INFO L82 PathProgramCache]: Analyzing trace with hash 1980366454, now seen corresponding path program 4 times [2019-12-27 15:52:09,977 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:52:09,978 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095235929] [2019-12-27 15:52:09,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:52:09,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:52:10,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:52:10,079 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095235929] [2019-12-27 15:52:10,079 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:52:10,079 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 15:52:10,079 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [275879363] [2019-12-27 15:52:10,080 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:52:10,099 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:52:10,486 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 254 states and 438 transitions. [2019-12-27 15:52:10,486 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:52:10,563 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 15:52:10,564 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 15:52:10,564 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:52:10,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 15:52:10,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 15:52:10,565 INFO L87 Difference]: Start difference. First operand 43049 states and 134585 transitions. Second operand 8 states. [2019-12-27 15:52:12,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:52:12,502 INFO L93 Difference]: Finished difference Result 64678 states and 198664 transitions. [2019-12-27 15:52:12,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 15:52:12,502 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-27 15:52:12,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:52:12,595 INFO L225 Difference]: With dead ends: 64678 [2019-12-27 15:52:12,595 INFO L226 Difference]: Without dead ends: 64678 [2019-12-27 15:52:12,597 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 16 SyntacticMatches, 6 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2019-12-27 15:52:12,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64678 states. [2019-12-27 15:52:13,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64678 to 45455. [2019-12-27 15:52:13,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45455 states. [2019-12-27 15:52:13,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45455 states to 45455 states and 141332 transitions. [2019-12-27 15:52:13,442 INFO L78 Accepts]: Start accepts. Automaton has 45455 states and 141332 transitions. Word has length 65 [2019-12-27 15:52:13,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:52:13,442 INFO L462 AbstractCegarLoop]: Abstraction has 45455 states and 141332 transitions. [2019-12-27 15:52:13,442 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 15:52:13,442 INFO L276 IsEmpty]: Start isEmpty. Operand 45455 states and 141332 transitions. [2019-12-27 15:52:13,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 15:52:13,488 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:52:13,488 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:52:13,489 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:52:13,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:52:13,489 INFO L82 PathProgramCache]: Analyzing trace with hash -25014344, now seen corresponding path program 5 times [2019-12-27 15:52:13,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:52:13,490 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831137448] [2019-12-27 15:52:13,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:52:13,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:52:13,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:52:13,599 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831137448] [2019-12-27 15:52:13,600 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:52:13,600 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 15:52:13,600 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [34653785] [2019-12-27 15:52:13,600 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:52:13,622 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:52:13,862 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 224 states and 412 transitions. [2019-12-27 15:52:13,863 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:52:13,946 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 15:52:13,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 15:52:13,946 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:52:13,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 15:52:13,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-27 15:52:13,947 INFO L87 Difference]: Start difference. First operand 45455 states and 141332 transitions. Second operand 11 states. [2019-12-27 15:52:17,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:52:17,970 INFO L93 Difference]: Finished difference Result 97977 states and 299334 transitions. [2019-12-27 15:52:17,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-12-27 15:52:17,971 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2019-12-27 15:52:17,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:52:18,119 INFO L225 Difference]: With dead ends: 97977 [2019-12-27 15:52:18,120 INFO L226 Difference]: Without dead ends: 97977 [2019-12-27 15:52:18,121 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 35 SyntacticMatches, 7 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 529 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=415, Invalid=1477, Unknown=0, NotChecked=0, Total=1892 [2019-12-27 15:52:18,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97977 states. [2019-12-27 15:52:19,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97977 to 44874. [2019-12-27 15:52:19,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44874 states. [2019-12-27 15:52:19,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44874 states to 44874 states and 139728 transitions. [2019-12-27 15:52:19,360 INFO L78 Accepts]: Start accepts. Automaton has 44874 states and 139728 transitions. Word has length 65 [2019-12-27 15:52:19,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:52:19,360 INFO L462 AbstractCegarLoop]: Abstraction has 44874 states and 139728 transitions. [2019-12-27 15:52:19,360 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 15:52:19,361 INFO L276 IsEmpty]: Start isEmpty. Operand 44874 states and 139728 transitions. [2019-12-27 15:52:19,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 15:52:19,413 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:52:19,413 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:52:19,413 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:52:19,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:52:19,413 INFO L82 PathProgramCache]: Analyzing trace with hash 373916454, now seen corresponding path program 1 times [2019-12-27 15:52:19,414 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:52:19,414 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303360594] [2019-12-27 15:52:19,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:52:19,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:52:19,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:52:19,527 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303360594] [2019-12-27 15:52:19,527 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:52:19,527 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 15:52:19,527 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [244897981] [2019-12-27 15:52:19,527 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:52:19,547 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:52:19,882 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 254 states and 438 transitions. [2019-12-27 15:52:19,882 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:52:19,969 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 15:52:19,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 15:52:19,969 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:52:19,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 15:52:19,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-27 15:52:19,970 INFO L87 Difference]: Start difference. First operand 44874 states and 139728 transitions. Second operand 9 states. [2019-12-27 15:52:22,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:52:22,444 INFO L93 Difference]: Finished difference Result 64485 states and 197131 transitions. [2019-12-27 15:52:22,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 15:52:22,444 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-27 15:52:22,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:52:22,543 INFO L225 Difference]: With dead ends: 64485 [2019-12-27 15:52:22,543 INFO L226 Difference]: Without dead ends: 64485 [2019-12-27 15:52:22,543 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 25 SyntacticMatches, 6 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=161, Invalid=651, Unknown=0, NotChecked=0, Total=812 [2019-12-27 15:52:22,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64485 states. [2019-12-27 15:52:23,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64485 to 46367. [2019-12-27 15:52:23,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46367 states. [2019-12-27 15:52:23,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46367 states to 46367 states and 143981 transitions. [2019-12-27 15:52:23,381 INFO L78 Accepts]: Start accepts. Automaton has 46367 states and 143981 transitions. Word has length 65 [2019-12-27 15:52:23,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:52:23,381 INFO L462 AbstractCegarLoop]: Abstraction has 46367 states and 143981 transitions. [2019-12-27 15:52:23,381 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 15:52:23,382 INFO L276 IsEmpty]: Start isEmpty. Operand 46367 states and 143981 transitions. [2019-12-27 15:52:23,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 15:52:23,429 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:52:23,430 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:52:23,430 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:52:23,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:52:23,430 INFO L82 PathProgramCache]: Analyzing trace with hash 1193547640, now seen corresponding path program 2 times [2019-12-27 15:52:23,430 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:52:23,431 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612320935] [2019-12-27 15:52:23,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:52:23,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:52:23,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:52:23,526 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612320935] [2019-12-27 15:52:23,526 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:52:23,526 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 15:52:23,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [853325234] [2019-12-27 15:52:23,526 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:52:23,546 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:52:23,757 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 198 states and 349 transitions. [2019-12-27 15:52:23,757 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:52:23,845 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 15:52:23,845 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 15:52:23,845 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:52:23,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 15:52:23,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-27 15:52:23,846 INFO L87 Difference]: Start difference. First operand 46367 states and 143981 transitions. Second operand 9 states. [2019-12-27 15:52:26,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:52:26,273 INFO L93 Difference]: Finished difference Result 98911 states and 302252 transitions. [2019-12-27 15:52:26,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-27 15:52:26,274 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-27 15:52:26,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:52:26,443 INFO L225 Difference]: With dead ends: 98911 [2019-12-27 15:52:26,444 INFO L226 Difference]: Without dead ends: 98911 [2019-12-27 15:52:26,444 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 19 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2019-12-27 15:52:26,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98911 states. [2019-12-27 15:52:27,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98911 to 45725. [2019-12-27 15:52:27,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45725 states. [2019-12-27 15:52:27,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45725 states to 45725 states and 142175 transitions. [2019-12-27 15:52:27,995 INFO L78 Accepts]: Start accepts. Automaton has 45725 states and 142175 transitions. Word has length 65 [2019-12-27 15:52:27,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:52:27,996 INFO L462 AbstractCegarLoop]: Abstraction has 45725 states and 142175 transitions. [2019-12-27 15:52:27,996 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 15:52:27,996 INFO L276 IsEmpty]: Start isEmpty. Operand 45725 states and 142175 transitions. [2019-12-27 15:52:28,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 15:52:28,045 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:52:28,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:52:28,045 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:52:28,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:52:28,045 INFO L82 PathProgramCache]: Analyzing trace with hash 1646807062, now seen corresponding path program 3 times [2019-12-27 15:52:28,046 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:52:28,046 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567651438] [2019-12-27 15:52:28,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:52:28,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:52:28,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:52:28,195 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567651438] [2019-12-27 15:52:28,195 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:52:28,195 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 15:52:28,198 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [836287146] [2019-12-27 15:52:28,198 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:52:28,224 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:52:28,474 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 202 states and 338 transitions. [2019-12-27 15:52:28,474 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:52:28,618 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 15:52:28,618 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 15:52:28,619 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:52:28,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 15:52:28,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-12-27 15:52:28,620 INFO L87 Difference]: Start difference. First operand 45725 states and 142175 transitions. Second operand 13 states. [2019-12-27 15:52:35,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:52:35,520 INFO L93 Difference]: Finished difference Result 115795 states and 351711 transitions. [2019-12-27 15:52:35,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-12-27 15:52:35,520 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 65 [2019-12-27 15:52:35,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:52:35,700 INFO L225 Difference]: With dead ends: 115795 [2019-12-27 15:52:35,701 INFO L226 Difference]: Without dead ends: 115795 [2019-12-27 15:52:35,702 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 55 SyntacticMatches, 5 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2252 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=931, Invalid=5549, Unknown=0, NotChecked=0, Total=6480 [2019-12-27 15:52:36,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115795 states. [2019-12-27 15:52:36,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115795 to 42092. [2019-12-27 15:52:36,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42092 states. [2019-12-27 15:52:36,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42092 states to 42092 states and 131563 transitions. [2019-12-27 15:52:36,970 INFO L78 Accepts]: Start accepts. Automaton has 42092 states and 131563 transitions. Word has length 65 [2019-12-27 15:52:36,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:52:36,971 INFO L462 AbstractCegarLoop]: Abstraction has 42092 states and 131563 transitions. [2019-12-27 15:52:36,971 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 15:52:36,971 INFO L276 IsEmpty]: Start isEmpty. Operand 42092 states and 131563 transitions. [2019-12-27 15:52:37,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 15:52:37,018 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:52:37,018 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:52:37,018 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:52:37,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:52:37,019 INFO L82 PathProgramCache]: Analyzing trace with hash 1534293356, now seen corresponding path program 6 times [2019-12-27 15:52:37,019 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:52:37,019 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49497277] [2019-12-27 15:52:37,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:52:37,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:52:37,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:52:37,091 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49497277] [2019-12-27 15:52:37,091 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:52:37,091 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 15:52:37,091 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1007666622] [2019-12-27 15:52:37,092 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:52:37,105 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:52:37,461 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 235 states and 393 transitions. [2019-12-27 15:52:37,462 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:52:37,463 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:52:37,463 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 15:52:37,463 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:52:37,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 15:52:37,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 15:52:37,464 INFO L87 Difference]: Start difference. First operand 42092 states and 131563 transitions. Second operand 4 states. [2019-12-27 15:52:37,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:52:37,822 INFO L93 Difference]: Finished difference Result 42092 states and 131285 transitions. [2019-12-27 15:52:37,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 15:52:37,822 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-27 15:52:37,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:52:37,918 INFO L225 Difference]: With dead ends: 42092 [2019-12-27 15:52:37,919 INFO L226 Difference]: Without dead ends: 42092 [2019-12-27 15:52:37,919 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 15:52:38,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42092 states. [2019-12-27 15:52:39,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42092 to 40189. [2019-12-27 15:52:39,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40189 states. [2019-12-27 15:52:39,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40189 states to 40189 states and 125462 transitions. [2019-12-27 15:52:39,118 INFO L78 Accepts]: Start accepts. Automaton has 40189 states and 125462 transitions. Word has length 65 [2019-12-27 15:52:39,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:52:39,118 INFO L462 AbstractCegarLoop]: Abstraction has 40189 states and 125462 transitions. [2019-12-27 15:52:39,118 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 15:52:39,118 INFO L276 IsEmpty]: Start isEmpty. Operand 40189 states and 125462 transitions. [2019-12-27 15:52:39,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 15:52:39,168 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:52:39,168 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:52:39,168 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:52:39,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:52:39,169 INFO L82 PathProgramCache]: Analyzing trace with hash -1521961444, now seen corresponding path program 4 times [2019-12-27 15:52:39,169 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:52:39,169 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930854175] [2019-12-27 15:52:39,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:52:39,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:52:39,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:52:39,225 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930854175] [2019-12-27 15:52:39,225 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:52:39,225 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:52:39,225 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [181218022] [2019-12-27 15:52:39,226 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:52:39,238 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:52:39,432 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 235 states and 393 transitions. [2019-12-27 15:52:39,432 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:52:39,433 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:52:39,433 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:52:39,433 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:52:39,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:52:39,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:52:39,434 INFO L87 Difference]: Start difference. First operand 40189 states and 125462 transitions. Second operand 3 states. [2019-12-27 15:52:39,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:52:39,569 INFO L93 Difference]: Finished difference Result 40188 states and 125460 transitions. [2019-12-27 15:52:39,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:52:39,570 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 15:52:39,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:52:39,628 INFO L225 Difference]: With dead ends: 40188 [2019-12-27 15:52:39,629 INFO L226 Difference]: Without dead ends: 40188 [2019-12-27 15:52:39,629 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:52:39,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40188 states. [2019-12-27 15:52:40,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40188 to 31629. [2019-12-27 15:52:40,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31629 states. [2019-12-27 15:52:40,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31629 states to 31629 states and 101361 transitions. [2019-12-27 15:52:40,248 INFO L78 Accepts]: Start accepts. Automaton has 31629 states and 101361 transitions. Word has length 65 [2019-12-27 15:52:40,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:52:40,249 INFO L462 AbstractCegarLoop]: Abstraction has 31629 states and 101361 transitions. [2019-12-27 15:52:40,249 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:52:40,249 INFO L276 IsEmpty]: Start isEmpty. Operand 31629 states and 101361 transitions. [2019-12-27 15:52:40,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 15:52:40,287 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:52:40,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, 1, 1] [2019-12-27 15:52:40,287 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:52:40,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:52:40,287 INFO L82 PathProgramCache]: Analyzing trace with hash 392067852, now seen corresponding path program 1 times [2019-12-27 15:52:40,288 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:52:40,288 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468252479] [2019-12-27 15:52:40,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:52:40,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:52:40,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:52:40,355 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468252479] [2019-12-27 15:52:40,355 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:52:40,355 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:52:40,356 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1268854808] [2019-12-27 15:52:40,356 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:52:40,369 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:52:40,634 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 199 states and 348 transitions. [2019-12-27 15:52:40,634 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:52:40,647 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 15:52:40,647 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 15:52:40,648 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:52:40,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 15:52:40,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 15:52:40,648 INFO L87 Difference]: Start difference. First operand 31629 states and 101361 transitions. Second operand 4 states. [2019-12-27 15:52:41,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:52:41,109 INFO L93 Difference]: Finished difference Result 33996 states and 105493 transitions. [2019-12-27 15:52:41,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 15:52:41,110 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-27 15:52:41,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:52:41,181 INFO L225 Difference]: With dead ends: 33996 [2019-12-27 15:52:41,182 INFO L226 Difference]: Without dead ends: 33996 [2019-12-27 15:52:41,183 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 15:52:41,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33996 states. [2019-12-27 15:52:41,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33996 to 23982. [2019-12-27 15:52:41,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23982 states. [2019-12-27 15:52:41,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23982 states to 23982 states and 75006 transitions. [2019-12-27 15:52:41,736 INFO L78 Accepts]: Start accepts. Automaton has 23982 states and 75006 transitions. Word has length 66 [2019-12-27 15:52:41,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:52:41,737 INFO L462 AbstractCegarLoop]: Abstraction has 23982 states and 75006 transitions. [2019-12-27 15:52:41,737 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 15:52:41,737 INFO L276 IsEmpty]: Start isEmpty. Operand 23982 states and 75006 transitions. [2019-12-27 15:52:41,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 15:52:41,769 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:52:41,769 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:52:41,769 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:52:41,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:52:41,770 INFO L82 PathProgramCache]: Analyzing trace with hash 2062742571, now seen corresponding path program 1 times [2019-12-27 15:52:41,770 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:52:41,770 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968083703] [2019-12-27 15:52:41,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:52:41,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:52:41,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:52:41,878 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968083703] [2019-12-27 15:52:41,878 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:52:41,878 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 15:52:41,878 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1226547690] [2019-12-27 15:52:41,878 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:52:41,891 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:52:42,285 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 217 states and 395 transitions. [2019-12-27 15:52:42,285 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:52:42,478 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 14 times. [2019-12-27 15:52:42,479 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 15:52:42,479 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:52:42,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 15:52:42,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-12-27 15:52:42,480 INFO L87 Difference]: Start difference. First operand 23982 states and 75006 transitions. Second operand 11 states. [2019-12-27 15:52:44,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:52:44,110 INFO L93 Difference]: Finished difference Result 45868 states and 141792 transitions. [2019-12-27 15:52:44,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 15:52:44,110 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-27 15:52:44,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:52:44,162 INFO L225 Difference]: With dead ends: 45868 [2019-12-27 15:52:44,163 INFO L226 Difference]: Without dead ends: 37492 [2019-12-27 15:52:44,163 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 11 SyntacticMatches, 7 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=131, Invalid=469, Unknown=0, NotChecked=0, Total=600 [2019-12-27 15:52:44,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37492 states. [2019-12-27 15:52:44,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37492 to 24694. [2019-12-27 15:52:44,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24694 states. [2019-12-27 15:52:44,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24694 states to 24694 states and 76801 transitions. [2019-12-27 15:52:44,653 INFO L78 Accepts]: Start accepts. Automaton has 24694 states and 76801 transitions. Word has length 67 [2019-12-27 15:52:44,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:52:44,654 INFO L462 AbstractCegarLoop]: Abstraction has 24694 states and 76801 transitions. [2019-12-27 15:52:44,654 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 15:52:44,654 INFO L276 IsEmpty]: Start isEmpty. Operand 24694 states and 76801 transitions. [2019-12-27 15:52:44,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 15:52:44,683 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:52:44,683 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:52:44,683 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:52:44,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:52:44,683 INFO L82 PathProgramCache]: Analyzing trace with hash 1535531457, now seen corresponding path program 2 times [2019-12-27 15:52:44,684 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:52:44,684 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323974087] [2019-12-27 15:52:44,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:52:44,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:52:44,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-27 15:52:44,947 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323974087] [2019-12-27 15:52:44,947 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:52:44,947 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 15:52:44,947 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [253552920] [2019-12-27 15:52:44,948 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:52:44,968 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:52:45,262 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 253 states and 490 transitions. [2019-12-27 15:52:45,262 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:52:45,375 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 15:52:45,376 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 15:52:45,376 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:52:45,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 15:52:45,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-12-27 15:52:45,377 INFO L87 Difference]: Start difference. First operand 24694 states and 76801 transitions. Second operand 11 states. [2019-12-27 15:52:48,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:52:48,800 INFO L93 Difference]: Finished difference Result 58065 states and 178321 transitions. [2019-12-27 15:52:48,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-12-27 15:52:48,800 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-27 15:52:48,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:52:48,877 INFO L225 Difference]: With dead ends: 58065 [2019-12-27 15:52:48,877 INFO L226 Difference]: Without dead ends: 52720 [2019-12-27 15:52:48,878 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 828 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=513, Invalid=2243, Unknown=0, NotChecked=0, Total=2756 [2019-12-27 15:52:49,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52720 states. [2019-12-27 15:52:49,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52720 to 30173. [2019-12-27 15:52:49,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30173 states. [2019-12-27 15:52:49,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30173 states to 30173 states and 93726 transitions. [2019-12-27 15:52:49,701 INFO L78 Accepts]: Start accepts. Automaton has 30173 states and 93726 transitions. Word has length 67 [2019-12-27 15:52:49,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:52:49,701 INFO L462 AbstractCegarLoop]: Abstraction has 30173 states and 93726 transitions. [2019-12-27 15:52:49,701 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 15:52:49,701 INFO L276 IsEmpty]: Start isEmpty. Operand 30173 states and 93726 transitions. [2019-12-27 15:52:49,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 15:52:49,737 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:52:49,737 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:52:49,737 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:52:49,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:52:49,737 INFO L82 PathProgramCache]: Analyzing trace with hash 1442171729, now seen corresponding path program 3 times [2019-12-27 15:52:49,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:52:49,738 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309045577] [2019-12-27 15:52:49,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:52:49,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:52:49,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:52:49,876 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309045577] [2019-12-27 15:52:49,876 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:52:49,876 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 15:52:49,876 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1453611933] [2019-12-27 15:52:49,876 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:52:49,889 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:52:50,143 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 314 states and 639 transitions. [2019-12-27 15:52:50,144 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:52:50,308 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 17 times. [2019-12-27 15:52:50,309 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 15:52:50,309 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:52:50,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 15:52:50,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-12-27 15:52:50,310 INFO L87 Difference]: Start difference. First operand 30173 states and 93726 transitions. Second operand 12 states. [2019-12-27 15:52:53,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:52:53,797 INFO L93 Difference]: Finished difference Result 62756 states and 192133 transitions. [2019-12-27 15:52:53,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-12-27 15:52:53,798 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-27 15:52:53,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:52:53,876 INFO L225 Difference]: With dead ends: 62756 [2019-12-27 15:52:53,877 INFO L226 Difference]: Without dead ends: 53915 [2019-12-27 15:52:53,878 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 10 SyntacticMatches, 6 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 739 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=522, Invalid=2028, Unknown=0, NotChecked=0, Total=2550 [2019-12-27 15:52:54,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53915 states. [2019-12-27 15:52:54,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53915 to 24567. [2019-12-27 15:52:54,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24567 states. [2019-12-27 15:52:54,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24567 states to 24567 states and 76097 transitions. [2019-12-27 15:52:54,863 INFO L78 Accepts]: Start accepts. Automaton has 24567 states and 76097 transitions. Word has length 67 [2019-12-27 15:52:54,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:52:54,863 INFO L462 AbstractCegarLoop]: Abstraction has 24567 states and 76097 transitions. [2019-12-27 15:52:54,863 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 15:52:54,864 INFO L276 IsEmpty]: Start isEmpty. Operand 24567 states and 76097 transitions. [2019-12-27 15:52:54,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 15:52:54,895 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:52:54,895 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:52:54,895 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:52:54,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:52:54,896 INFO L82 PathProgramCache]: Analyzing trace with hash -2065446981, now seen corresponding path program 4 times [2019-12-27 15:52:54,896 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:52:54,897 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589424037] [2019-12-27 15:52:54,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:52:54,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:52:55,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:52:55,072 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589424037] [2019-12-27 15:52:55,072 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:52:55,073 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 15:52:55,073 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [453276119] [2019-12-27 15:52:55,073 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:52:55,086 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:52:55,298 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 259 states and 513 transitions. [2019-12-27 15:52:55,298 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:52:55,460 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 14 times. [2019-12-27 15:52:55,461 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 15:52:55,461 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:52:55,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 15:52:55,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-27 15:52:55,461 INFO L87 Difference]: Start difference. First operand 24567 states and 76097 transitions. Second operand 12 states. [2019-12-27 15:53:00,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:53:00,462 INFO L93 Difference]: Finished difference Result 64547 states and 196788 transitions. [2019-12-27 15:53:00,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-12-27 15:53:00,463 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-27 15:53:00,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:53:00,547 INFO L225 Difference]: With dead ends: 64547 [2019-12-27 15:53:00,547 INFO L226 Difference]: Without dead ends: 59202 [2019-12-27 15:53:00,548 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 8 SyntacticMatches, 8 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1292 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=575, Invalid=3457, Unknown=0, NotChecked=0, Total=4032 [2019-12-27 15:53:00,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59202 states. [2019-12-27 15:53:01,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59202 to 29877. [2019-12-27 15:53:01,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29877 states. [2019-12-27 15:53:01,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29877 states to 29877 states and 92633 transitions. [2019-12-27 15:53:01,267 INFO L78 Accepts]: Start accepts. Automaton has 29877 states and 92633 transitions. Word has length 67 [2019-12-27 15:53:01,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:53:01,268 INFO L462 AbstractCegarLoop]: Abstraction has 29877 states and 92633 transitions. [2019-12-27 15:53:01,268 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 15:53:01,268 INFO L276 IsEmpty]: Start isEmpty. Operand 29877 states and 92633 transitions. [2019-12-27 15:53:01,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 15:53:01,300 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:53:01,300 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:53:01,301 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:53:01,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:53:01,301 INFO L82 PathProgramCache]: Analyzing trace with hash 2136160587, now seen corresponding path program 5 times [2019-12-27 15:53:01,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:53:01,302 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729028173] [2019-12-27 15:53:01,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:53:01,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:53:01,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:53:01,689 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729028173] [2019-12-27 15:53:01,689 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:53:01,689 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-27 15:53:01,689 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1204811436] [2019-12-27 15:53:01,689 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:53:01,698 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:53:02,135 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 320 states and 662 transitions. [2019-12-27 15:53:02,135 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:53:02,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-27 15:53:02,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 15:53:03,023 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 54 times. [2019-12-27 15:53:03,023 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-27 15:53:03,023 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:53:03,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-27 15:53:03,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=371, Unknown=0, NotChecked=0, Total=420 [2019-12-27 15:53:03,024 INFO L87 Difference]: Start difference. First operand 29877 states and 92633 transitions. Second operand 21 states. [2019-12-27 15:53:10,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:53:10,039 INFO L93 Difference]: Finished difference Result 50180 states and 152554 transitions. [2019-12-27 15:53:10,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-12-27 15:53:10,039 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 67 [2019-12-27 15:53:10,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:53:10,106 INFO L225 Difference]: With dead ends: 50180 [2019-12-27 15:53:10,106 INFO L226 Difference]: Without dead ends: 48672 [2019-12-27 15:53:10,107 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 29 SyntacticMatches, 26 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 893 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=449, Invalid=3211, Unknown=0, NotChecked=0, Total=3660 [2019-12-27 15:53:10,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48672 states. [2019-12-27 15:53:10,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48672 to 29516. [2019-12-27 15:53:10,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29516 states. [2019-12-27 15:53:10,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29516 states to 29516 states and 91171 transitions. [2019-12-27 15:53:10,722 INFO L78 Accepts]: Start accepts. Automaton has 29516 states and 91171 transitions. Word has length 67 [2019-12-27 15:53:10,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:53:10,722 INFO L462 AbstractCegarLoop]: Abstraction has 29516 states and 91171 transitions. [2019-12-27 15:53:10,723 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-27 15:53:10,723 INFO L276 IsEmpty]: Start isEmpty. Operand 29516 states and 91171 transitions. [2019-12-27 15:53:10,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 15:53:10,754 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:53:10,754 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:53:10,755 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:53:10,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:53:10,755 INFO L82 PathProgramCache]: Analyzing trace with hash -1152147351, now seen corresponding path program 6 times [2019-12-27 15:53:10,755 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:53:10,755 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994703570] [2019-12-27 15:53:10,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:53:10,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:53:10,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:53:10,902 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994703570] [2019-12-27 15:53:10,902 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:53:10,902 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 15:53:10,902 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1050651495] [2019-12-27 15:53:10,902 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:53:11,054 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:53:11,256 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 277 states and 552 transitions. [2019-12-27 15:53:11,256 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:53:11,447 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 18 times. [2019-12-27 15:53:11,448 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 15:53:11,448 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:53:11,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 15:53:11,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-12-27 15:53:11,448 INFO L87 Difference]: Start difference. First operand 29516 states and 91171 transitions. Second operand 13 states. [2019-12-27 15:53:17,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:53:17,119 INFO L93 Difference]: Finished difference Result 73509 states and 222760 transitions. [2019-12-27 15:53:17,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-12-27 15:53:17,119 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 67 [2019-12-27 15:53:17,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:53:17,218 INFO L225 Difference]: With dead ends: 73509 [2019-12-27 15:53:17,218 INFO L226 Difference]: Without dead ends: 65385 [2019-12-27 15:53:17,219 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 15 SyntacticMatches, 8 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1474 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=760, Invalid=3796, Unknown=0, NotChecked=0, Total=4556 [2019-12-27 15:53:17,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65385 states. [2019-12-27 15:53:17,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65385 to 24278. [2019-12-27 15:53:17,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24278 states. [2019-12-27 15:53:17,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24278 states to 24278 states and 74738 transitions. [2019-12-27 15:53:17,951 INFO L78 Accepts]: Start accepts. Automaton has 24278 states and 74738 transitions. Word has length 67 [2019-12-27 15:53:17,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:53:17,951 INFO L462 AbstractCegarLoop]: Abstraction has 24278 states and 74738 transitions. [2019-12-27 15:53:17,951 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 15:53:17,951 INFO L276 IsEmpty]: Start isEmpty. Operand 24278 states and 74738 transitions. [2019-12-27 15:53:17,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 15:53:17,976 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:53:17,976 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:53:17,976 INFO L410 AbstractCegarLoop]: === Iteration 37 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:53:17,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:53:17,976 INFO L82 PathProgramCache]: Analyzing trace with hash -1853423759, now seen corresponding path program 7 times [2019-12-27 15:53:17,977 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:53:17,977 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629613772] [2019-12-27 15:53:17,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:53:17,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:53:18,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:53:18,146 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629613772] [2019-12-27 15:53:18,146 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:53:18,146 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 15:53:18,147 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [986711991] [2019-12-27 15:53:18,147 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:53:18,160 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:53:18,518 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 259 states and 498 transitions. [2019-12-27 15:53:18,518 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:53:18,713 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 24 times. [2019-12-27 15:53:18,713 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 15:53:18,713 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:53:18,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 15:53:18,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-12-27 15:53:18,714 INFO L87 Difference]: Start difference. First operand 24278 states and 74738 transitions. Second operand 14 states. [2019-12-27 15:53:21,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:53:21,273 INFO L93 Difference]: Finished difference Result 34768 states and 105541 transitions. [2019-12-27 15:53:21,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 15:53:21,273 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 67 [2019-12-27 15:53:21,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:53:21,319 INFO L225 Difference]: With dead ends: 34768 [2019-12-27 15:53:21,319 INFO L226 Difference]: Without dead ends: 34521 [2019-12-27 15:53:21,319 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 14 SyntacticMatches, 10 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=138, Invalid=618, Unknown=0, NotChecked=0, Total=756 [2019-12-27 15:53:21,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34521 states. [2019-12-27 15:53:21,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34521 to 24102. [2019-12-27 15:53:21,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24102 states. [2019-12-27 15:53:21,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24102 states to 24102 states and 74282 transitions. [2019-12-27 15:53:21,766 INFO L78 Accepts]: Start accepts. Automaton has 24102 states and 74282 transitions. Word has length 67 [2019-12-27 15:53:21,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:53:21,766 INFO L462 AbstractCegarLoop]: Abstraction has 24102 states and 74282 transitions. [2019-12-27 15:53:21,766 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 15:53:21,766 INFO L276 IsEmpty]: Start isEmpty. Operand 24102 states and 74282 transitions. [2019-12-27 15:53:21,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 15:53:21,793 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:53:21,793 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:53:21,793 INFO L410 AbstractCegarLoop]: === Iteration 38 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:53:21,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:53:21,793 INFO L82 PathProgramCache]: Analyzing trace with hash 594227727, now seen corresponding path program 8 times [2019-12-27 15:53:21,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:53:21,794 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060751971] [2019-12-27 15:53:21,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:53:21,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 15:53:21,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 15:53:21,891 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 15:53:21,891 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 15:53:21,895 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [903] [903] ULTIMATE.startENTRY-->L837: Formula: (let ((.cse0 (store |v_#valid_65| 0 0))) (and (= v_~x~0_45 0) (= 0 v_~a$w_buff0_used~0_768) (= v_~y~0_18 0) (= 0 v_~a$r_buff1_thd1~0_150) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t257~0.base_33|) (= 0 v_~__unbuffered_p2_EAX~0_31) (= 0 v_~a$read_delayed_var~0.base_7) (= 0 v_~a$w_buff1_used~0_426) (= v_~main$tmp_guard0~0_29 0) (= v_~a$read_delayed_var~0.offset_7 0) (= 0 v_~a$w_buff1~0_200) (= v_~a$r_buff1_thd3~0_269 0) (< 0 |v_#StackHeapBarrier_16|) (= 0 v_~__unbuffered_p0_EAX~0_111) (= v_~a$r_buff0_thd3~0_320 0) (= v_~a~0_184 0) (= 0 |v_ULTIMATE.start_main_~#t257~0.offset_23|) (= 0 v_~__unbuffered_p1_EAX~0_34) (= v_~__unbuffered_cnt~0_102 0) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t257~0.base_33| 4) |v_#length_21|) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t257~0.base_33|)) (= 0 |v_#NULL.base_4|) (= v_~a$flush_delayed~0_25 0) (= v_~__unbuffered_p1_EBX~0_34 0) (= v_~a$r_buff0_thd0~0_107 0) (= v_~main$tmp_guard1~0_32 0) (= v_~a$r_buff1_thd0~0_160 0) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t257~0.base_33| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t257~0.base_33|) |v_ULTIMATE.start_main_~#t257~0.offset_23| 0)) |v_#memory_int_19|) (= v_~a$w_buff0~0_274 0) (= v_~z~0_21 0) (= |v_#NULL.offset_4| 0) (= v_~a$mem_tmp~0_14 0) (= 0 v_~a$r_buff0_thd1~0_184) (= 0 v_~a$r_buff1_thd2~0_145) (= v_~a$r_buff0_thd2~0_95 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t257~0.base_33| 1) |v_#valid_63|) (= v_~weak$$choice2~0_110 0) (= v_~__unbuffered_p2_EBX~0_40 0) (= 0 v_~a$read_delayed~0_8) (= 0 v_~weak$$choice0~0_12))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_65|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t258~0.offset=|v_ULTIMATE.start_main_~#t258~0.offset_19|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_145, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_67|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_471|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_107, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_41|, ~a~0=v_~a~0_184, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_64|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_111, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_34, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_31, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_40, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_10|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_269, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_768, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_184, ~weak$$choice0~0=v_~weak$$choice0~0_12, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_7, ~a$w_buff0~0=v_~a$w_buff0~0_274, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_160, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_102, ~x~0=v_~x~0_45, ULTIMATE.start_main_~#t259~0.base=|v_ULTIMATE.start_main_~#t259~0.base_25|, ~a$read_delayed~0=v_~a$read_delayed~0_8, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_95, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_32, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_69|, ULTIMATE.start_main_~#t257~0.offset=|v_ULTIMATE.start_main_~#t257~0.offset_23|, ~a$mem_tmp~0=v_~a$mem_tmp~0_14, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_29|, ~a$w_buff1~0=v_~a$w_buff1~0_200, ~y~0=v_~y~0_18, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_34, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_27|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_150, ULTIMATE.start_main_~#t257~0.base=|v_ULTIMATE.start_main_~#t257~0.base_33|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_320, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_29, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_~#t258~0.base=|v_ULTIMATE.start_main_~#t258~0.base_25|, ~a$flush_delayed~0=v_~a$flush_delayed~0_25, ULTIMATE.start_main_~#t259~0.offset=|v_ULTIMATE.start_main_~#t259~0.offset_19|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, #valid=|v_#valid_63|, #memory_int=|v_#memory_int_19|, ~z~0=v_~z~0_21, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_426, ~weak$$choice2~0=v_~weak$$choice2~0_110, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t258~0.offset, ~a$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ~a$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite50, ~a~0, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~weak$$choice0~0, ~a$read_delayed_var~0.offset, ~a$w_buff0~0, ~a$r_buff1_thd0~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t259~0.base, ~a$read_delayed~0, ~a$r_buff0_thd2~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_~#t257~0.offset, ~a$mem_tmp~0, ULTIMATE.start_main_#t~ite51, ~a$w_buff1~0, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ~a$r_buff1_thd1~0, ULTIMATE.start_main_~#t257~0.base, ~a$r_buff0_thd3~0, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_~#t258~0.base, ~a$flush_delayed~0, ULTIMATE.start_main_~#t259~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~a$w_buff1_used~0, ~weak$$choice2~0, ~a$read_delayed_var~0.base] because there is no mapped edge [2019-12-27 15:53:21,896 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [802] [802] P0ENTRY-->L4-3: Formula: (and (= v_P0Thread1of1ForFork1_~arg.offset_20 |v_P0Thread1of1ForFork1_#in~arg.offset_20|) (= 1 v_~a$w_buff0_used~0_240) (= (mod v_~a$w_buff1_used~0_130 256) 0) (= v_~a$w_buff0_used~0_241 v_~a$w_buff1_used~0_130) (= v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_24 |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression_20|) (= |v_P0Thread1of1ForFork1_#in~arg.base_20| v_P0Thread1of1ForFork1_~arg.base_20) (= 1 v_~a$w_buff0~0_55) (= v_~a$w_buff0~0_56 v_~a$w_buff1~0_50) (= 1 |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression_20|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_20|, ~a$w_buff0~0=v_~a$w_buff0~0_56, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_241, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_20|} OutVars{~a$w_buff1~0=v_~a$w_buff1~0_50, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_20|, ~a$w_buff0~0=v_~a$w_buff0~0_55, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_24, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_240, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_20, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_130, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_20|, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression_20|, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_20} AuxVars[] AssignedVars[~a$w_buff1~0, ~a$w_buff0~0, P0Thread1of1ForFork1___VERIFIER_assert_~expression, ~a$w_buff0_used~0, P0Thread1of1ForFork1_~arg.offset, ~a$w_buff1_used~0, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-27 15:53:21,897 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [872] [872] L837-1-->L839: Formula: (and (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t258~0.base_12| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t258~0.base_12|) |v_ULTIMATE.start_main_~#t258~0.offset_10| 1)) |v_#memory_int_13|) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t258~0.base_12|)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t258~0.base_12|) (not (= 0 |v_ULTIMATE.start_main_~#t258~0.base_12|)) (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t258~0.base_12| 1)) (= |v_ULTIMATE.start_main_~#t258~0.offset_10| 0) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t258~0.base_12| 4) |v_#length_15|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t258~0.base=|v_ULTIMATE.start_main_~#t258~0.base_12|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_4|, ULTIMATE.start_main_~#t258~0.offset=|v_ULTIMATE.start_main_~#t258~0.offset_10|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t258~0.base, ULTIMATE.start_main_#t~nondet44, ULTIMATE.start_main_~#t258~0.offset, #valid, #memory_int, #length] because there is no mapped edge [2019-12-27 15:53:21,898 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [871] [871] L839-1-->L841: Formula: (and (= (select |v_#valid_33| |v_ULTIMATE.start_main_~#t259~0.base_12|) 0) (= |v_ULTIMATE.start_main_~#t259~0.offset_10| 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t259~0.base_12| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t259~0.base_12|) |v_ULTIMATE.start_main_~#t259~0.offset_10| 2)) |v_#memory_int_11|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t259~0.base_12|) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t259~0.base_12| 4) |v_#length_13|) (not (= 0 |v_ULTIMATE.start_main_~#t259~0.base_12|)) (= |v_#valid_32| (store |v_#valid_33| |v_ULTIMATE.start_main_~#t259~0.base_12| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t259~0.base=|v_ULTIMATE.start_main_~#t259~0.base_12|, ULTIMATE.start_main_~#t259~0.offset=|v_ULTIMATE.start_main_~#t259~0.offset_10|, #valid=|v_#valid_32|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t259~0.base, ULTIMATE.start_main_~#t259~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length] because there is no mapped edge [2019-12-27 15:53:21,900 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L778-2-->L778-4: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff1_used~0_In-775826450 256))) (.cse1 (= 0 (mod ~a$r_buff1_thd2~0_In-775826450 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite9_Out-775826450| ~a~0_In-775826450) (or .cse0 .cse1)) (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite9_Out-775826450| ~a$w_buff1~0_In-775826450) (not .cse1)))) InVars {~a~0=~a~0_In-775826450, ~a$w_buff1~0=~a$w_buff1~0_In-775826450, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-775826450, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-775826450} OutVars{~a~0=~a~0_In-775826450, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out-775826450|, ~a$w_buff1~0=~a$w_buff1~0_In-775826450, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-775826450, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-775826450} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-27 15:53:21,900 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L778-4-->L779: Formula: (= |v_P1Thread1of1ForFork2_#t~ite9_16| v_~a~0_33) InVars {P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_16|} OutVars{~a~0=v_~a~0_33, P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_15|, P1Thread1of1ForFork2_#t~ite10=|v_P1Thread1of1ForFork2_#t~ite10_23|} AuxVars[] AssignedVars[~a~0, P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-27 15:53:21,900 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L779-->L779-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd2~0_In-576821911 256))) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-576821911 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork2_#t~ite11_Out-576821911|)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite11_Out-576821911| ~a$w_buff0_used~0_In-576821911)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-576821911, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-576821911} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-576821911, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-576821911, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out-576821911|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 15:53:21,902 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L753-->L753-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd1~0_In-514955518 256) 0)) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In-514955518 256)))) (or (and (not .cse0) (= |P0Thread1of1ForFork1_#t~ite5_Out-514955518| 0) (not .cse1)) (and (or .cse1 .cse0) (= ~a$w_buff0_used~0_In-514955518 |P0Thread1of1ForFork1_#t~ite5_Out-514955518|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-514955518, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-514955518} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out-514955518|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-514955518, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-514955518} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-27 15:53:21,902 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L754-->L754-2: Formula: (let ((.cse0 (= (mod ~a$w_buff1_used~0_In-496851787 256) 0)) (.cse1 (= (mod ~a$r_buff1_thd1~0_In-496851787 256) 0)) (.cse2 (= (mod ~a$w_buff0_used~0_In-496851787 256) 0)) (.cse3 (= (mod ~a$r_buff0_thd1~0_In-496851787 256) 0))) (or (and (= ~a$w_buff1_used~0_In-496851787 |P0Thread1of1ForFork1_#t~ite6_Out-496851787|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork1_#t~ite6_Out-496851787|)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-496851787, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-496851787, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-496851787, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-496851787} OutVars{P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-496851787|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-496851787, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-496851787, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-496851787, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-496851787} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-27 15:53:21,903 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L755-->L756: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd1~0_In910316702 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In910316702 256)))) (or (and (not .cse0) (= 0 ~a$r_buff0_thd1~0_Out910316702) (not .cse1)) (and (= ~a$r_buff0_thd1~0_In910316702 ~a$r_buff0_thd1~0_Out910316702) (or .cse0 .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In910316702, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In910316702} OutVars{P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out910316702|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In910316702, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out910316702} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 15:53:21,903 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L756-->L756-2: Formula: (let ((.cse3 (= (mod ~a$r_buff1_thd1~0_In-1368787472 256) 0)) (.cse2 (= (mod ~a$w_buff1_used~0_In-1368787472 256) 0)) (.cse1 (= 0 (mod ~a$r_buff0_thd1~0_In-1368787472 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In-1368787472 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork1_#t~ite8_Out-1368787472| ~a$r_buff1_thd1~0_In-1368787472)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |P0Thread1of1ForFork1_#t~ite8_Out-1368787472|)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1368787472, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1368787472, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1368787472, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1368787472} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-1368787472|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1368787472, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1368787472, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1368787472, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1368787472} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 15:53:21,904 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [867] [867] L756-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~a$r_buff1_thd1~0_72 |v_P0Thread1of1ForFork1_#t~ite8_50|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_63 1) v_~__unbuffered_cnt~0_62)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_50|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_49|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_72, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~a$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 15:53:21,904 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L803-->L803-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1675930239 256)))) (or (and (= ~a$w_buff0~0_In-1675930239 |P2Thread1of1ForFork0_#t~ite21_Out-1675930239|) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite20_In-1675930239| |P2Thread1of1ForFork0_#t~ite20_Out-1675930239|)) (and (= |P2Thread1of1ForFork0_#t~ite20_Out-1675930239| ~a$w_buff0~0_In-1675930239) (= |P2Thread1of1ForFork0_#t~ite20_Out-1675930239| |P2Thread1of1ForFork0_#t~ite21_Out-1675930239|) .cse0 (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In-1675930239 256)))) (or (and (= 0 (mod ~a$r_buff1_thd3~0_In-1675930239 256)) .cse1) (and (= (mod ~a$w_buff1_used~0_In-1675930239 256) 0) .cse1) (= (mod ~a$w_buff0_used~0_In-1675930239 256) 0)))))) InVars {~a$w_buff0~0=~a$w_buff0~0_In-1675930239, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1675930239, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1675930239, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1675930239, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1675930239, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_In-1675930239|, ~weak$$choice2~0=~weak$$choice2~0_In-1675930239} OutVars{P2Thread1of1ForFork0_#t~ite21=|P2Thread1of1ForFork0_#t~ite21_Out-1675930239|, ~a$w_buff0~0=~a$w_buff0~0_In-1675930239, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1675930239, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1675930239, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1675930239, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_Out-1675930239|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1675930239, ~weak$$choice2~0=~weak$$choice2~0_In-1675930239} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite20] because there is no mapped edge [2019-12-27 15:53:21,906 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [881] [881] L805-->L805-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In775470744 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite27_Out775470744| ~a$w_buff0_used~0_In775470744) (= |P2Thread1of1ForFork0_#t~ite26_In775470744| |P2Thread1of1ForFork0_#t~ite26_Out775470744|)) (and (= |P2Thread1of1ForFork0_#t~ite27_Out775470744| |P2Thread1of1ForFork0_#t~ite26_Out775470744|) (= |P2Thread1of1ForFork0_#t~ite26_Out775470744| ~a$w_buff0_used~0_In775470744) (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In775470744 256) 0))) (or (and (= 0 (mod ~a$w_buff1_used~0_In775470744 256)) .cse1) (and .cse1 (= (mod ~a$r_buff1_thd3~0_In775470744 256) 0)) (= (mod ~a$w_buff0_used~0_In775470744 256) 0))) .cse0))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In775470744|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In775470744, ~a$w_buff0_used~0=~a$w_buff0_used~0_In775470744, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In775470744, ~a$w_buff1_used~0=~a$w_buff1_used~0_In775470744, ~weak$$choice2~0=~weak$$choice2~0_In775470744} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out775470744|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out775470744|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In775470744, ~a$w_buff0_used~0=~a$w_buff0_used~0_In775470744, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In775470744, ~a$w_buff1_used~0=~a$w_buff1_used~0_In775470744, ~weak$$choice2~0=~weak$$choice2~0_In775470744} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-27 15:53:21,907 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L807-->L808: Formula: (and (= v_~a$r_buff0_thd3~0_61 v_~a$r_buff0_thd3~0_60) (not (= 0 (mod v_~weak$$choice2~0_15 256)))) InVars {~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_61, ~weak$$choice2~0=v_~weak$$choice2~0_15} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_7|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_7|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_60, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_7|, ~weak$$choice2~0=v_~weak$$choice2~0_15} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~a$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 15:53:21,909 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L810-->L814: Formula: (and (not (= (mod v_~a$flush_delayed~0_7 256) 0)) (= v_~a~0_20 v_~a$mem_tmp~0_4) (= v_~a$flush_delayed~0_6 0)) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_4, ~a$flush_delayed~0=v_~a$flush_delayed~0_7} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~a~0=v_~a~0_20, ~a$mem_tmp~0=v_~a$mem_tmp~0_4, ~a$flush_delayed~0=v_~a$flush_delayed~0_6} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~a~0, ~a$flush_delayed~0] because there is no mapped edge [2019-12-27 15:53:21,909 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L814-2-->L814-5: Formula: (let ((.cse0 (= |P2Thread1of1ForFork0_#t~ite38_Out-849867830| |P2Thread1of1ForFork0_#t~ite39_Out-849867830|)) (.cse2 (= (mod ~a$r_buff1_thd3~0_In-849867830 256) 0)) (.cse1 (= (mod ~a$w_buff1_used~0_In-849867830 256) 0))) (or (and .cse0 (or .cse1 .cse2) (= |P2Thread1of1ForFork0_#t~ite38_Out-849867830| ~a~0_In-849867830)) (and (= |P2Thread1of1ForFork0_#t~ite38_Out-849867830| ~a$w_buff1~0_In-849867830) .cse0 (not .cse2) (not .cse1)))) InVars {~a~0=~a~0_In-849867830, ~a$w_buff1~0=~a$w_buff1~0_In-849867830, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-849867830, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-849867830} OutVars{~a~0=~a~0_In-849867830, P2Thread1of1ForFork0_#t~ite39=|P2Thread1of1ForFork0_#t~ite39_Out-849867830|, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out-849867830|, ~a$w_buff1~0=~a$w_buff1~0_In-849867830, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-849867830, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-849867830} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 15:53:21,910 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L815-->L815-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In272174321 256) 0)) (.cse0 (= (mod ~a$w_buff0_used~0_In272174321 256) 0))) (or (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In272174321 |P2Thread1of1ForFork0_#t~ite40_Out272174321|)) (and (= |P2Thread1of1ForFork0_#t~ite40_Out272174321| 0) (not .cse1) (not .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In272174321, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In272174321} OutVars{P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out272174321|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In272174321, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In272174321} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-27 15:53:21,911 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L816-->L816-2: Formula: (let ((.cse3 (= (mod ~a$w_buff1_used~0_In1015163788 256) 0)) (.cse2 (= 0 (mod ~a$r_buff1_thd3~0_In1015163788 256))) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In1015163788 256))) (.cse0 (= (mod ~a$r_buff0_thd3~0_In1015163788 256) 0))) (or (and (= ~a$w_buff1_used~0_In1015163788 |P2Thread1of1ForFork0_#t~ite41_Out1015163788|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |P2Thread1of1ForFork0_#t~ite41_Out1015163788|)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1015163788, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1015163788, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1015163788, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1015163788} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1015163788, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1015163788, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1015163788, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1015163788, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out1015163788|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-27 15:53:21,912 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L780-->L780-2: Formula: (let ((.cse3 (= 0 (mod ~a$w_buff0_used~0_In-1820935429 256))) (.cse2 (= 0 (mod ~a$r_buff0_thd2~0_In-1820935429 256))) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In-1820935429 256))) (.cse1 (= (mod ~a$r_buff1_thd2~0_In-1820935429 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork2_#t~ite12_Out-1820935429| ~a$w_buff1_used~0_In-1820935429)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= 0 |P1Thread1of1ForFork2_#t~ite12_Out-1820935429|)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1820935429, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1820935429, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1820935429, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1820935429} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1820935429, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1820935429, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1820935429, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-1820935429|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1820935429} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-27 15:53:21,913 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [851] [851] L781-->L781-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In-1540672662 256))) (.cse0 (= (mod ~a$w_buff0_used~0_In-1540672662 256) 0))) (or (and (= ~a$r_buff0_thd2~0_In-1540672662 |P1Thread1of1ForFork2_#t~ite13_Out-1540672662|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |P1Thread1of1ForFork2_#t~ite13_Out-1540672662|) (not .cse0)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1540672662, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1540672662} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1540672662, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1540672662, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out-1540672662|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-27 15:53:21,913 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [852] [852] L782-->L782-2: Formula: (let ((.cse3 (= 0 (mod ~a$w_buff1_used~0_In79179452 256))) (.cse2 (= 0 (mod ~a$r_buff1_thd2~0_In79179452 256))) (.cse0 (= (mod ~a$w_buff0_used~0_In79179452 256) 0)) (.cse1 (= (mod ~a$r_buff0_thd2~0_In79179452 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork2_#t~ite14_Out79179452| 0)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite14_Out79179452| ~a$r_buff1_thd2~0_In79179452)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In79179452, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In79179452, ~a$w_buff0_used~0=~a$w_buff0_used~0_In79179452, ~a$w_buff1_used~0=~a$w_buff1_used~0_In79179452} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In79179452, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In79179452, ~a$w_buff0_used~0=~a$w_buff0_used~0_In79179452, ~a$w_buff1_used~0=~a$w_buff1_used~0_In79179452, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out79179452|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 15:53:21,914 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [868] [868] L782-2-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_68 (+ v_~__unbuffered_cnt~0_69 1)) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|) (= |v_P1Thread1of1ForFork2_#t~ite14_36| v_~a$r_buff1_thd2~0_63)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_69, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_36|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_63, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_68, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_35|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~a$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-27 15:53:21,914 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L817-->L817-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In862755262 256) 0)) (.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In862755262 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite42_Out862755262| 0) (not .cse1)) (and (= |P2Thread1of1ForFork0_#t~ite42_Out862755262| ~a$r_buff0_thd3~0_In862755262) (or .cse0 .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In862755262, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In862755262} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In862755262, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In862755262, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out862755262|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-27 15:53:21,915 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L818-->L818-2: Formula: (let ((.cse1 (= (mod ~a$r_buff1_thd3~0_In-1745997577 256) 0)) (.cse0 (= (mod ~a$w_buff1_used~0_In-1745997577 256) 0)) (.cse3 (= (mod ~a$w_buff0_used~0_In-1745997577 256) 0)) (.cse2 (= (mod ~a$r_buff0_thd3~0_In-1745997577 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~a$r_buff1_thd3~0_In-1745997577 |P2Thread1of1ForFork0_#t~ite43_Out-1745997577|)) (and (= 0 |P2Thread1of1ForFork0_#t~ite43_Out-1745997577|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1745997577, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1745997577, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1745997577, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1745997577} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out-1745997577|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1745997577, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1745997577, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1745997577, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1745997577} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-27 15:53:21,915 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L818-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= v_~a$r_buff1_thd3~0_149 |v_P2Thread1of1ForFork0_#t~ite43_38|) (= v_~__unbuffered_cnt~0_78 (+ v_~__unbuffered_cnt~0_79 1)) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_79} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_37|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_149, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_78, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~a$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-27 15:53:21,915 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [801] [801] L841-1-->L847: Formula: (and (= 3 v_~__unbuffered_cnt~0_40) (= v_~main$tmp_guard0~0_9 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 15:53:21,916 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L847-2-->L847-4: Formula: (let ((.cse1 (= (mod ~a$r_buff1_thd0~0_In859145994 256) 0)) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In859145994 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite47_Out859145994| ~a~0_In859145994)) (and (= |ULTIMATE.start_main_#t~ite47_Out859145994| ~a$w_buff1~0_In859145994) (not .cse1) (not .cse0)))) InVars {~a~0=~a~0_In859145994, ~a$w_buff1~0=~a$w_buff1~0_In859145994, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In859145994, ~a$w_buff1_used~0=~a$w_buff1_used~0_In859145994} OutVars{~a~0=~a~0_In859145994, ~a$w_buff1~0=~a$w_buff1~0_In859145994, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out859145994|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In859145994, ~a$w_buff1_used~0=~a$w_buff1_used~0_In859145994} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-27 15:53:21,916 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L847-4-->L848: Formula: (= v_~a~0_39 |v_ULTIMATE.start_main_#t~ite47_15|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_15|} OutVars{~a~0=v_~a~0_39, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_14|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_6|} AuxVars[] AssignedVars[~a~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 15:53:21,916 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L848-->L848-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In-334631047 256) 0)) (.cse1 (= (mod ~a$r_buff0_thd0~0_In-334631047 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite49_Out-334631047| 0)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite49_Out-334631047| ~a$w_buff0_used~0_In-334631047)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-334631047, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-334631047} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-334631047, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-334631047|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-334631047} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 15:53:21,917 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L849-->L849-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In-1460893707 256) 0)) (.cse0 (= (mod ~a$r_buff0_thd0~0_In-1460893707 256) 0)) (.cse2 (= (mod ~a$w_buff1_used~0_In-1460893707 256) 0)) (.cse3 (= (mod ~a$r_buff1_thd0~0_In-1460893707 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~a$w_buff1_used~0_In-1460893707 |ULTIMATE.start_main_#t~ite50_Out-1460893707|)) (and (= |ULTIMATE.start_main_#t~ite50_Out-1460893707| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1460893707, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1460893707, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1460893707, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1460893707} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-1460893707|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1460893707, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1460893707, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1460893707, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1460893707} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 15:53:21,917 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L850-->L850-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd0~0_In1484633834 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In1484633834 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite51_Out1484633834|) (not .cse1)) (and (or .cse0 .cse1) (= ~a$r_buff0_thd0~0_In1484633834 |ULTIMATE.start_main_#t~ite51_Out1484633834|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1484633834, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1484633834} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out1484633834|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1484633834, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1484633834} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 15:53:21,918 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L851-->L851-2: Formula: (let ((.cse3 (= (mod ~a$w_buff1_used~0_In2131112532 256) 0)) (.cse2 (= (mod ~a$r_buff1_thd0~0_In2131112532 256) 0)) (.cse0 (= (mod ~a$r_buff0_thd0~0_In2131112532 256) 0)) (.cse1 (= (mod ~a$w_buff0_used~0_In2131112532 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~a$r_buff1_thd0~0_In2131112532 |ULTIMATE.start_main_#t~ite52_Out2131112532|)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= 0 |ULTIMATE.start_main_#t~ite52_Out2131112532|)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In2131112532, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2131112532, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In2131112532, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2131112532} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out2131112532|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In2131112532, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2131112532, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In2131112532, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2131112532} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 15:53:21,918 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [887] [887] L851-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 1 v_~__unbuffered_p2_EAX~0_17) (= v_~__unbuffered_p1_EBX~0_17 0) (= 0 v_~__unbuffered_p0_EAX~0_39) (= v_~main$tmp_guard1~0_12 0) (= 1 v_~__unbuffered_p1_EAX~0_17) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= |v_ULTIMATE.start_main_#t~ite52_30| v_~a$r_buff1_thd0~0_75) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12| (mod v_~main$tmp_guard1~0_12 256)) (= v_~__unbuffered_p2_EBX~0_22 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_39, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_30|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_17, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_22, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_17, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_17} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_39, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_29|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_17, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_22, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_17, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_75, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_17, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~a$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 15:53:22,012 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 03:53:22 BasicIcfg [2019-12-27 15:53:22,012 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 15:53:22,014 INFO L168 Benchmark]: Toolchain (without parser) took 191970.45 ms. Allocated memory was 143.1 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 99.5 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-12-27 15:53:22,015 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 143.1 MB. Free memory was 119.5 MB in the beginning and 119.2 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 15:53:22,015 INFO L168 Benchmark]: CACSL2BoogieTranslator took 825.83 ms. Allocated memory was 143.1 MB in the beginning and 199.8 MB in the end (delta: 56.6 MB). Free memory was 99.1 MB in the beginning and 152.8 MB in the end (delta: -53.7 MB). Peak memory consumption was 22.8 MB. Max. memory is 7.1 GB. [2019-12-27 15:53:22,015 INFO L168 Benchmark]: Boogie Procedure Inliner took 73.80 ms. Allocated memory is still 199.8 MB. Free memory was 152.8 MB in the beginning and 150.0 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 15:53:22,016 INFO L168 Benchmark]: Boogie Preprocessor took 41.79 ms. Allocated memory is still 199.8 MB. Free memory was 150.0 MB in the beginning and 147.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-27 15:53:22,016 INFO L168 Benchmark]: RCFGBuilder took 872.33 ms. Allocated memory is still 199.8 MB. Free memory was 147.9 MB in the beginning and 96.9 MB in the end (delta: 51.1 MB). Peak memory consumption was 51.1 MB. Max. memory is 7.1 GB. [2019-12-27 15:53:22,017 INFO L168 Benchmark]: TraceAbstraction took 190151.50 ms. Allocated memory was 199.8 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 96.9 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-12-27 15:53:22,018 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 143.1 MB. Free memory was 119.5 MB in the beginning and 119.2 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 825.83 ms. Allocated memory was 143.1 MB in the beginning and 199.8 MB in the end (delta: 56.6 MB). Free memory was 99.1 MB in the beginning and 152.8 MB in the end (delta: -53.7 MB). Peak memory consumption was 22.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 73.80 ms. Allocated memory is still 199.8 MB. Free memory was 152.8 MB in the beginning and 150.0 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.79 ms. Allocated memory is still 199.8 MB. Free memory was 150.0 MB in the beginning and 147.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 872.33 ms. Allocated memory is still 199.8 MB. Free memory was 147.9 MB in the beginning and 96.9 MB in the end (delta: 51.1 MB). Peak memory consumption was 51.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 190151.50 ms. Allocated memory was 199.8 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 96.9 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.7s, 179 ProgramPointsBefore, 95 ProgramPointsAfterwards, 216 TransitionsBefore, 105 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 8 FixpointIterations, 36 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 31 ChoiceCompositions, 6646 VarBasedMoverChecksPositive, 237 VarBasedMoverChecksNegative, 59 SemBasedMoverChecksPositive, 236 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.5s, 0 MoverChecksTotal, 91218 CheckedPairsTotal, 116 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L837] FCALL, FORK 0 pthread_create(&t257, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L742] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L743] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L744] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L745] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L746] 1 a$r_buff0_thd1 = (_Bool)1 [L749] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L752] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L839] FCALL, FORK 0 pthread_create(&t258, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L766] 2 x = 1 [L769] 2 y = 1 [L772] 2 __unbuffered_p1_EAX = y [L775] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L841] FCALL, FORK 0 pthread_create(&t259, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L778] 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L792] 3 z = 1 [L795] 3 __unbuffered_p2_EAX = z [L798] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L799] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L800] 3 a$flush_delayed = weak$$choice2 [L801] 3 a$mem_tmp = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L802] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) VAL [!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L752] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L753] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L754] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L802] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L803] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L804] EXPR 3 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1))=0, x=1, y=1, z=1] [L804] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L805] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L806] EXPR 3 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L806] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L808] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L808] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L809] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L814] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L814] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L815] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L816] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L779] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L780] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L781] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L817] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L847] 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L848] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L849] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L850] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 170 locations, 2 error locations. Result: UNSAFE, OverallTime: 189.8s, OverallIterations: 38, TraceHistogramMax: 1, AutomataDifference: 91.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 12472 SDtfs, 23284 SDslu, 51595 SDs, 0 SdLazy, 41155 SolverSat, 1552 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 38.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1378 GetRequests, 372 SyntacticMatches, 156 SemanticMatches, 850 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11822 ImplicationChecksByTransitivity, 22.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=168271occurred 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: 53.8s AutomataMinimizationTime, 37 MinimizatonAttempts, 1035460 StatesRemovedByMinimization, 34 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 1978 NumberOfCodeBlocks, 1978 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 1874 ConstructedInterpolants, 0 QuantifiedInterpolants, 449370 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 37 InterpolantComputations, 37 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...