/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/mix011_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 15:51:54,579 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 15:51:54,581 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 15:51:54,597 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 15:51:54,597 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 15:51:54,600 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 15:51:54,602 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 15:51:54,604 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 15:51:54,610 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 15:51:54,611 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 15:51:54,612 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 15:51:54,617 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 15:51:54,617 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 15:51:54,618 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 15:51:54,619 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 15:51:54,620 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 15:51:54,621 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 15:51:54,622 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 15:51:54,623 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 15:51:54,625 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 15:51:54,626 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 15:51:54,627 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 15:51:54,629 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 15:51:54,629 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 15:51:54,631 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 15:51:54,632 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 15:51:54,632 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 15:51:54,633 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 15:51:54,633 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 15:51:54,634 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 15:51:54,634 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 15:51:54,635 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 15:51:54,636 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 15:51:54,637 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 15:51:54,638 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 15:51:54,638 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 15:51:54,638 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 15:51:54,639 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 15:51:54,639 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 15:51:54,640 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 15:51:54,640 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 15:51:54,641 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:51:54,655 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 15:51:54,655 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 15:51:54,656 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 15:51:54,657 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 15:51:54,657 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 15:51:54,657 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 15:51:54,657 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 15:51:54,658 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 15:51:54,658 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 15:51:54,658 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 15:51:54,658 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 15:51:54,658 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 15:51:54,658 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 15:51:54,659 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 15:51:54,659 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 15:51:54,659 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 15:51:54,659 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 15:51:54,659 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 15:51:54,660 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 15:51:54,660 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 15:51:54,660 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 15:51:54,660 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 15:51:54,660 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 15:51:54,661 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 15:51:54,661 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 15:51:54,661 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 15:51:54,661 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 15:51:54,661 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 15:51:54,662 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 15:51:54,662 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 15:51:54,662 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 15:51:54,933 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 15:51:54,947 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 15:51:54,951 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 15:51:54,952 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 15:51:54,953 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 15:51:54,955 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix011_power.oepc.i [2019-12-27 15:51:55,023 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f059ce33a/19891b3046dd4a3391404f4ddd620be7/FLAG15b3bc946 [2019-12-27 15:51:55,602 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 15:51:55,603 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix011_power.oepc.i [2019-12-27 15:51:55,623 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f059ce33a/19891b3046dd4a3391404f4ddd620be7/FLAG15b3bc946 [2019-12-27 15:51:55,864 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f059ce33a/19891b3046dd4a3391404f4ddd620be7 [2019-12-27 15:51:55,873 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 15:51:55,874 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 15:51:55,875 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 15:51:55,876 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 15:51:55,879 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 15:51:55,880 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:51:55" (1/1) ... [2019-12-27 15:51:55,883 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e400b9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:51:55, skipping insertion in model container [2019-12-27 15:51:55,884 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:51:55" (1/1) ... [2019-12-27 15:51:55,892 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 15:51:55,954 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 15:51:56,488 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 15:51:56,500 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 15:51:56,574 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 15:51:56,653 INFO L208 MainTranslator]: Completed translation [2019-12-27 15:51:56,653 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:51:56 WrapperNode [2019-12-27 15:51:56,653 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 15:51:56,654 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 15:51:56,655 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 15:51:56,655 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 15:51:56,663 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:51:56" (1/1) ... [2019-12-27 15:51:56,687 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:51:56" (1/1) ... [2019-12-27 15:51:56,719 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 15:51:56,719 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 15:51:56,719 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 15:51:56,720 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 15:51:56,729 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:51:56" (1/1) ... [2019-12-27 15:51:56,730 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:51:56" (1/1) ... [2019-12-27 15:51:56,734 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:51:56" (1/1) ... [2019-12-27 15:51:56,735 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:51:56" (1/1) ... [2019-12-27 15:51:56,745 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:51:56" (1/1) ... [2019-12-27 15:51:56,749 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:51:56" (1/1) ... [2019-12-27 15:51:56,753 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:51:56" (1/1) ... [2019-12-27 15:51:56,759 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 15:51:56,759 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 15:51:56,759 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 15:51:56,759 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 15:51:56,760 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:51:56" (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:51:56,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 15:51:56,845 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 15:51:56,845 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 15:51:56,845 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 15:51:56,845 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 15:51:56,845 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 15:51:56,845 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 15:51:56,846 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 15:51:56,846 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 15:51:56,846 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 15:51:56,846 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 15:51:56,846 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 15:51:56,846 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 15:51:56,848 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:51:57,632 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 15:51:57,632 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 15:51:57,633 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:51:57 BoogieIcfgContainer [2019-12-27 15:51:57,634 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 15:51:57,635 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 15:51:57,635 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 15:51:57,638 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 15:51:57,638 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 03:51:55" (1/3) ... [2019-12-27 15:51:57,639 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73d3af90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:51:57, skipping insertion in model container [2019-12-27 15:51:57,639 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:51:56" (2/3) ... [2019-12-27 15:51:57,640 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73d3af90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:51:57, skipping insertion in model container [2019-12-27 15:51:57,640 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:51:57" (3/3) ... [2019-12-27 15:51:57,642 INFO L109 eAbstractionObserver]: Analyzing ICFG mix011_power.oepc.i [2019-12-27 15:51:57,652 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 15:51:57,652 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 15:51:57,659 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 15:51:57,660 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 15:51:57,700 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,701 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,701 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,702 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,702 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,702 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,703 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,703 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,703 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,704 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,704 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,704 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,704 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,705 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,705 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,705 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,706 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,706 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,706 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,706 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,707 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,707 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,707 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,708 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,708 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,708 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,708 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,709 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,709 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,709 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,710 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,710 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,710 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,710 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,711 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,711 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,711 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,712 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,712 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,728 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,729 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,729 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,729 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,729 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,732 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,732 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,732 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,732 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,732 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,733 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,733 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,733 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,733 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,734 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,734 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,735 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,735 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,735 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,735 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,736 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,736 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,736 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,736 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,736 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,737 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,737 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,737 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,737 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,737 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,738 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,738 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,738 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,738 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,738 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,739 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,739 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,739 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,739 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,740 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,740 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,740 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,740 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,740 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,741 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,741 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,741 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,741 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,741 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,742 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,742 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,742 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,742 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,742 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,743 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,743 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,743 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,743 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,744 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,744 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,744 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,744 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,744 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,745 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,745 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,745 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,745 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,745 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,746 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,746 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,746 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,746 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,746 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,747 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,747 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,747 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,747 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,747 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,748 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,748 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,748 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,748 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,748 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,749 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,749 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,749 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,749 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,750 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,750 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,750 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,750 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,750 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,750 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,751 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,751 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,751 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,751 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,751 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,752 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,752 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,752 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,752 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,752 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,753 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,753 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,753 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,753 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,753 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,754 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,754 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,754 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,754 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,754 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,755 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,755 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,755 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,755 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,755 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,756 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,756 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,756 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,756 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,756 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,757 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,757 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,757 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,757 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,757 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,758 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,758 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,758 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,758 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,759 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,759 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,762 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,762 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,763 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,763 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,763 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,763 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,763 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,763 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,764 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,764 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,764 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,764 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,764 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,765 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,765 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,765 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,765 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,765 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,765 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,766 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,766 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,766 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,766 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,766 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,767 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,767 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,767 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,767 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,767 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,768 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,768 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,768 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,768 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,771 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,772 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,772 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,772 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,772 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,772 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,773 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,773 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,773 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,773 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,773 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,774 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,779 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,779 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,779 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,780 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,780 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,780 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,780 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,780 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,781 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,781 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:51:57,799 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 15:51:57,819 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 15:51:57,819 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 15:51:57,819 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 15:51:57,819 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 15:51:57,819 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 15:51:57,820 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 15:51:57,820 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 15:51:57,820 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 15:51:57,837 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 178 places, 215 transitions [2019-12-27 15:51:57,839 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 215 transitions [2019-12-27 15:51:57,941 INFO L132 PetriNetUnfolder]: 47/212 cut-off events. [2019-12-27 15:51:57,942 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 15:51:57,960 INFO L76 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 212 events. 47/212 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 426 event pairs. 0/163 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 15:51:57,991 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 215 transitions [2019-12-27 15:51:58,049 INFO L132 PetriNetUnfolder]: 47/212 cut-off events. [2019-12-27 15:51:58,050 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 15:51:58,061 INFO L76 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 212 events. 47/212 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 426 event pairs. 0/163 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 15:51:58,087 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 15:51:58,089 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 15:52:03,324 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-27 15:52:03,435 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-27 15:52:03,763 WARN L192 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-27 15:52:03,899 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-27 15:52:03,928 INFO L206 etLargeBlockEncoding]: Checked pairs total: 90866 [2019-12-27 15:52:03,928 INFO L214 etLargeBlockEncoding]: Total number of compositions: 114 [2019-12-27 15:52:03,932 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 94 places, 103 transitions [2019-12-27 15:52:25,402 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 123302 states. [2019-12-27 15:52:25,404 INFO L276 IsEmpty]: Start isEmpty. Operand 123302 states. [2019-12-27 15:52:25,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 15:52:25,410 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:52:25,410 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 15:52:25,411 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:52:25,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:52:25,416 INFO L82 PathProgramCache]: Analyzing trace with hash 918873, now seen corresponding path program 1 times [2019-12-27 15:52:25,425 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:52:25,426 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588990009] [2019-12-27 15:52:25,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:52:25,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:52:25,724 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:25,725 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588990009] [2019-12-27 15:52:25,726 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:52:25,726 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 15:52:25,727 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [182899064] [2019-12-27 15:52:25,728 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:52:25,731 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:52:25,740 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 15:52:25,740 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:52:25,743 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:52:25,744 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:52:25,744 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:52:25,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:52:25,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:52:25,756 INFO L87 Difference]: Start difference. First operand 123302 states. Second operand 3 states. [2019-12-27 15:52:26,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:52:26,907 INFO L93 Difference]: Finished difference Result 122174 states and 518852 transitions. [2019-12-27 15:52:26,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:52:26,908 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 15:52:26,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:52:30,691 INFO L225 Difference]: With dead ends: 122174 [2019-12-27 15:52:30,691 INFO L226 Difference]: Without dead ends: 115076 [2019-12-27 15:52:30,693 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:52:35,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115076 states. [2019-12-27 15:52:38,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115076 to 115076. [2019-12-27 15:52:38,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115076 states. [2019-12-27 15:52:43,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115076 states to 115076 states and 488094 transitions. [2019-12-27 15:52:43,330 INFO L78 Accepts]: Start accepts. Automaton has 115076 states and 488094 transitions. Word has length 3 [2019-12-27 15:52:43,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:52:43,330 INFO L462 AbstractCegarLoop]: Abstraction has 115076 states and 488094 transitions. [2019-12-27 15:52:43,331 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:52:43,331 INFO L276 IsEmpty]: Start isEmpty. Operand 115076 states and 488094 transitions. [2019-12-27 15:52:43,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 15:52:43,334 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:52:43,334 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:52:43,334 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:52:43,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:52:43,335 INFO L82 PathProgramCache]: Analyzing trace with hash 1360334080, now seen corresponding path program 1 times [2019-12-27 15:52:43,335 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:52:43,336 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623748688] [2019-12-27 15:52:43,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:52:43,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:52:43,417 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:43,418 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623748688] [2019-12-27 15:52:43,418 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:52:43,418 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:52:43,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [866038535] [2019-12-27 15:52:43,419 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:52:43,420 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:52:43,423 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 15:52:43,424 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:52:43,424 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:52:43,425 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 15:52:43,425 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:52:43,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 15:52:43,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 15:52:43,426 INFO L87 Difference]: Start difference. First operand 115076 states and 488094 transitions. Second operand 4 states. [2019-12-27 15:52:49,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:52:49,657 INFO L93 Difference]: Finished difference Result 178684 states and 728513 transitions. [2019-12-27 15:52:49,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 15:52:49,658 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 15:52:49,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:52:50,208 INFO L225 Difference]: With dead ends: 178684 [2019-12-27 15:52:50,208 INFO L226 Difference]: Without dead ends: 178635 [2019-12-27 15:52:50,209 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:52:55,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178635 states. [2019-12-27 15:52:59,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178635 to 162755. [2019-12-27 15:52:59,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162755 states. [2019-12-27 15:53:00,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162755 states to 162755 states and 672033 transitions. [2019-12-27 15:53:00,146 INFO L78 Accepts]: Start accepts. Automaton has 162755 states and 672033 transitions. Word has length 11 [2019-12-27 15:53:00,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:53:00,147 INFO L462 AbstractCegarLoop]: Abstraction has 162755 states and 672033 transitions. [2019-12-27 15:53:00,147 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 15:53:00,147 INFO L276 IsEmpty]: Start isEmpty. Operand 162755 states and 672033 transitions. [2019-12-27 15:53:00,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 15:53:00,154 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:53:00,154 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:53:00,155 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:53:00,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:53:00,155 INFO L82 PathProgramCache]: Analyzing trace with hash 1888852276, now seen corresponding path program 1 times [2019-12-27 15:53:00,155 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:53:00,156 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8603630] [2019-12-27 15:53:00,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:53:00,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:53:00,210 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:00,210 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8603630] [2019-12-27 15:53:00,211 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:53:00,211 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:53:00,211 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [368963772] [2019-12-27 15:53:00,211 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:53:00,212 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:53:00,214 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 15:53:00,214 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:53:00,215 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:53:00,215 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:53:00,215 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:53:00,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:53:00,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:53:00,216 INFO L87 Difference]: Start difference. First operand 162755 states and 672033 transitions. Second operand 3 states. [2019-12-27 15:53:00,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:53:00,372 INFO L93 Difference]: Finished difference Result 34587 states and 111811 transitions. [2019-12-27 15:53:00,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:53:00,372 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 15:53:00,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:53:00,456 INFO L225 Difference]: With dead ends: 34587 [2019-12-27 15:53:00,457 INFO L226 Difference]: Without dead ends: 34587 [2019-12-27 15:53:00,457 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:53:00,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34587 states. [2019-12-27 15:53:06,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34587 to 34587. [2019-12-27 15:53:06,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34587 states. [2019-12-27 15:53:06,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34587 states to 34587 states and 111811 transitions. [2019-12-27 15:53:06,195 INFO L78 Accepts]: Start accepts. Automaton has 34587 states and 111811 transitions. Word has length 13 [2019-12-27 15:53:06,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:53:06,195 INFO L462 AbstractCegarLoop]: Abstraction has 34587 states and 111811 transitions. [2019-12-27 15:53:06,195 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:53:06,196 INFO L276 IsEmpty]: Start isEmpty. Operand 34587 states and 111811 transitions. [2019-12-27 15:53:06,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 15:53:06,198 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:53:06,198 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:53:06,199 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:53:06,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:53:06,199 INFO L82 PathProgramCache]: Analyzing trace with hash -1220224201, now seen corresponding path program 1 times [2019-12-27 15:53:06,199 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:53:06,200 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354649693] [2019-12-27 15:53:06,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:53:06,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:53:06,302 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:06,302 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354649693] [2019-12-27 15:53:06,303 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:53:06,305 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 15:53:06,306 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [454698773] [2019-12-27 15:53:06,306 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:53:06,308 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:53:06,311 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 15:53:06,311 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:53:06,311 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:53:06,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 15:53:06,312 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:53:06,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 15:53:06,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 15:53:06,315 INFO L87 Difference]: Start difference. First operand 34587 states and 111811 transitions. Second operand 5 states. [2019-12-27 15:53:06,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:53:06,820 INFO L93 Difference]: Finished difference Result 47506 states and 151809 transitions. [2019-12-27 15:53:06,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 15:53:06,821 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-27 15:53:06,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:53:06,903 INFO L225 Difference]: With dead ends: 47506 [2019-12-27 15:53:06,903 INFO L226 Difference]: Without dead ends: 47506 [2019-12-27 15:53:06,903 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:53:07,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47506 states. [2019-12-27 15:53:07,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47506 to 39981. [2019-12-27 15:53:07,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39981 states. [2019-12-27 15:53:07,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39981 states to 39981 states and 128832 transitions. [2019-12-27 15:53:07,742 INFO L78 Accepts]: Start accepts. Automaton has 39981 states and 128832 transitions. Word has length 16 [2019-12-27 15:53:07,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:53:07,743 INFO L462 AbstractCegarLoop]: Abstraction has 39981 states and 128832 transitions. [2019-12-27 15:53:07,743 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 15:53:07,743 INFO L276 IsEmpty]: Start isEmpty. Operand 39981 states and 128832 transitions. [2019-12-27 15:53:07,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 15:53:07,751 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:53:07,752 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:53:07,752 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:53:07,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:53:07,752 INFO L82 PathProgramCache]: Analyzing trace with hash -1720601530, now seen corresponding path program 1 times [2019-12-27 15:53:07,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:53:07,753 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247117431] [2019-12-27 15:53:07,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:53:07,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:53:07,844 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:07,845 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247117431] [2019-12-27 15:53:07,845 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:53:07,845 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 15:53:07,845 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1219424003] [2019-12-27 15:53:07,846 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:53:07,849 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:53:07,856 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 31 states and 38 transitions. [2019-12-27 15:53:07,857 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:53:07,858 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:53:07,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 15:53:07,859 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:53:07,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 15:53:07,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 15:53:07,859 INFO L87 Difference]: Start difference. First operand 39981 states and 128832 transitions. Second operand 6 states. [2019-12-27 15:53:09,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:53:09,123 INFO L93 Difference]: Finished difference Result 59624 states and 187628 transitions. [2019-12-27 15:53:09,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 15:53:09,123 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 15:53:09,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:53:09,239 INFO L225 Difference]: With dead ends: 59624 [2019-12-27 15:53:09,239 INFO L226 Difference]: Without dead ends: 59617 [2019-12-27 15:53:09,239 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-27 15:53:09,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59617 states. [2019-12-27 15:53:10,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59617 to 40463. [2019-12-27 15:53:10,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40463 states. [2019-12-27 15:53:10,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40463 states to 40463 states and 129749 transitions. [2019-12-27 15:53:10,133 INFO L78 Accepts]: Start accepts. Automaton has 40463 states and 129749 transitions. Word has length 22 [2019-12-27 15:53:10,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:53:10,133 INFO L462 AbstractCegarLoop]: Abstraction has 40463 states and 129749 transitions. [2019-12-27 15:53:10,133 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 15:53:10,133 INFO L276 IsEmpty]: Start isEmpty. Operand 40463 states and 129749 transitions. [2019-12-27 15:53:10,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 15:53:10,147 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:53:10,147 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:53:10,147 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:53:10,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:53:10,148 INFO L82 PathProgramCache]: Analyzing trace with hash -74763598, now seen corresponding path program 1 times [2019-12-27 15:53:10,148 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:53:10,149 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757821995] [2019-12-27 15:53:10,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:53:10,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:53:10,212 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,212 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757821995] [2019-12-27 15:53:10,212 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:53:10,213 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 15:53:10,213 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1244299579] [2019-12-27 15:53:10,213 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:53:10,220 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:53:10,230 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 73 transitions. [2019-12-27 15:53:10,231 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:53:10,272 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 15:53:10,273 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 15:53:10,273 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:53:10,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 15:53:10,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 15:53:10,274 INFO L87 Difference]: Start difference. First operand 40463 states and 129749 transitions. Second operand 5 states. [2019-12-27 15:53:10,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:53:10,350 INFO L93 Difference]: Finished difference Result 16096 states and 48753 transitions. [2019-12-27 15:53:10,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 15:53:10,351 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 15:53:10,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:53:10,375 INFO L225 Difference]: With dead ends: 16096 [2019-12-27 15:53:10,375 INFO L226 Difference]: Without dead ends: 16096 [2019-12-27 15:53:10,375 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:53:10,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16096 states. [2019-12-27 15:53:10,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16096 to 15803. [2019-12-27 15:53:10,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15803 states. [2019-12-27 15:53:10,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15803 states to 15803 states and 47917 transitions. [2019-12-27 15:53:10,620 INFO L78 Accepts]: Start accepts. Automaton has 15803 states and 47917 transitions. Word has length 25 [2019-12-27 15:53:10,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:53:10,620 INFO L462 AbstractCegarLoop]: Abstraction has 15803 states and 47917 transitions. [2019-12-27 15:53:10,620 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 15:53:10,620 INFO L276 IsEmpty]: Start isEmpty. Operand 15803 states and 47917 transitions. [2019-12-27 15:53:10,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 15:53:10,631 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:53:10,631 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:53:10,631 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:53:10,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:53:10,631 INFO L82 PathProgramCache]: Analyzing trace with hash 1856606199, now seen corresponding path program 1 times [2019-12-27 15:53:10,632 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:53:10,632 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999149834] [2019-12-27 15:53:10,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:53:10,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:53:10,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:53:10,736 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999149834] [2019-12-27 15:53:10,736 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:53:10,736 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 15:53:10,737 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [289733085] [2019-12-27 15:53:10,737 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:53:10,742 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:53:10,748 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 15:53:10,748 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:53:10,748 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:53:10,748 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 15:53:10,749 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:53:10,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 15:53:10,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 15:53:10,749 INFO L87 Difference]: Start difference. First operand 15803 states and 47917 transitions. Second operand 6 states. [2019-12-27 15:53:11,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:53:11,570 INFO L93 Difference]: Finished difference Result 22779 states and 67340 transitions. [2019-12-27 15:53:11,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 15:53:11,571 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 15:53:11,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:53:11,601 INFO L225 Difference]: With dead ends: 22779 [2019-12-27 15:53:11,601 INFO L226 Difference]: Without dead ends: 22779 [2019-12-27 15:53:11,602 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 15:53:11,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22779 states. [2019-12-27 15:53:11,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22779 to 18120. [2019-12-27 15:53:11,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18120 states. [2019-12-27 15:53:11,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18120 states to 18120 states and 54739 transitions. [2019-12-27 15:53:11,904 INFO L78 Accepts]: Start accepts. Automaton has 18120 states and 54739 transitions. Word has length 27 [2019-12-27 15:53:11,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:53:11,905 INFO L462 AbstractCegarLoop]: Abstraction has 18120 states and 54739 transitions. [2019-12-27 15:53:11,905 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 15:53:11,905 INFO L276 IsEmpty]: Start isEmpty. Operand 18120 states and 54739 transitions. [2019-12-27 15:53:11,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 15:53:11,921 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:53:11,921 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:53:11,922 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:53:11,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:53:11,922 INFO L82 PathProgramCache]: Analyzing trace with hash -1731527828, now seen corresponding path program 1 times [2019-12-27 15:53:11,922 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:53:11,923 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150771510] [2019-12-27 15:53:11,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:53:11,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:53:12,042 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:12,042 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150771510] [2019-12-27 15:53:12,043 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:53:12,043 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 15:53:12,043 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1284059034] [2019-12-27 15:53:12,043 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:53:12,050 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:53:12,065 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 42 states and 49 transitions. [2019-12-27 15:53:12,066 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:53:12,066 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:53:12,067 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 15:53:12,067 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:53:12,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 15:53:12,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 15:53:12,068 INFO L87 Difference]: Start difference. First operand 18120 states and 54739 transitions. Second operand 7 states. [2019-12-27 15:53:13,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:53:13,217 INFO L93 Difference]: Finished difference Result 24798 states and 73024 transitions. [2019-12-27 15:53:13,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 15:53:13,218 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-27 15:53:13,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:53:13,252 INFO L225 Difference]: With dead ends: 24798 [2019-12-27 15:53:13,252 INFO L226 Difference]: Without dead ends: 24798 [2019-12-27 15:53:13,253 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-27 15:53:13,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24798 states. [2019-12-27 15:53:13,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24798 to 16706. [2019-12-27 15:53:13,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16706 states. [2019-12-27 15:53:13,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16706 states to 16706 states and 50524 transitions. [2019-12-27 15:53:13,568 INFO L78 Accepts]: Start accepts. Automaton has 16706 states and 50524 transitions. Word has length 33 [2019-12-27 15:53:13,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:53:13,569 INFO L462 AbstractCegarLoop]: Abstraction has 16706 states and 50524 transitions. [2019-12-27 15:53:13,569 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 15:53:13,569 INFO L276 IsEmpty]: Start isEmpty. Operand 16706 states and 50524 transitions. [2019-12-27 15:53:13,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 15:53:13,592 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:53:13,592 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:53:13,592 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:53:13,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:53:13,593 INFO L82 PathProgramCache]: Analyzing trace with hash -1723865273, now seen corresponding path program 1 times [2019-12-27 15:53:13,594 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:53:13,594 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876537190] [2019-12-27 15:53:13,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:53:13,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:53:13,670 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:13,670 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876537190] [2019-12-27 15:53:13,671 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:53:13,671 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:53:13,671 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2132506916] [2019-12-27 15:53:13,671 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:53:13,681 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:53:13,751 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 184 states and 375 transitions. [2019-12-27 15:53:13,751 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:53:13,752 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:53:13,753 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:53:13,753 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:53:13,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:53:13,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:53:13,754 INFO L87 Difference]: Start difference. First operand 16706 states and 50524 transitions. Second operand 3 states. [2019-12-27 15:53:13,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:53:13,919 INFO L93 Difference]: Finished difference Result 28297 states and 85903 transitions. [2019-12-27 15:53:13,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:53:13,919 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 15:53:13,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:53:13,947 INFO L225 Difference]: With dead ends: 28297 [2019-12-27 15:53:13,947 INFO L226 Difference]: Without dead ends: 14210 [2019-12-27 15:53:13,948 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:53:14,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14210 states. [2019-12-27 15:53:14,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14210 to 14150. [2019-12-27 15:53:14,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14150 states. [2019-12-27 15:53:14,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14150 states to 14150 states and 42128 transitions. [2019-12-27 15:53:14,227 INFO L78 Accepts]: Start accepts. Automaton has 14150 states and 42128 transitions. Word has length 39 [2019-12-27 15:53:14,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:53:14,227 INFO L462 AbstractCegarLoop]: Abstraction has 14150 states and 42128 transitions. [2019-12-27 15:53:14,227 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:53:14,227 INFO L276 IsEmpty]: Start isEmpty. Operand 14150 states and 42128 transitions. [2019-12-27 15:53:14,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 15:53:14,245 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:53:14,245 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:53:14,246 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:53:14,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:53:14,246 INFO L82 PathProgramCache]: Analyzing trace with hash 1940280365, now seen corresponding path program 2 times [2019-12-27 15:53:14,246 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:53:14,247 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783604852] [2019-12-27 15:53:14,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:53:14,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:53:14,496 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:14,497 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783604852] [2019-12-27 15:53:14,498 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:53:14,498 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 15:53:14,498 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1617256918] [2019-12-27 15:53:14,498 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:53:14,508 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:53:14,568 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 184 states and 378 transitions. [2019-12-27 15:53:14,569 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:53:14,570 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:53:14,570 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:53:14,571 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:53:14,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:53:14,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:53:14,571 INFO L87 Difference]: Start difference. First operand 14150 states and 42128 transitions. Second operand 3 states. [2019-12-27 15:53:14,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:53:14,617 INFO L93 Difference]: Finished difference Result 14149 states and 42126 transitions. [2019-12-27 15:53:14,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:53:14,618 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 15:53:14,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:53:14,638 INFO L225 Difference]: With dead ends: 14149 [2019-12-27 15:53:14,638 INFO L226 Difference]: Without dead ends: 14149 [2019-12-27 15:53:14,638 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:53:14,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14149 states. [2019-12-27 15:53:14,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14149 to 14149. [2019-12-27 15:53:14,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14149 states. [2019-12-27 15:53:14,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14149 states to 14149 states and 42126 transitions. [2019-12-27 15:53:14,852 INFO L78 Accepts]: Start accepts. Automaton has 14149 states and 42126 transitions. Word has length 39 [2019-12-27 15:53:14,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:53:14,853 INFO L462 AbstractCegarLoop]: Abstraction has 14149 states and 42126 transitions. [2019-12-27 15:53:14,853 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:53:14,853 INFO L276 IsEmpty]: Start isEmpty. Operand 14149 states and 42126 transitions. [2019-12-27 15:53:14,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 15:53:14,871 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:53:14,871 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:53:14,871 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:53:14,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:53:14,871 INFO L82 PathProgramCache]: Analyzing trace with hash 140069502, now seen corresponding path program 1 times [2019-12-27 15:53:14,872 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:53:14,872 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384991423] [2019-12-27 15:53:14,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:53:14,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:53:14,959 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:14,960 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384991423] [2019-12-27 15:53:14,960 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:53:14,960 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 15:53:14,960 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1059028691] [2019-12-27 15:53:14,961 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:53:14,971 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:53:15,048 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 216 states and 448 transitions. [2019-12-27 15:53:15,049 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:53:15,068 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 15:53:15,069 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 15:53:15,069 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:53:15,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 15:53:15,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 15:53:15,069 INFO L87 Difference]: Start difference. First operand 14149 states and 42126 transitions. Second operand 6 states. [2019-12-27 15:53:15,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:53:15,143 INFO L93 Difference]: Finished difference Result 13093 states and 39713 transitions. [2019-12-27 15:53:15,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 15:53:15,144 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-27 15:53:15,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:53:15,161 INFO L225 Difference]: With dead ends: 13093 [2019-12-27 15:53:15,161 INFO L226 Difference]: Without dead ends: 11563 [2019-12-27 15:53:15,162 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 15:53:15,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11563 states. [2019-12-27 15:53:15,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11563 to 11150. [2019-12-27 15:53:15,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11150 states. [2019-12-27 15:53:15,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11150 states to 11150 states and 34836 transitions. [2019-12-27 15:53:15,343 INFO L78 Accepts]: Start accepts. Automaton has 11150 states and 34836 transitions. Word has length 40 [2019-12-27 15:53:15,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:53:15,344 INFO L462 AbstractCegarLoop]: Abstraction has 11150 states and 34836 transitions. [2019-12-27 15:53:15,344 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 15:53:15,344 INFO L276 IsEmpty]: Start isEmpty. Operand 11150 states and 34836 transitions. [2019-12-27 15:53:15,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 15:53:15,357 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:53:15,357 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:53:15,357 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:53:15,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:53:15,357 INFO L82 PathProgramCache]: Analyzing trace with hash 1749898488, now seen corresponding path program 1 times [2019-12-27 15:53:15,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:53:15,358 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20642991] [2019-12-27 15:53:15,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:53:15,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:53:15,405 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:15,405 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20642991] [2019-12-27 15:53:15,405 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:53:15,405 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 15:53:15,406 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2045771046] [2019-12-27 15:53:15,406 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:53:15,431 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:53:15,624 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 231 states and 425 transitions. [2019-12-27 15:53:15,625 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:53:15,634 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 15:53:15,635 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:53:15,635 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:53:15,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:53:15,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:53:15,635 INFO L87 Difference]: Start difference. First operand 11150 states and 34836 transitions. Second operand 3 states. [2019-12-27 15:53:15,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:53:15,738 INFO L93 Difference]: Finished difference Result 17888 states and 54761 transitions. [2019-12-27 15:53:15,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:53:15,738 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 15:53:15,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:53:15,761 INFO L225 Difference]: With dead ends: 17888 [2019-12-27 15:53:15,761 INFO L226 Difference]: Without dead ends: 17888 [2019-12-27 15:53:15,762 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:53:15,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17888 states. [2019-12-27 15:53:15,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17888 to 12900. [2019-12-27 15:53:15,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12900 states. [2019-12-27 15:53:16,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12900 states to 12900 states and 39991 transitions. [2019-12-27 15:53:16,006 INFO L78 Accepts]: Start accepts. Automaton has 12900 states and 39991 transitions. Word has length 64 [2019-12-27 15:53:16,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:53:16,006 INFO L462 AbstractCegarLoop]: Abstraction has 12900 states and 39991 transitions. [2019-12-27 15:53:16,006 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:53:16,006 INFO L276 IsEmpty]: Start isEmpty. Operand 12900 states and 39991 transitions. [2019-12-27 15:53:16,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 15:53:16,021 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:53:16,021 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:53:16,021 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:53:16,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:53:16,021 INFO L82 PathProgramCache]: Analyzing trace with hash 1943324054, now seen corresponding path program 1 times [2019-12-27 15:53:16,022 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:53:16,022 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314282535] [2019-12-27 15:53:16,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:53:16,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:53:16,127 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:16,127 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314282535] [2019-12-27 15:53:16,127 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:53:16,128 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 15:53:16,128 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1222118194] [2019-12-27 15:53:16,128 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:53:16,154 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:53:16,572 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 231 states and 425 transitions. [2019-12-27 15:53:16,572 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:53:16,636 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 15:53:16,636 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 15:53:16,636 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:53:16,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 15:53:16,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 15:53:16,637 INFO L87 Difference]: Start difference. First operand 12900 states and 39991 transitions. Second operand 9 states. [2019-12-27 15:53:18,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:53:18,622 INFO L93 Difference]: Finished difference Result 55398 states and 168148 transitions. [2019-12-27 15:53:18,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 15:53:18,622 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-27 15:53:18,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:53:18,677 INFO L225 Difference]: With dead ends: 55398 [2019-12-27 15:53:18,678 INFO L226 Difference]: Without dead ends: 40772 [2019-12-27 15:53:18,678 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=138, Invalid=462, Unknown=0, NotChecked=0, Total=600 [2019-12-27 15:53:18,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40772 states. [2019-12-27 15:53:19,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40772 to 15594. [2019-12-27 15:53:19,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15594 states. [2019-12-27 15:53:19,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15594 states to 15594 states and 48552 transitions. [2019-12-27 15:53:19,149 INFO L78 Accepts]: Start accepts. Automaton has 15594 states and 48552 transitions. Word has length 64 [2019-12-27 15:53:19,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:53:19,149 INFO L462 AbstractCegarLoop]: Abstraction has 15594 states and 48552 transitions. [2019-12-27 15:53:19,149 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 15:53:19,149 INFO L276 IsEmpty]: Start isEmpty. Operand 15594 states and 48552 transitions. [2019-12-27 15:53:19,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 15:53:19,168 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:53:19,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] [2019-12-27 15:53:19,168 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:53:19,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:53:19,169 INFO L82 PathProgramCache]: Analyzing trace with hash -1388273988, now seen corresponding path program 2 times [2019-12-27 15:53:19,169 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:53:19,170 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623291123] [2019-12-27 15:53:19,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:53:19,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:53:19,280 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:19,281 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623291123] [2019-12-27 15:53:19,281 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:53:19,281 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 15:53:19,282 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1361767344] [2019-12-27 15:53:19,282 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:53:19,329 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:53:19,838 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 299 states and 545 transitions. [2019-12-27 15:53:19,839 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:53:19,922 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 11 times. [2019-12-27 15:53:19,922 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 15:53:19,923 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:53:19,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 15:53:19,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-27 15:53:19,923 INFO L87 Difference]: Start difference. First operand 15594 states and 48552 transitions. Second operand 10 states. [2019-12-27 15:53:20,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:53:20,491 INFO L93 Difference]: Finished difference Result 41160 states and 125962 transitions. [2019-12-27 15:53:20,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 15:53:20,491 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 64 [2019-12-27 15:53:20,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:53:20,537 INFO L225 Difference]: With dead ends: 41160 [2019-12-27 15:53:20,537 INFO L226 Difference]: Without dead ends: 29917 [2019-12-27 15:53:20,538 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2019-12-27 15:53:20,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29917 states. [2019-12-27 15:53:20,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29917 to 18174. [2019-12-27 15:53:20,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18174 states. [2019-12-27 15:53:20,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18174 states to 18174 states and 56555 transitions. [2019-12-27 15:53:20,916 INFO L78 Accepts]: Start accepts. Automaton has 18174 states and 56555 transitions. Word has length 64 [2019-12-27 15:53:20,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:53:20,917 INFO L462 AbstractCegarLoop]: Abstraction has 18174 states and 56555 transitions. [2019-12-27 15:53:20,917 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 15:53:20,917 INFO L276 IsEmpty]: Start isEmpty. Operand 18174 states and 56555 transitions. [2019-12-27 15:53:20,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 15:53:20,941 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:53:20,941 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:53:20,942 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:53:20,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:53:20,942 INFO L82 PathProgramCache]: Analyzing trace with hash -1006987750, now seen corresponding path program 3 times [2019-12-27 15:53:20,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:53:20,943 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595200615] [2019-12-27 15:53:20,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:53:20,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:53:21,079 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:21,079 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595200615] [2019-12-27 15:53:21,079 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:53:21,079 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 15:53:21,080 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1345727744] [2019-12-27 15:53:21,080 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:53:21,101 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:53:21,305 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 252 states and 485 transitions. [2019-12-27 15:53:21,305 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:53:21,496 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 26 times. [2019-12-27 15:53:21,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 15:53:21,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:53:21,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 15:53:21,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-12-27 15:53:21,498 INFO L87 Difference]: Start difference. First operand 18174 states and 56555 transitions. Second operand 12 states. [2019-12-27 15:53:24,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:53:24,785 INFO L93 Difference]: Finished difference Result 95198 states and 289540 transitions. [2019-12-27 15:53:24,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-12-27 15:53:24,786 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 64 [2019-12-27 15:53:24,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:53:24,980 INFO L225 Difference]: With dead ends: 95198 [2019-12-27 15:53:24,980 INFO L226 Difference]: Without dead ends: 75691 [2019-12-27 15:53:24,986 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 22 SyntacticMatches, 14 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1063 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=745, Invalid=2447, Unknown=0, NotChecked=0, Total=3192 [2019-12-27 15:53:25,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75691 states. [2019-12-27 15:53:25,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75691 to 21666. [2019-12-27 15:53:25,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21666 states. [2019-12-27 15:53:25,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21666 states to 21666 states and 67958 transitions. [2019-12-27 15:53:25,900 INFO L78 Accepts]: Start accepts. Automaton has 21666 states and 67958 transitions. Word has length 64 [2019-12-27 15:53:25,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:53:25,901 INFO L462 AbstractCegarLoop]: Abstraction has 21666 states and 67958 transitions. [2019-12-27 15:53:25,901 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 15:53:25,901 INFO L276 IsEmpty]: Start isEmpty. Operand 21666 states and 67958 transitions. [2019-12-27 15:53:25,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 15:53:25,923 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:53:25,923 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:53:25,923 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:53:25,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:53:25,923 INFO L82 PathProgramCache]: Analyzing trace with hash 1651786320, now seen corresponding path program 4 times [2019-12-27 15:53:25,924 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:53:25,924 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325454040] [2019-12-27 15:53:25,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:53:25,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:53:26,039 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:26,039 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325454040] [2019-12-27 15:53:26,040 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:53:26,040 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 15:53:26,040 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2103097370] [2019-12-27 15:53:26,040 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:53:26,062 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:53:26,290 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 247 states and 438 transitions. [2019-12-27 15:53:26,290 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:53:26,398 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 13 times. [2019-12-27 15:53:26,398 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 15:53:26,399 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:53:26,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 15:53:26,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-27 15:53:26,399 INFO L87 Difference]: Start difference. First operand 21666 states and 67958 transitions. Second operand 9 states. [2019-12-27 15:53:28,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:53:28,425 INFO L93 Difference]: Finished difference Result 42590 states and 129156 transitions. [2019-12-27 15:53:28,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 15:53:28,425 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-27 15:53:28,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:53:28,487 INFO L225 Difference]: With dead ends: 42590 [2019-12-27 15:53:28,488 INFO L226 Difference]: Without dead ends: 42422 [2019-12-27 15:53:28,488 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 18 SyntacticMatches, 6 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2019-12-27 15:53:28,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42422 states. [2019-12-27 15:53:29,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42422 to 31013. [2019-12-27 15:53:29,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31013 states. [2019-12-27 15:53:29,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31013 states to 31013 states and 95035 transitions. [2019-12-27 15:53:29,091 INFO L78 Accepts]: Start accepts. Automaton has 31013 states and 95035 transitions. Word has length 64 [2019-12-27 15:53:29,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:53:29,092 INFO L462 AbstractCegarLoop]: Abstraction has 31013 states and 95035 transitions. [2019-12-27 15:53:29,092 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 15:53:29,092 INFO L276 IsEmpty]: Start isEmpty. Operand 31013 states and 95035 transitions. [2019-12-27 15:53:29,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 15:53:29,127 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:53:29,127 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:53:29,128 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:53:29,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:53:29,128 INFO L82 PathProgramCache]: Analyzing trace with hash -2061800196, now seen corresponding path program 5 times [2019-12-27 15:53:29,128 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:53:29,129 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440696340] [2019-12-27 15:53:29,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:53:29,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:53:29,193 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:29,194 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440696340] [2019-12-27 15:53:29,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:53:29,194 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:53:29,194 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [535308984] [2019-12-27 15:53:29,194 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:53:29,214 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:53:29,495 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 292 states and 553 transitions. [2019-12-27 15:53:29,496 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:53:29,497 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 15:53:29,497 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:53:29,498 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:53:29,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:53:29,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:53:29,498 INFO L87 Difference]: Start difference. First operand 31013 states and 95035 transitions. Second operand 3 states. [2019-12-27 15:53:29,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:53:29,652 INFO L93 Difference]: Finished difference Result 36752 states and 112015 transitions. [2019-12-27 15:53:29,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:53:29,655 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 15:53:29,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:53:29,707 INFO L225 Difference]: With dead ends: 36752 [2019-12-27 15:53:29,707 INFO L226 Difference]: Without dead ends: 36752 [2019-12-27 15:53:29,707 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:53:29,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36752 states. [2019-12-27 15:53:30,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36752 to 31533. [2019-12-27 15:53:30,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31533 states. [2019-12-27 15:53:30,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31533 states to 31533 states and 96880 transitions. [2019-12-27 15:53:30,633 INFO L78 Accepts]: Start accepts. Automaton has 31533 states and 96880 transitions. Word has length 64 [2019-12-27 15:53:30,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:53:30,633 INFO L462 AbstractCegarLoop]: Abstraction has 31533 states and 96880 transitions. [2019-12-27 15:53:30,633 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:53:30,634 INFO L276 IsEmpty]: Start isEmpty. Operand 31533 states and 96880 transitions. [2019-12-27 15:53:30,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 15:53:30,666 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:53:30,666 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:53:30,666 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:53:30,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:53:30,667 INFO L82 PathProgramCache]: Analyzing trace with hash 996367564, now seen corresponding path program 1 times [2019-12-27 15:53:30,667 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:53:30,667 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024148518] [2019-12-27 15:53:30,667 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:53:30,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:53:30,788 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:30,788 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024148518] [2019-12-27 15:53:30,788 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:53:30,789 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 15:53:30,789 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1078066230] [2019-12-27 15:53:30,789 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:53:30,812 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:53:31,135 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 243 states and 469 transitions. [2019-12-27 15:53:31,135 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:53:31,344 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 15:53:31,345 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 15:53:31,345 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:53:31,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 15:53:31,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-12-27 15:53:31,346 INFO L87 Difference]: Start difference. First operand 31533 states and 96880 transitions. Second operand 12 states. [2019-12-27 15:53:35,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:53:35,688 INFO L93 Difference]: Finished difference Result 114417 states and 345284 transitions. [2019-12-27 15:53:35,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-12-27 15:53:35,688 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 65 [2019-12-27 15:53:35,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:53:35,856 INFO L225 Difference]: With dead ends: 114417 [2019-12-27 15:53:35,856 INFO L226 Difference]: Without dead ends: 105136 [2019-12-27 15:53:35,858 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 7 SyntacticMatches, 9 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 889 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=641, Invalid=2221, Unknown=0, NotChecked=0, Total=2862 [2019-12-27 15:53:36,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105136 states. [2019-12-27 15:53:37,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105136 to 32687. [2019-12-27 15:53:37,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32687 states. [2019-12-27 15:53:37,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32687 states to 32687 states and 100796 transitions. [2019-12-27 15:53:37,436 INFO L78 Accepts]: Start accepts. Automaton has 32687 states and 100796 transitions. Word has length 65 [2019-12-27 15:53:37,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:53:37,437 INFO L462 AbstractCegarLoop]: Abstraction has 32687 states and 100796 transitions. [2019-12-27 15:53:37,437 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 15:53:37,437 INFO L276 IsEmpty]: Start isEmpty. Operand 32687 states and 100796 transitions. [2019-12-27 15:53:37,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 15:53:37,474 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:53:37,474 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:53:37,474 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:53:37,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:53:37,474 INFO L82 PathProgramCache]: Analyzing trace with hash 1225817674, now seen corresponding path program 2 times [2019-12-27 15:53:37,475 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:53:37,475 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688073529] [2019-12-27 15:53:37,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:53:37,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:53:37,591 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:37,592 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688073529] [2019-12-27 15:53:37,592 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:53:37,592 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 15:53:37,592 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1143556643] [2019-12-27 15:53:37,592 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:53:37,613 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:53:37,874 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 235 states and 449 transitions. [2019-12-27 15:53:37,874 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:53:37,986 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 13 times. [2019-12-27 15:53:37,986 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 15:53:37,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:53:37,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 15:53:37,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-12-27 15:53:37,988 INFO L87 Difference]: Start difference. First operand 32687 states and 100796 transitions. Second operand 11 states. [2019-12-27 15:53:39,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:53:39,663 INFO L93 Difference]: Finished difference Result 98409 states and 295459 transitions. [2019-12-27 15:53:39,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 15:53:39,664 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2019-12-27 15:53:39,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:53:40,216 INFO L225 Difference]: With dead ends: 98409 [2019-12-27 15:53:40,216 INFO L226 Difference]: Without dead ends: 93585 [2019-12-27 15:53:40,216 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 7 SyntacticMatches, 7 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=269, Invalid=853, Unknown=0, NotChecked=0, Total=1122 [2019-12-27 15:53:40,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93585 states. [2019-12-27 15:53:41,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93585 to 32588. [2019-12-27 15:53:41,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32588 states. [2019-12-27 15:53:41,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32588 states to 32588 states and 100402 transitions. [2019-12-27 15:53:41,245 INFO L78 Accepts]: Start accepts. Automaton has 32588 states and 100402 transitions. Word has length 65 [2019-12-27 15:53:41,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:53:41,245 INFO L462 AbstractCegarLoop]: Abstraction has 32588 states and 100402 transitions. [2019-12-27 15:53:41,245 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 15:53:41,246 INFO L276 IsEmpty]: Start isEmpty. Operand 32588 states and 100402 transitions. [2019-12-27 15:53:41,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 15:53:41,280 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:53:41,280 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:53:41,280 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:53:41,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:53:41,281 INFO L82 PathProgramCache]: Analyzing trace with hash -848247963, now seen corresponding path program 1 times [2019-12-27 15:53:41,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:53:41,281 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791204574] [2019-12-27 15:53:41,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:53:41,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:53:41,442 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:41,442 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791204574] [2019-12-27 15:53:41,442 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:53:41,442 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 15:53:41,443 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1271102563] [2019-12-27 15:53:41,443 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:53:41,463 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:53:41,809 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 251 states and 442 transitions. [2019-12-27 15:53:41,809 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:53:41,965 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 20 times. [2019-12-27 15:53:41,966 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 15:53:41,966 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:53:41,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 15:53:41,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-12-27 15:53:41,967 INFO L87 Difference]: Start difference. First operand 32588 states and 100402 transitions. Second operand 11 states. [2019-12-27 15:53:44,557 WARN L192 SmtUtils]: Spent 313.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-12-27 15:53:45,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:53:45,485 INFO L93 Difference]: Finished difference Result 50416 states and 151899 transitions. [2019-12-27 15:53:45,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-12-27 15:53:45,486 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2019-12-27 15:53:45,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:53:45,556 INFO L225 Difference]: With dead ends: 50416 [2019-12-27 15:53:45,556 INFO L226 Difference]: Without dead ends: 50176 [2019-12-27 15:53:45,557 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 31 SyntacticMatches, 9 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 457 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=296, Invalid=1426, Unknown=0, NotChecked=0, Total=1722 [2019-12-27 15:53:45,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50176 states. [2019-12-27 15:53:46,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50176 to 30761. [2019-12-27 15:53:46,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30761 states. [2019-12-27 15:53:46,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30761 states to 30761 states and 95028 transitions. [2019-12-27 15:53:46,203 INFO L78 Accepts]: Start accepts. Automaton has 30761 states and 95028 transitions. Word has length 65 [2019-12-27 15:53:46,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:53:46,203 INFO L462 AbstractCegarLoop]: Abstraction has 30761 states and 95028 transitions. [2019-12-27 15:53:46,203 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 15:53:46,203 INFO L276 IsEmpty]: Start isEmpty. Operand 30761 states and 95028 transitions. [2019-12-27 15:53:46,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 15:53:46,240 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:53:46,241 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46,241 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:53:46,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:53:46,241 INFO L82 PathProgramCache]: Analyzing trace with hash 1625168593, now seen corresponding path program 2 times [2019-12-27 15:53:46,242 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:53:46,242 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281267864] [2019-12-27 15:53:46,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:53:46,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:53:46,299 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:46,299 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281267864] [2019-12-27 15:53:46,299 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:53:46,299 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:53:46,300 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1254406627] [2019-12-27 15:53:46,300 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:53:46,319 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:53:46,495 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 200 states and 313 transitions. [2019-12-27 15:53:46,496 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:53:46,496 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:53:46,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:53:46,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:53:46,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:53:46,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:53:46,497 INFO L87 Difference]: Start difference. First operand 30761 states and 95028 transitions. Second operand 3 states. [2019-12-27 15:53:46,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:53:46,602 INFO L93 Difference]: Finished difference Result 30760 states and 95026 transitions. [2019-12-27 15:53:46,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:53:46,603 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 15:53:46,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:53:46,647 INFO L225 Difference]: With dead ends: 30760 [2019-12-27 15:53:46,647 INFO L226 Difference]: Without dead ends: 30760 [2019-12-27 15:53:46,647 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:53:46,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30760 states. [2019-12-27 15:53:47,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30760 to 25846. [2019-12-27 15:53:47,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25846 states. [2019-12-27 15:53:47,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25846 states to 25846 states and 81257 transitions. [2019-12-27 15:53:47,137 INFO L78 Accepts]: Start accepts. Automaton has 25846 states and 81257 transitions. Word has length 65 [2019-12-27 15:53:47,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:53:47,137 INFO L462 AbstractCegarLoop]: Abstraction has 25846 states and 81257 transitions. [2019-12-27 15:53:47,137 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:53:47,137 INFO L276 IsEmpty]: Start isEmpty. Operand 25846 states and 81257 transitions. [2019-12-27 15:53:47,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 15:53:47,167 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:53:47,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, 1] [2019-12-27 15:53:47,168 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:53:47,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:53:47,168 INFO L82 PathProgramCache]: Analyzing trace with hash -458333570, now seen corresponding path program 1 times [2019-12-27 15:53:47,169 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:53:47,169 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413971171] [2019-12-27 15:53:47,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:53:47,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:53:47,248 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:47,248 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413971171] [2019-12-27 15:53:47,248 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:53:47,249 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:53:47,249 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1158634932] [2019-12-27 15:53:47,249 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:53:47,269 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:53:47,877 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 252 states and 426 transitions. [2019-12-27 15:53:47,877 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:53:47,892 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 15:53:47,892 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 15:53:47,893 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:53:47,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 15:53:47,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 15:53:47,893 INFO L87 Difference]: Start difference. First operand 25846 states and 81257 transitions. Second operand 4 states. [2019-12-27 15:53:48,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:53:48,181 INFO L93 Difference]: Finished difference Result 30699 states and 93865 transitions. [2019-12-27 15:53:48,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 15:53:48,181 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-27 15:53:48,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:53:48,227 INFO L225 Difference]: With dead ends: 30699 [2019-12-27 15:53:48,227 INFO L226 Difference]: Without dead ends: 30699 [2019-12-27 15:53:48,228 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:53:48,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30699 states. [2019-12-27 15:53:48,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30699 to 20851. [2019-12-27 15:53:48,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20851 states. [2019-12-27 15:53:48,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20851 states to 20851 states and 64495 transitions. [2019-12-27 15:53:48,634 INFO L78 Accepts]: Start accepts. Automaton has 20851 states and 64495 transitions. Word has length 66 [2019-12-27 15:53:48,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:53:48,634 INFO L462 AbstractCegarLoop]: Abstraction has 20851 states and 64495 transitions. [2019-12-27 15:53:48,634 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 15:53:48,634 INFO L276 IsEmpty]: Start isEmpty. Operand 20851 states and 64495 transitions. [2019-12-27 15:53:48,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 15:53:48,662 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:53:48,662 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:48,662 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:53:48,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:53:48,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1169670237, now seen corresponding path program 1 times [2019-12-27 15:53:48,663 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:53:48,663 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833145589] [2019-12-27 15:53:48,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:53:48,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:53:48,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:53:48,832 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833145589] [2019-12-27 15:53:48,832 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:53:48,833 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 15:53:48,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1362738534] [2019-12-27 15:53:48,833 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:53:48,866 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:53:49,202 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 234 states and 436 transitions. [2019-12-27 15:53:49,203 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:53:49,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 15:53:49,385 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 15:53:49,385 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 15:53:49,385 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:53:49,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 15:53:49,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2019-12-27 15:53:49,386 INFO L87 Difference]: Start difference. First operand 20851 states and 64495 transitions. Second operand 15 states. [2019-12-27 15:53:51,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:53:51,950 INFO L93 Difference]: Finished difference Result 41583 states and 127575 transitions. [2019-12-27 15:53:51,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 15:53:51,951 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2019-12-27 15:53:51,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:53:51,994 INFO L225 Difference]: With dead ends: 41583 [2019-12-27 15:53:51,994 INFO L226 Difference]: Without dead ends: 30682 [2019-12-27 15:53:51,994 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=151, Invalid=661, Unknown=0, NotChecked=0, Total=812 [2019-12-27 15:53:52,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30682 states. [2019-12-27 15:53:52,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30682 to 21675. [2019-12-27 15:53:52,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21675 states. [2019-12-27 15:53:52,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21675 states to 21675 states and 66596 transitions. [2019-12-27 15:53:52,695 INFO L78 Accepts]: Start accepts. Automaton has 21675 states and 66596 transitions. Word has length 67 [2019-12-27 15:53:52,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:53:52,695 INFO L462 AbstractCegarLoop]: Abstraction has 21675 states and 66596 transitions. [2019-12-27 15:53:52,695 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 15:53:52,695 INFO L276 IsEmpty]: Start isEmpty. Operand 21675 states and 66596 transitions. [2019-12-27 15:53:52,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 15:53:52,717 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:53:52,717 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:53:52,717 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:53:52,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:53:52,718 INFO L82 PathProgramCache]: Analyzing trace with hash 1951872541, now seen corresponding path program 2 times [2019-12-27 15:53:52,718 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:53:52,718 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824820067] [2019-12-27 15:53:52,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:53:52,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:53:53,241 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:53,241 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824820067] [2019-12-27 15:53:53,241 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:53:53,241 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 15:53:53,242 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1903781121] [2019-12-27 15:53:53,242 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:53:53,263 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:53:53,562 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 218 states and 396 transitions. [2019-12-27 15:53:53,562 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:53:54,235 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-12-27 15:53:54,236 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 22 times. [2019-12-27 15:53:54,237 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-27 15:53:54,237 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:53:54,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-27 15:53:54,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=395, Unknown=0, NotChecked=0, Total=462 [2019-12-27 15:53:54,238 INFO L87 Difference]: Start difference. First operand 21675 states and 66596 transitions. Second operand 22 states. [2019-12-27 15:54:01,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:54:01,737 INFO L93 Difference]: Finished difference Result 43004 states and 128053 transitions. [2019-12-27 15:54:01,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-12-27 15:54:01,738 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 67 [2019-12-27 15:54:01,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:54:01,790 INFO L225 Difference]: With dead ends: 43004 [2019-12-27 15:54:01,790 INFO L226 Difference]: Without dead ends: 38064 [2019-12-27 15:54:01,791 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 10 SyntacticMatches, 10 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 666 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=432, Invalid=2220, Unknown=0, NotChecked=0, Total=2652 [2019-12-27 15:54:01,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38064 states. [2019-12-27 15:54:02,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38064 to 22286. [2019-12-27 15:54:02,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22286 states. [2019-12-27 15:54:02,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22286 states to 22286 states and 68143 transitions. [2019-12-27 15:54:02,503 INFO L78 Accepts]: Start accepts. Automaton has 22286 states and 68143 transitions. Word has length 67 [2019-12-27 15:54:02,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:54:02,503 INFO L462 AbstractCegarLoop]: Abstraction has 22286 states and 68143 transitions. [2019-12-27 15:54:02,503 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-27 15:54:02,503 INFO L276 IsEmpty]: Start isEmpty. Operand 22286 states and 68143 transitions. [2019-12-27 15:54:02,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 15:54:02,524 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:54:02,524 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:54:02,524 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:54:02,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:54:02,524 INFO L82 PathProgramCache]: Analyzing trace with hash -140953989, now seen corresponding path program 3 times [2019-12-27 15:54:02,525 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:54:02,525 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661628302] [2019-12-27 15:54:02,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:54:02,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:54:02,998 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:54:02,999 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661628302] [2019-12-27 15:54:02,999 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:54:02,999 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-27 15:54:02,999 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1747934464] [2019-12-27 15:54:02,999 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:54:03,020 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:54:03,305 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 278 states and 547 transitions. [2019-12-27 15:54:03,305 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:54:04,059 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 38 [2019-12-27 15:54:04,394 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 40 times. [2019-12-27 15:54:04,394 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-12-27 15:54:04,394 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:54:04,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-12-27 15:54:04,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=519, Unknown=0, NotChecked=0, Total=600 [2019-12-27 15:54:04,395 INFO L87 Difference]: Start difference. First operand 22286 states and 68143 transitions. Second operand 25 states. [2019-12-27 15:54:11,245 WARN L192 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 26 [2019-12-27 15:54:14,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:54:14,951 INFO L93 Difference]: Finished difference Result 54964 states and 163972 transitions. [2019-12-27 15:54:14,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-12-27 15:54:14,951 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 67 [2019-12-27 15:54:14,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:54:15,010 INFO L225 Difference]: With dead ends: 54964 [2019-12-27 15:54:15,010 INFO L226 Difference]: Without dead ends: 44252 [2019-12-27 15:54:15,012 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 17 SyntacticMatches, 18 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2199 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=1130, Invalid=6010, Unknown=0, NotChecked=0, Total=7140 [2019-12-27 15:54:15,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44252 states. [2019-12-27 15:54:15,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44252 to 23604. [2019-12-27 15:54:15,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23604 states. [2019-12-27 15:54:15,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23604 states to 23604 states and 72637 transitions. [2019-12-27 15:54:15,533 INFO L78 Accepts]: Start accepts. Automaton has 23604 states and 72637 transitions. Word has length 67 [2019-12-27 15:54:15,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:54:15,533 INFO L462 AbstractCegarLoop]: Abstraction has 23604 states and 72637 transitions. [2019-12-27 15:54:15,534 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-12-27 15:54:15,534 INFO L276 IsEmpty]: Start isEmpty. Operand 23604 states and 72637 transitions. [2019-12-27 15:54:15,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 15:54:15,559 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:54:15,559 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:54:15,560 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:54:15,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:54:15,560 INFO L82 PathProgramCache]: Analyzing trace with hash -1762642019, now seen corresponding path program 4 times [2019-12-27 15:54:15,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:54:15,561 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686551098] [2019-12-27 15:54:15,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:54:15,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:54:16,008 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:54:16,008 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686551098] [2019-12-27 15:54:16,008 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:54:16,008 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 15:54:16,009 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1122726509] [2019-12-27 15:54:16,009 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:54:16,024 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:54:16,389 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 258 states and 496 transitions. [2019-12-27 15:54:16,390 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:54:17,189 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 36 times. [2019-12-27 15:54:17,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-12-27 15:54:17,190 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:54:17,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-12-27 15:54:17,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=514, Unknown=0, NotChecked=0, Total=600 [2019-12-27 15:54:17,191 INFO L87 Difference]: Start difference. First operand 23604 states and 72637 transitions. Second operand 25 states. [2019-12-27 15:54:19,745 WARN L192 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 27 [2019-12-27 15:54:37,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:54:37,670 INFO L93 Difference]: Finished difference Result 80815 states and 244443 transitions. [2019-12-27 15:54:37,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2019-12-27 15:54:37,670 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 67 [2019-12-27 15:54:37,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:54:37,756 INFO L225 Difference]: With dead ends: 80815 [2019-12-27 15:54:37,756 INFO L226 Difference]: Without dead ends: 54743 [2019-12-27 15:54:37,760 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 16 SyntacticMatches, 13 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6016 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=2405, Invalid=14887, Unknown=0, NotChecked=0, Total=17292 [2019-12-27 15:54:37,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54743 states. [2019-12-27 15:54:38,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54743 to 25216. [2019-12-27 15:54:38,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25216 states. [2019-12-27 15:54:38,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25216 states to 25216 states and 77466 transitions. [2019-12-27 15:54:38,420 INFO L78 Accepts]: Start accepts. Automaton has 25216 states and 77466 transitions. Word has length 67 [2019-12-27 15:54:38,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:54:38,420 INFO L462 AbstractCegarLoop]: Abstraction has 25216 states and 77466 transitions. [2019-12-27 15:54:38,420 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-12-27 15:54:38,421 INFO L276 IsEmpty]: Start isEmpty. Operand 25216 states and 77466 transitions. [2019-12-27 15:54:38,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 15:54:38,450 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:54:38,450 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:54:38,450 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:54:38,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:54:38,451 INFO L82 PathProgramCache]: Analyzing trace with hash -16613603, now seen corresponding path program 5 times [2019-12-27 15:54:38,451 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:54:38,452 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390517141] [2019-12-27 15:54:38,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:54:38,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:54:38,991 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:54:38,991 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390517141] [2019-12-27 15:54:38,991 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:54:38,991 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-27 15:54:38,991 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [479190663] [2019-12-27 15:54:38,992 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:54:39,002 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:54:39,192 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 250 states and 478 transitions. [2019-12-27 15:54:39,192 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:54:39,958 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 40 times. [2019-12-27 15:54:39,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-12-27 15:54:39,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:54:39,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-12-27 15:54:39,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=561, Unknown=0, NotChecked=0, Total=650 [2019-12-27 15:54:39,959 INFO L87 Difference]: Start difference. First operand 25216 states and 77466 transitions. Second operand 26 states. [2019-12-27 15:54:42,546 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 22 [2019-12-27 15:54:53,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:54:53,952 INFO L93 Difference]: Finished difference Result 51139 states and 152795 transitions. [2019-12-27 15:54:53,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-12-27 15:54:53,953 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 67 [2019-12-27 15:54:53,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:54:54,031 INFO L225 Difference]: With dead ends: 51139 [2019-12-27 15:54:54,032 INFO L226 Difference]: Without dead ends: 49892 [2019-12-27 15:54:54,034 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 18 SyntacticMatches, 16 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2351 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1062, Invalid=6248, Unknown=0, NotChecked=0, Total=7310 [2019-12-27 15:54:54,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49892 states. [2019-12-27 15:54:54,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49892 to 25177. [2019-12-27 15:54:54,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25177 states. [2019-12-27 15:54:54,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25177 states to 25177 states and 77353 transitions. [2019-12-27 15:54:54,656 INFO L78 Accepts]: Start accepts. Automaton has 25177 states and 77353 transitions. Word has length 67 [2019-12-27 15:54:54,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:54:54,656 INFO L462 AbstractCegarLoop]: Abstraction has 25177 states and 77353 transitions. [2019-12-27 15:54:54,657 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-12-27 15:54:54,657 INFO L276 IsEmpty]: Start isEmpty. Operand 25177 states and 77353 transitions. [2019-12-27 15:54:54,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 15:54:54,685 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:54:54,685 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:54:54,685 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:54:54,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:54:54,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1760600733, now seen corresponding path program 6 times [2019-12-27 15:54:54,686 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:54:54,686 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256640220] [2019-12-27 15:54:54,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:54:54,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:54:55,367 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:54:55,367 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256640220] [2019-12-27 15:54:55,368 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:54:55,368 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 15:54:55,368 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [157453600] [2019-12-27 15:54:55,368 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:54:55,385 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:54:55,617 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 212 states and 377 transitions. [2019-12-27 15:54:55,617 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:54:56,239 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-12-27 15:54:56,240 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 22 times. [2019-12-27 15:54:56,241 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-27 15:54:56,241 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:54:56,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-27 15:54:56,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=367, Unknown=0, NotChecked=0, Total=420 [2019-12-27 15:54:56,242 INFO L87 Difference]: Start difference. First operand 25177 states and 77353 transitions. Second operand 21 states. [2019-12-27 15:55:04,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:55:04,202 INFO L93 Difference]: Finished difference Result 55772 states and 167494 transitions. [2019-12-27 15:55:04,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-12-27 15:55:04,203 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 67 [2019-12-27 15:55:04,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:55:04,285 INFO L225 Difference]: With dead ends: 55772 [2019-12-27 15:55:04,285 INFO L226 Difference]: Without dead ends: 52848 [2019-12-27 15:55:04,286 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 12 SyntacticMatches, 8 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1154 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=658, Invalid=3898, Unknown=0, NotChecked=0, Total=4556 [2019-12-27 15:55:04,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52848 states. [2019-12-27 15:55:05,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52848 to 28825. [2019-12-27 15:55:05,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28825 states. [2019-12-27 15:55:05,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28825 states to 28825 states and 87994 transitions. [2019-12-27 15:55:05,218 INFO L78 Accepts]: Start accepts. Automaton has 28825 states and 87994 transitions. Word has length 67 [2019-12-27 15:55:05,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:55:05,218 INFO L462 AbstractCegarLoop]: Abstraction has 28825 states and 87994 transitions. [2019-12-27 15:55:05,218 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-27 15:55:05,218 INFO L276 IsEmpty]: Start isEmpty. Operand 28825 states and 87994 transitions. [2019-12-27 15:55:05,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 15:55:05,248 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:55:05,248 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:05,248 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:55:05,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:55:05,249 INFO L82 PathProgramCache]: Analyzing trace with hash 1382764467, now seen corresponding path program 7 times [2019-12-27 15:55:05,249 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:55:05,249 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287491063] [2019-12-27 15:55:05,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:55:05,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:55:05,711 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:55:05,711 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287491063] [2019-12-27 15:55:05,711 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:55:05,711 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 15:55:05,712 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1180011147] [2019-12-27 15:55:05,712 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:55:05,726 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:55:06,082 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 293 states and 576 transitions. [2019-12-27 15:55:06,082 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:55:06,580 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 32 times. [2019-12-27 15:55:06,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-27 15:55:06,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:55:06,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-27 15:55:06,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2019-12-27 15:55:06,581 INFO L87 Difference]: Start difference. First operand 28825 states and 87994 transitions. Second operand 22 states. [2019-12-27 15:55:16,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:55:16,708 INFO L93 Difference]: Finished difference Result 65846 states and 196581 transitions. [2019-12-27 15:55:16,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-12-27 15:55:16,709 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 67 [2019-12-27 15:55:16,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:55:16,778 INFO L225 Difference]: With dead ends: 65846 [2019-12-27 15:55:16,779 INFO L226 Difference]: Without dead ends: 49605 [2019-12-27 15:55:16,781 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 17 SyntacticMatches, 12 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2883 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1444, Invalid=8062, Unknown=0, NotChecked=0, Total=9506 [2019-12-27 15:55:16,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49605 states. [2019-12-27 15:55:17,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49605 to 25087. [2019-12-27 15:55:17,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25087 states. [2019-12-27 15:55:17,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25087 states to 25087 states and 77223 transitions. [2019-12-27 15:55:17,383 INFO L78 Accepts]: Start accepts. Automaton has 25087 states and 77223 transitions. Word has length 67 [2019-12-27 15:55:17,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:55:17,383 INFO L462 AbstractCegarLoop]: Abstraction has 25087 states and 77223 transitions. [2019-12-27 15:55:17,383 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-27 15:55:17,383 INFO L276 IsEmpty]: Start isEmpty. Operand 25087 states and 77223 transitions. [2019-12-27 15:55:17,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 15:55:17,412 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:55:17,412 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:55:17,412 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:55:17,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:55:17,413 INFO L82 PathProgramCache]: Analyzing trace with hash -906648419, now seen corresponding path program 8 times [2019-12-27 15:55:17,413 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:55:17,413 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680091875] [2019-12-27 15:55:17,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:55:17,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:55:17,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:55:17,626 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680091875] [2019-12-27 15:55:17,626 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:55:17,627 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 15:55:17,627 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1869412236] [2019-12-27 15:55:17,627 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:55:17,641 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:55:17,843 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 238 states and 456 transitions. [2019-12-27 15:55:17,843 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:55:18,336 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 34 times. [2019-12-27 15:55:18,336 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 15:55:18,336 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:55:18,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 15:55:18,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2019-12-27 15:55:18,337 INFO L87 Difference]: Start difference. First operand 25087 states and 77223 transitions. Second operand 18 states. [2019-12-27 15:55:23,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:55:23,715 INFO L93 Difference]: Finished difference Result 59892 states and 182748 transitions. [2019-12-27 15:55:23,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-12-27 15:55:23,716 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 67 [2019-12-27 15:55:23,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:55:23,791 INFO L225 Difference]: With dead ends: 59892 [2019-12-27 15:55:23,791 INFO L226 Difference]: Without dead ends: 53506 [2019-12-27 15:55:23,792 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 17 SyntacticMatches, 12 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1406 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=858, Invalid=4112, Unknown=0, NotChecked=0, Total=4970 [2019-12-27 15:55:24,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53506 states. [2019-12-27 15:55:24,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53506 to 29201. [2019-12-27 15:55:24,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29201 states. [2019-12-27 15:55:24,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29201 states to 29201 states and 89642 transitions. [2019-12-27 15:55:24,672 INFO L78 Accepts]: Start accepts. Automaton has 29201 states and 89642 transitions. Word has length 67 [2019-12-27 15:55:24,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:55:24,672 INFO L462 AbstractCegarLoop]: Abstraction has 29201 states and 89642 transitions. [2019-12-27 15:55:24,672 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 15:55:24,672 INFO L276 IsEmpty]: Start isEmpty. Operand 29201 states and 89642 transitions. [2019-12-27 15:55:24,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 15:55:24,705 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:55:24,705 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:55:24,705 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:55:24,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:55:24,706 INFO L82 PathProgramCache]: Analyzing trace with hash -1284484685, now seen corresponding path program 9 times [2019-12-27 15:55:24,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:55:24,706 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840428781] [2019-12-27 15:55:24,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:55:24,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:55:24,900 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:55:24,901 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840428781] [2019-12-27 15:55:24,901 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:55:24,901 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 15:55:24,901 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [858184947] [2019-12-27 15:55:24,901 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:55:24,911 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:55:25,169 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 325 states and 670 transitions. [2019-12-27 15:55:25,169 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:55:25,703 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 44 times. [2019-12-27 15:55:25,703 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-27 15:55:25,703 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:55:25,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-27 15:55:25,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2019-12-27 15:55:25,704 INFO L87 Difference]: Start difference. First operand 29201 states and 89642 transitions. Second operand 19 states. [2019-12-27 15:55:31,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:55:31,033 INFO L93 Difference]: Finished difference Result 54818 states and 165218 transitions. [2019-12-27 15:55:31,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-12-27 15:55:31,034 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 67 [2019-12-27 15:55:31,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:55:31,101 INFO L225 Difference]: With dead ends: 54818 [2019-12-27 15:55:31,101 INFO L226 Difference]: Without dead ends: 46766 [2019-12-27 15:55:31,102 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 22 SyntacticMatches, 16 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1008 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=694, Invalid=2966, Unknown=0, NotChecked=0, Total=3660 [2019-12-27 15:55:31,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46766 states. [2019-12-27 15:55:31,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46766 to 22976. [2019-12-27 15:55:31,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22976 states. [2019-12-27 15:55:31,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22976 states to 22976 states and 70663 transitions. [2019-12-27 15:55:31,830 INFO L78 Accepts]: Start accepts. Automaton has 22976 states and 70663 transitions. Word has length 67 [2019-12-27 15:55:31,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:55:31,831 INFO L462 AbstractCegarLoop]: Abstraction has 22976 states and 70663 transitions. [2019-12-27 15:55:31,831 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-27 15:55:31,831 INFO L276 IsEmpty]: Start isEmpty. Operand 22976 states and 70663 transitions. [2019-12-27 15:55:31,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 15:55:31,853 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:55:31,853 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:55:31,853 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:55:31,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:55:31,853 INFO L82 PathProgramCache]: Analyzing trace with hash 656134515, now seen corresponding path program 10 times [2019-12-27 15:55:31,854 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:55:31,854 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690323664] [2019-12-27 15:55:31,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:55:31,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 15:55:31,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 15:55:32,001 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 15:55:32,001 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 15:55:32,007 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [900] [900] ULTIMATE.startENTRY-->L835: Formula: (let ((.cse0 (store |v_#valid_72| 0 0))) (and (= v_~a$r_buff1_thd0~0_203 0) (= 0 v_~a$r_buff1_thd1~0_191) (= v_~z~0_36 0) (= 0 |v_ULTIMATE.start_main_~#t281~0.offset_26|) (= v_~a$r_buff0_thd0~0_228 0) (= 0 v_~a$r_buff0_thd1~0_317) (= 0 v_~a$read_delayed_var~0.base_8) (= 0 v_~a$r_buff0_thd2~0_205) (= v_~main$tmp_guard1~0_42 0) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t281~0.base_37|) (= v_~a$r_buff0_thd3~0_430 0) (= v_~main$tmp_guard0~0_25 0) (= 0 v_~__unbuffered_p2_EAX~0_47) (= (select .cse0 |v_ULTIMATE.start_main_~#t281~0.base_37|) 0) (= v_~__unbuffered_cnt~0_111 0) (< 0 |v_#StackHeapBarrier_15|) (= 0 v_~x~0_176) (= v_~__unbuffered_p1_EBX~0_55 0) (= 0 v_~__unbuffered_p1_EAX~0_54) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t281~0.base_37| 4)) (= |v_#valid_70| (store .cse0 |v_ULTIMATE.start_main_~#t281~0.base_37| 1)) (= 0 |v_#NULL.base_4|) (= v_~a$mem_tmp~0_16 0) (= 0 v_~a$w_buff0_used~0_889) (= v_~a$w_buff0~0_416 0) (= v_~a$r_buff1_thd3~0_333 0) (= 0 v_~a$w_buff1_used~0_596) (= |v_#NULL.offset_4| 0) (= 0 v_~a$w_buff1~0_333) (= 0 v_~a$r_buff1_thd2~0_185) (= v_~a~0_191 0) (= v_~a$read_delayed_var~0.offset_8 0) (= v_~__unbuffered_p2_EBX~0_48 0) (= 0 v_~weak$$choice0~0_13) (= v_~weak$$choice2~0_131 0) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t281~0.base_37| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t281~0.base_37|) |v_ULTIMATE.start_main_~#t281~0.offset_26| 0)) |v_#memory_int_23|) (= v_~y~0_31 0) (= 0 v_~a$read_delayed~0_8) (= v_~a$flush_delayed~0_26 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_24|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_~#t282~0.base=|v_ULTIMATE.start_main_~#t282~0.base_38|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_185, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_51|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_59|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_228, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_127|, ~a~0=v_~a~0_191, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_83|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_54, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_47, ULTIMATE.start_main_~#t283~0.offset=|v_ULTIMATE.start_main_~#t283~0.offset_18|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_48, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_10|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_333, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_889, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_317, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_8, ~a$w_buff0~0=v_~a$w_buff0~0_416, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_203, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_111, ~x~0=v_~x~0_176, ~a$read_delayed~0=v_~a$read_delayed~0_8, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_205, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_42, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_67|, ~a$mem_tmp~0=v_~a$mem_tmp~0_16, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_43|, ~a$w_buff1~0=v_~a$w_buff1~0_333, ULTIMATE.start_main_~#t283~0.base=|v_ULTIMATE.start_main_~#t283~0.base_30|, ~y~0=v_~y~0_31, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_55, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_23|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_191, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_430, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_25, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_~#t282~0.offset=|v_ULTIMATE.start_main_~#t282~0.offset_26|, ULTIMATE.start_main_~#t281~0.base=|v_ULTIMATE.start_main_~#t281~0.base_37|, ~a$flush_delayed~0=v_~a$flush_delayed~0_26, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_25|, #valid=|v_#valid_70|, #memory_int=|v_#memory_int_23|, ~z~0=v_~z~0_36, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_596, ~weak$$choice2~0=v_~weak$$choice2~0_131, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_8, ULTIMATE.start_main_~#t281~0.offset=|v_ULTIMATE.start_main_~#t281~0.offset_26|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t282~0.base, ~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_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t283~0.offset, ~__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, ~a$read_delayed~0, ~a$r_buff0_thd2~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~a$mem_tmp~0, ULTIMATE.start_main_#t~ite51, ~a$w_buff1~0, ULTIMATE.start_main_~#t283~0.base, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ~a$r_buff1_thd1~0, ~a$r_buff0_thd3~0, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_~#t282~0.offset, ULTIMATE.start_main_~#t281~0.base, ~a$flush_delayed~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~a$w_buff1_used~0, ~weak$$choice2~0, ~a$read_delayed_var~0.base, ULTIMATE.start_main_~#t281~0.offset] because there is no mapped edge [2019-12-27 15:55:32,008 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [868] [868] L835-1-->L837: Formula: (and (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t282~0.base_13|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t282~0.base_13| 4)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t282~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t282~0.base_13|) |v_ULTIMATE.start_main_~#t282~0.offset_11| 1)) |v_#memory_int_15|) (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t282~0.base_13| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t282~0.base_13|)) (= 0 |v_ULTIMATE.start_main_~#t282~0.offset_11|) (= (select |v_#valid_41| |v_ULTIMATE.start_main_~#t282~0.base_13|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t282~0.base=|v_ULTIMATE.start_main_~#t282~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|, ULTIMATE.start_main_~#t282~0.offset=|v_ULTIMATE.start_main_~#t282~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t282~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length, ULTIMATE.start_main_~#t282~0.offset] because there is no mapped edge [2019-12-27 15:55:32,009 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L4-->L750: Formula: (and (= v_~a$r_buff0_thd1~0_28 v_~a$r_buff1_thd1~0_23) (= v_~a$r_buff0_thd2~0_20 v_~a$r_buff1_thd2~0_16) (= v_~a$r_buff0_thd0~0_18 v_~a$r_buff1_thd0~0_17) (not (= v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_10 0)) (= v_~a$r_buff0_thd1~0_27 1) (= 1 v_~x~0_7) (= v_~a$r_buff0_thd3~0_73 v_~a$r_buff1_thd3~0_40)) InVars {~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_20, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_73, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_10, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_28, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_18} OutVars{~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_23, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_40, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_16, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_20, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_17, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_73, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_10, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_27, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_18, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[~a$r_buff1_thd1~0, ~a$r_buff1_thd3~0, ~a$r_buff1_thd2~0, ~a$r_buff1_thd0~0, ~a$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-27 15:55:32,012 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L776-2-->L776-4: Formula: (let ((.cse0 (= (mod ~a$w_buff1_used~0_In1261508802 256) 0)) (.cse1 (= (mod ~a$r_buff1_thd2~0_In1261508802 256) 0))) (or (and (= ~a~0_In1261508802 |P1Thread1of1ForFork2_#t~ite9_Out1261508802|) (or .cse0 .cse1)) (and (not .cse0) (= ~a$w_buff1~0_In1261508802 |P1Thread1of1ForFork2_#t~ite9_Out1261508802|) (not .cse1)))) InVars {~a~0=~a~0_In1261508802, ~a$w_buff1~0=~a$w_buff1~0_In1261508802, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1261508802, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1261508802} OutVars{~a~0=~a~0_In1261508802, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out1261508802|, ~a$w_buff1~0=~a$w_buff1~0_In1261508802, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1261508802, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1261508802} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-27 15:55:32,013 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L776-4-->L777: Formula: (= |v_P1Thread1of1ForFork2_#t~ite9_16| v_~a~0_47) InVars {P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_16|} OutVars{~a~0=v_~a~0_47, P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_15|, P1Thread1of1ForFork2_#t~ite10=|v_P1Thread1of1ForFork2_#t~ite10_25|} AuxVars[] AssignedVars[~a~0, P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-27 15:55:32,013 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L751-->L751-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In511868850 256))) (.cse1 (= (mod ~a$r_buff0_thd1~0_In511868850 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P0Thread1of1ForFork1_#t~ite5_Out511868850|)) (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In511868850 |P0Thread1of1ForFork1_#t~ite5_Out511868850|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In511868850, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In511868850} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out511868850|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In511868850, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In511868850} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-27 15:55:32,014 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L752-->L752-2: Formula: (let ((.cse2 (= 0 (mod ~a$r_buff1_thd1~0_In1662666450 256))) (.cse3 (= 0 (mod ~a$w_buff1_used~0_In1662666450 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd1~0_In1662666450 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In1662666450 256)))) (or (and (= ~a$w_buff1_used~0_In1662666450 |P0Thread1of1ForFork1_#t~ite6_Out1662666450|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |P0Thread1of1ForFork1_#t~ite6_Out1662666450| 0)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1662666450, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1662666450, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1662666450, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1662666450} OutVars{P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out1662666450|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1662666450, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1662666450, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1662666450, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1662666450} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-27 15:55:32,014 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L753-->L754: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In-1778089502 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd1~0_In-1778089502 256)))) (or (and (not .cse0) (not .cse1) (= ~a$r_buff0_thd1~0_Out-1778089502 0)) (and (= ~a$r_buff0_thd1~0_In-1778089502 ~a$r_buff0_thd1~0_Out-1778089502) (or .cse0 .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1778089502, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1778089502} OutVars{P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out-1778089502|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1778089502, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out-1778089502} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 15:55:32,014 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L754-->L754-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff1_used~0_In-1316257874 256))) (.cse1 (= (mod ~a$r_buff1_thd1~0_In-1316257874 256) 0)) (.cse3 (= (mod ~a$w_buff0_used~0_In-1316257874 256) 0)) (.cse2 (= (mod ~a$r_buff0_thd1~0_In-1316257874 256) 0))) (or (and (= |P0Thread1of1ForFork1_#t~ite8_Out-1316257874| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= |P0Thread1of1ForFork1_#t~ite8_Out-1316257874| ~a$r_buff1_thd1~0_In-1316257874) (or .cse3 .cse2)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1316257874, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1316257874, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1316257874, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1316257874} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-1316257874|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1316257874, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1316257874, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1316257874, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1316257874} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 15:55:32,015 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] L754-2-->P0EXIT: Formula: (and (= v_~a$r_buff1_thd1~0_148 |v_P0Thread1of1ForFork1_#t~ite8_52|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|) (= v_~__unbuffered_cnt~0_77 (+ v_~__unbuffered_cnt~0_78 1))) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_52|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_78} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_51|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_148, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_77} 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:55:32,015 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [861] [861] L837-1-->L839: Formula: (and (= (select |v_#valid_37| |v_ULTIMATE.start_main_~#t283~0.base_12|) 0) (= |v_ULTIMATE.start_main_~#t283~0.offset_10| 0) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t283~0.base_12| 4) |v_#length_15|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t283~0.base_12|) (not (= |v_ULTIMATE.start_main_~#t283~0.base_12| 0)) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t283~0.base_12| 1)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t283~0.base_12| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t283~0.base_12|) |v_ULTIMATE.start_main_~#t283~0.offset_10| 2)) |v_#memory_int_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_36|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_6|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t283~0.base=|v_ULTIMATE.start_main_~#t283~0.base_12|, #length=|v_#length_15|, ULTIMATE.start_main_~#t283~0.offset=|v_ULTIMATE.start_main_~#t283~0.offset_10|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet45, #memory_int, ULTIMATE.start_main_~#t283~0.base, #length, ULTIMATE.start_main_~#t283~0.offset] because there is no mapped edge [2019-12-27 15:55:32,017 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [876] [876] L801-->L801-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-212332092 256)))) (or (and (let ((.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In-212332092 256)))) (or (and .cse0 (= 0 (mod ~a$w_buff1_used~0_In-212332092 256))) (= 0 (mod ~a$w_buff0_used~0_In-212332092 256)) (and (= 0 (mod ~a$r_buff1_thd3~0_In-212332092 256)) .cse0))) .cse1 (= |P2Thread1of1ForFork0_#t~ite20_Out-212332092| |P2Thread1of1ForFork0_#t~ite21_Out-212332092|) (= |P2Thread1of1ForFork0_#t~ite20_Out-212332092| ~a$w_buff0~0_In-212332092)) (and (= |P2Thread1of1ForFork0_#t~ite21_Out-212332092| ~a$w_buff0~0_In-212332092) (= |P2Thread1of1ForFork0_#t~ite20_In-212332092| |P2Thread1of1ForFork0_#t~ite20_Out-212332092|) (not .cse1)))) InVars {~a$w_buff0~0=~a$w_buff0~0_In-212332092, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-212332092, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-212332092, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-212332092, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-212332092, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_In-212332092|, ~weak$$choice2~0=~weak$$choice2~0_In-212332092} OutVars{P2Thread1of1ForFork0_#t~ite21=|P2Thread1of1ForFork0_#t~ite21_Out-212332092|, ~a$w_buff0~0=~a$w_buff0~0_In-212332092, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-212332092, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-212332092, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-212332092, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_Out-212332092|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-212332092, ~weak$$choice2~0=~weak$$choice2~0_In-212332092} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite20] because there is no mapped edge [2019-12-27 15:55:32,019 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [878] [878] L803-->L803-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In1910805506 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite27_Out1910805506| |P2Thread1of1ForFork0_#t~ite26_Out1910805506|) (= ~a$w_buff0_used~0_In1910805506 |P2Thread1of1ForFork0_#t~ite26_Out1910805506|) (let ((.cse0 (= (mod ~a$r_buff0_thd3~0_In1910805506 256) 0))) (or (and .cse0 (= 0 (mod ~a$r_buff1_thd3~0_In1910805506 256))) (and .cse0 (= 0 (mod ~a$w_buff1_used~0_In1910805506 256))) (= 0 (mod ~a$w_buff0_used~0_In1910805506 256)))) .cse1) (and (not .cse1) (= |P2Thread1of1ForFork0_#t~ite27_Out1910805506| ~a$w_buff0_used~0_In1910805506) (= |P2Thread1of1ForFork0_#t~ite26_In1910805506| |P2Thread1of1ForFork0_#t~ite26_Out1910805506|)))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In1910805506|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1910805506, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1910805506, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1910805506, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1910805506, ~weak$$choice2~0=~weak$$choice2~0_In1910805506} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out1910805506|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out1910805506|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1910805506, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1910805506, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1910805506, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1910805506, ~weak$$choice2~0=~weak$$choice2~0_In1910805506} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-27 15:55:32,020 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L804-->L804-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1924780661 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite29_In-1924780661| |P2Thread1of1ForFork0_#t~ite29_Out-1924780661|) (not .cse0) (= ~a$w_buff1_used~0_In-1924780661 |P2Thread1of1ForFork0_#t~ite30_Out-1924780661|)) (and (= |P2Thread1of1ForFork0_#t~ite29_Out-1924780661| |P2Thread1of1ForFork0_#t~ite30_Out-1924780661|) (= ~a$w_buff1_used~0_In-1924780661 |P2Thread1of1ForFork0_#t~ite29_Out-1924780661|) .cse0 (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In-1924780661 256) 0))) (or (and (= 0 (mod ~a$w_buff1_used~0_In-1924780661 256)) .cse1) (= 0 (mod ~a$w_buff0_used~0_In-1924780661 256)) (and (= 0 (mod ~a$r_buff1_thd3~0_In-1924780661 256)) .cse1)))))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1924780661, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1924780661, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1924780661, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1924780661, ~weak$$choice2~0=~weak$$choice2~0_In-1924780661, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_In-1924780661|} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1924780661, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1924780661, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1924780661, P2Thread1of1ForFork0_#t~ite30=|P2Thread1of1ForFork0_#t~ite30_Out-1924780661|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1924780661, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out-1924780661|, ~weak$$choice2~0=~weak$$choice2~0_In-1924780661} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite30, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 15:55:32,021 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [813] [813] L805-->L806: Formula: (and (not (= (mod v_~weak$$choice2~0_32 256) 0)) (= v_~a$r_buff0_thd3~0_136 v_~a$r_buff0_thd3~0_135)) InVars {~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_136, ~weak$$choice2~0=v_~weak$$choice2~0_32} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_9|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_11|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_135, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_12|, ~weak$$choice2~0=v_~weak$$choice2~0_32} 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:55:32,022 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [796] [796] L808-->L812: Formula: (and (= v_~a$flush_delayed~0_12 0) (= v_~a~0_57 v_~a$mem_tmp~0_6) (not (= (mod v_~a$flush_delayed~0_13 256) 0))) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_6, ~a$flush_delayed~0=v_~a$flush_delayed~0_13} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_13|, ~a~0=v_~a~0_57, ~a$mem_tmp~0=v_~a$mem_tmp~0_6, ~a$flush_delayed~0=v_~a$flush_delayed~0_12} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~a~0, ~a$flush_delayed~0] because there is no mapped edge [2019-12-27 15:55:32,023 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [822] [822] L812-2-->L812-4: Formula: (let ((.cse0 (= (mod ~a$r_buff1_thd3~0_In-439061420 256) 0)) (.cse1 (= (mod ~a$w_buff1_used~0_In-439061420 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite38_Out-439061420| ~a~0_In-439061420)) (and (not .cse0) (not .cse1) (= ~a$w_buff1~0_In-439061420 |P2Thread1of1ForFork0_#t~ite38_Out-439061420|)))) InVars {~a~0=~a~0_In-439061420, ~a$w_buff1~0=~a$w_buff1~0_In-439061420, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-439061420, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-439061420} OutVars{~a~0=~a~0_In-439061420, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out-439061420|, ~a$w_buff1~0=~a$w_buff1~0_In-439061420, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-439061420, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-439061420} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 15:55:32,023 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L812-4-->L813: Formula: (= v_~a~0_20 |v_P2Thread1of1ForFork0_#t~ite38_10|) InVars {P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_10|} OutVars{~a~0=v_~a~0_20, P2Thread1of1ForFork0_#t~ite39=|v_P2Thread1of1ForFork0_#t~ite39_13|, P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_9|} AuxVars[] AssignedVars[~a~0, P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 15:55:32,024 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L813-->L813-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In1443395898 256) 0)) (.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In1443395898 256)))) (or (and (= ~a$w_buff0_used~0_In1443395898 |P2Thread1of1ForFork0_#t~ite40_Out1443395898|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |P2Thread1of1ForFork0_#t~ite40_Out1443395898|) (not .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1443395898, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1443395898} OutVars{P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out1443395898|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1443395898, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1443395898} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-27 15:55:32,025 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] L814-->L814-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In-223245446 256) 0)) (.cse0 (= (mod ~a$w_buff0_used~0_In-223245446 256) 0)) (.cse2 (= 0 (mod ~a$w_buff1_used~0_In-223245446 256))) (.cse3 (= 0 (mod ~a$r_buff1_thd3~0_In-223245446 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite41_Out-223245446| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork0_#t~ite41_Out-223245446| ~a$w_buff1_used~0_In-223245446) (or .cse2 .cse3)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-223245446, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-223245446, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-223245446, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-223245446} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-223245446, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-223245446, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-223245446, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-223245446, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out-223245446|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-27 15:55:32,025 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L815-->L815-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In1572020554 256))) (.cse0 (= (mod ~a$w_buff0_used~0_In1572020554 256) 0))) (or (and (or .cse0 .cse1) (= ~a$r_buff0_thd3~0_In1572020554 |P2Thread1of1ForFork0_#t~ite42_Out1572020554|)) (and (= 0 |P2Thread1of1ForFork0_#t~ite42_Out1572020554|) (not .cse1) (not .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1572020554, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1572020554} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In1572020554, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1572020554, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out1572020554|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-27 15:55:32,026 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L816-->L816-2: Formula: (let ((.cse2 (= 0 (mod ~a$r_buff1_thd3~0_In414187913 256))) (.cse3 (= 0 (mod ~a$w_buff1_used~0_In414187913 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In414187913 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In414187913 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite43_Out414187913| 0)) (and (= |P2Thread1of1ForFork0_#t~ite43_Out414187913| ~a$r_buff1_thd3~0_In414187913) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In414187913, ~a$w_buff0_used~0=~a$w_buff0_used~0_In414187913, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In414187913, ~a$w_buff1_used~0=~a$w_buff1_used~0_In414187913} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out414187913|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In414187913, ~a$w_buff0_used~0=~a$w_buff0_used~0_In414187913, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In414187913, ~a$w_buff1_used~0=~a$w_buff1_used~0_In414187913} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-27 15:55:32,026 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L816-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= (+ v_~__unbuffered_cnt~0_48 1) v_~__unbuffered_cnt~0_47) (= v_~a$r_buff1_thd3~0_122 |v_P2Thread1of1ForFork0_#t~ite43_34|)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_33|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_122, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47, 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:55:32,026 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L777-->L777-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In1760864150 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In1760864150 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite11_Out1760864150| 0) (not .cse0) (not .cse1)) (and (= |P1Thread1of1ForFork2_#t~ite11_Out1760864150| ~a$w_buff0_used~0_In1760864150) (or .cse0 .cse1)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1760864150, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1760864150} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1760864150, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1760864150, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out1760864150|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 15:55:32,027 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L778-->L778-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff1_thd2~0_In-514585600 256))) (.cse1 (= (mod ~a$w_buff1_used~0_In-514585600 256) 0)) (.cse2 (= 0 (mod ~a$r_buff0_thd2~0_In-514585600 256))) (.cse3 (= 0 (mod ~a$w_buff0_used~0_In-514585600 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite12_Out-514585600| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~a$w_buff1_used~0_In-514585600 |P1Thread1of1ForFork2_#t~ite12_Out-514585600|)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-514585600, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-514585600, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-514585600, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-514585600} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-514585600, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-514585600, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-514585600, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-514585600|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-514585600} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-27 15:55:32,028 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L779-->L779-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In1441060148 256) 0)) (.cse1 (= (mod ~a$r_buff0_thd2~0_In1441060148 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite13_Out1441060148| 0) (not .cse0) (not .cse1)) (and (= ~a$r_buff0_thd2~0_In1441060148 |P1Thread1of1ForFork2_#t~ite13_Out1441060148|) (or .cse0 .cse1)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1441060148, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1441060148} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1441060148, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1441060148, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out1441060148|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-27 15:55:32,028 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L780-->L780-2: Formula: (let ((.cse3 (= 0 (mod ~a$w_buff0_used~0_In651510059 256))) (.cse2 (= (mod ~a$r_buff0_thd2~0_In651510059 256) 0)) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In651510059 256))) (.cse0 (= (mod ~a$r_buff1_thd2~0_In651510059 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite14_Out651510059| ~a$r_buff1_thd2~0_In651510059) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P1Thread1of1ForFork2_#t~ite14_Out651510059| 0)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In651510059, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In651510059, ~a$w_buff0_used~0=~a$w_buff0_used~0_In651510059, ~a$w_buff1_used~0=~a$w_buff1_used~0_In651510059} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In651510059, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In651510059, ~a$w_buff0_used~0=~a$w_buff0_used~0_In651510059, ~a$w_buff1_used~0=~a$w_buff1_used~0_In651510059, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out651510059|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 15:55:32,029 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [855] [855] L780-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork2_#t~ite14_24| v_~a$r_buff1_thd2~0_79) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_54 1) v_~__unbuffered_cnt~0_53) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_24|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_79, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_53, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_23|, 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:55:32,029 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L839-1-->L845: Formula: (and (= 3 v_~__unbuffered_cnt~0_13) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 15:55:32,030 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L845-2-->L845-4: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff1_thd0~0_In892430031 256))) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In892430031 256)))) (or (and (= |ULTIMATE.start_main_#t~ite47_Out892430031| ~a$w_buff1~0_In892430031) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite47_Out892430031| ~a~0_In892430031) (or .cse0 .cse1)))) InVars {~a~0=~a~0_In892430031, ~a$w_buff1~0=~a$w_buff1~0_In892430031, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In892430031, ~a$w_buff1_used~0=~a$w_buff1_used~0_In892430031} OutVars{~a~0=~a~0_In892430031, ~a$w_buff1~0=~a$w_buff1~0_In892430031, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out892430031|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In892430031, ~a$w_buff1_used~0=~a$w_buff1_used~0_In892430031} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-27 15:55:32,030 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L845-4-->L846: Formula: (= v_~a~0_30 |v_ULTIMATE.start_main_#t~ite47_13|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_13|} OutVars{~a~0=v_~a~0_30, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_12|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_16|} AuxVars[] AssignedVars[~a~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 15:55:32,030 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L846-->L846-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd0~0_In449758443 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In449758443 256)))) (or (and (= |ULTIMATE.start_main_#t~ite49_Out449758443| ~a$w_buff0_used~0_In449758443) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite49_Out449758443| 0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In449758443, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In449758443} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In449758443, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out449758443|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In449758443} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 15:55:32,031 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L847-->L847-2: Formula: (let ((.cse2 (= 0 (mod ~a$r_buff1_thd0~0_In1636305463 256))) (.cse3 (= (mod ~a$w_buff1_used~0_In1636305463 256) 0)) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In1636305463 256))) (.cse1 (= (mod ~a$r_buff0_thd0~0_In1636305463 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite50_Out1636305463|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~a$w_buff1_used~0_In1636305463 |ULTIMATE.start_main_#t~ite50_Out1636305463|)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1636305463, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1636305463, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1636305463, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1636305463} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out1636305463|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1636305463, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1636305463, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1636305463, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1636305463} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 15:55:32,031 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L848-->L848-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In1305897271 256))) (.cse0 (= (mod ~a$r_buff0_thd0~0_In1305897271 256) 0))) (or (and (or .cse0 .cse1) (= ~a$r_buff0_thd0~0_In1305897271 |ULTIMATE.start_main_#t~ite51_Out1305897271|)) (and (= |ULTIMATE.start_main_#t~ite51_Out1305897271| 0) (not .cse1) (not .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1305897271, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1305897271} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out1305897271|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1305897271, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1305897271} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 15:55:32,032 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L849-->L849-2: Formula: (let ((.cse2 (= 0 (mod ~a$r_buff0_thd0~0_In1226453863 256))) (.cse3 (= 0 (mod ~a$w_buff0_used~0_In1226453863 256))) (.cse1 (= (mod ~a$w_buff1_used~0_In1226453863 256) 0)) (.cse0 (= 0 (mod ~a$r_buff1_thd0~0_In1226453863 256)))) (or (and (= ~a$r_buff1_thd0~0_In1226453863 |ULTIMATE.start_main_#t~ite52_Out1226453863|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |ULTIMATE.start_main_#t~ite52_Out1226453863|)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1226453863, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1226453863, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1226453863, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1226453863} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out1226453863|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1226453863, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1226453863, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1226453863, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1226453863} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 15:55:32,032 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [887] [887] L849-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 1 v_~__unbuffered_p2_EAX~0_21) (= v_~main$tmp_guard1~0_18 0) (= 1 v_~__unbuffered_p1_EAX~0_20) (= v_~a$r_buff1_thd0~0_158 |v_ULTIMATE.start_main_#t~ite52_40|) (= 2 v_~x~0_125) (= v_~__unbuffered_p1_EBX~0_21 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_14| (mod v_~main$tmp_guard1~0_18 256)) (= v_~__unbuffered_p2_EBX~0_24 0)) InVars {ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_40|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_21, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_24, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21, ~x~0=v_~x~0_125} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_39|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_18, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_21, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_24, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_20, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_158, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21, ~x~0=v_~x~0_125, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_14|} 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:55:32,144 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 03:55:32 BasicIcfg [2019-12-27 15:55:32,145 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 15:55:32,147 INFO L168 Benchmark]: Toolchain (without parser) took 216272.15 ms. Allocated memory was 145.8 MB in the beginning and 3.8 GB in the end (delta: 3.7 GB). Free memory was 100.9 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2019-12-27 15:55:32,148 INFO L168 Benchmark]: CDTParser took 0.47 ms. Allocated memory is still 145.8 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 15:55:32,148 INFO L168 Benchmark]: CACSL2BoogieTranslator took 778.41 ms. Allocated memory was 145.8 MB in the beginning and 204.5 MB in the end (delta: 58.7 MB). Free memory was 100.4 MB in the beginning and 157.6 MB in the end (delta: -57.1 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. [2019-12-27 15:55:32,149 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.67 ms. Allocated memory is still 204.5 MB. Free memory was 157.6 MB in the beginning and 154.8 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:55:32,149 INFO L168 Benchmark]: Boogie Preprocessor took 39.51 ms. Allocated memory is still 204.5 MB. Free memory was 154.8 MB in the beginning and 152.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 15:55:32,151 INFO L168 Benchmark]: RCFGBuilder took 874.68 ms. Allocated memory is still 204.5 MB. Free memory was 152.2 MB in the beginning and 101.8 MB in the end (delta: 50.4 MB). Peak memory consumption was 50.4 MB. Max. memory is 7.1 GB. [2019-12-27 15:55:32,152 INFO L168 Benchmark]: TraceAbstraction took 214509.76 ms. Allocated memory was 204.5 MB in the beginning and 3.8 GB in the end (delta: 3.6 GB). Free memory was 101.8 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-12-27 15:55:32,154 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.47 ms. Allocated memory is still 145.8 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 778.41 ms. Allocated memory was 145.8 MB in the beginning and 204.5 MB in the end (delta: 58.7 MB). Free memory was 100.4 MB in the beginning and 157.6 MB in the end (delta: -57.1 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 64.67 ms. Allocated memory is still 204.5 MB. Free memory was 157.6 MB in the beginning and 154.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.51 ms. Allocated memory is still 204.5 MB. Free memory was 154.8 MB in the beginning and 152.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 874.68 ms. Allocated memory is still 204.5 MB. Free memory was 152.2 MB in the beginning and 101.8 MB in the end (delta: 50.4 MB). Peak memory consumption was 50.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 214509.76 ms. Allocated memory was 204.5 MB in the beginning and 3.8 GB in the end (delta: 3.6 GB). Free memory was 101.8 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.0s, 178 ProgramPointsBefore, 94 ProgramPointsAfterwards, 215 TransitionsBefore, 103 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 8 FixpointIterations, 35 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 30 ConcurrentYvCompositions, 32 ChoiceCompositions, 7568 VarBasedMoverChecksPositive, 290 VarBasedMoverChecksNegative, 97 SemBasedMoverChecksPositive, 263 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.9s, 0 MoverChecksTotal, 90866 CheckedPairsTotal, 114 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L835] FCALL, FORK 0 pthread_create(&t281, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, 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] [L837] FCALL, FORK 0 pthread_create(&t282, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, 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, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L735] 1 a$w_buff1 = a$w_buff0 [L736] 1 a$w_buff0 = 1 [L737] 1 a$w_buff1_used = a$w_buff0_used [L738] 1 a$w_buff0_used = (_Bool)1 [L750] 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_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=1, y=0, z=0] [L764] 2 x = 2 [L767] 2 y = 1 [L770] 2 __unbuffered_p1_EAX = y [L773] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=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=2, y=1, z=0] [L776] 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_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=2, y=1, z=0] [L750] 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) [L751] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L752] 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 [L839] FCALL, FORK 0 pthread_create(&t283, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=1, __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=0, 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=2, y=1, z=0] [L790] 3 z = 1 [L793] 3 __unbuffered_p2_EAX = z [L796] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L797] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L798] 3 a$flush_delayed = weak$$choice2 [L799] 3 a$mem_tmp = a VAL [__unbuffered_cnt=1, __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_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=2, y=1, z=1] [L800] 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=1, __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_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=2, y=1, z=1] [L800] 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) [L801] 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)) [L802] 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_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_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=2, y=1, z=1] [L802] 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)) [L803] 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)) [L804] 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)) [L806] 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_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_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=2, y=1, z=1] [L806] 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)) [L807] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=1, __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_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=2, y=1, z=1] [L812] 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_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_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=2, y=1, z=1] [L813] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L814] 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 [L815] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L777] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L778] 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 [L779] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L845] 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_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_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=2, y=1, z=1] [L846] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L847] 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 [L848] 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, 169 locations, 2 error locations. Result: UNSAFE, OverallTime: 214.1s, OverallIterations: 32, TraceHistogramMax: 1, AutomataDifference: 120.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 10722 SDtfs, 20978 SDslu, 59615 SDs, 0 SdLazy, 72037 SolverSat, 1394 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 67.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1389 GetRequests, 266 SyntacticMatches, 163 SemanticMatches, 960 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20779 ImplicationChecksByTransitivity, 28.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=162755occurred 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: 45.6s AutomataMinimizationTime, 31 MinimizatonAttempts, 532572 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.0s InterpolantComputationTime, 1648 NumberOfCodeBlocks, 1648 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 1550 ConstructedInterpolants, 0 QuantifiedInterpolants, 408880 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...