/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix002_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 19:39:15,609 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 19:39:15,612 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 19:39:15,633 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 19:39:15,634 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 19:39:15,636 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 19:39:15,638 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 19:39:15,652 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 19:39:15,654 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 19:39:15,655 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 19:39:15,657 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 19:39:15,659 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 19:39:15,660 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 19:39:15,663 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 19:39:15,665 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 19:39:15,666 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 19:39:15,667 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 19:39:15,670 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 19:39:15,673 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 19:39:15,679 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 19:39:15,681 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 19:39:15,682 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 19:39:15,684 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 19:39:15,684 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 19:39:15,687 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 19:39:15,687 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 19:39:15,687 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 19:39:15,690 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 19:39:15,691 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 19:39:15,692 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 19:39:15,692 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 19:39:15,694 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 19:39:15,695 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 19:39:15,696 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 19:39:15,700 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 19:39:15,700 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 19:39:15,701 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 19:39:15,701 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 19:39:15,702 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 19:39:15,705 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 19:39:15,706 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 19:39:15,707 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf [2019-12-27 19:39:15,728 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 19:39:15,728 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 19:39:15,730 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 19:39:15,731 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 19:39:15,731 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 19:39:15,731 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 19:39:15,731 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 19:39:15,732 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 19:39:15,732 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 19:39:15,732 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 19:39:15,733 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 19:39:15,733 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 19:39:15,734 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 19:39:15,734 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 19:39:15,734 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 19:39:15,735 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 19:39:15,735 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 19:39:15,735 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 19:39:15,735 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 19:39:15,735 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 19:39:15,736 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 19:39:15,736 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 19:39:15,736 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 19:39:15,736 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 19:39:15,736 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 19:39:15,737 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 19:39:15,737 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 19:39:15,737 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 19:39:15,737 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 19:39:15,737 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 19:39:15,739 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 19:39:15,739 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 19:39:16,036 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 19:39:16,056 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 19:39:16,059 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 19:39:16,060 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 19:39:16,061 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 19:39:16,061 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix002_pso.oepc.i [2019-12-27 19:39:16,125 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50977c4c0/d621f78f85fe41c8903b6880b1222334/FLAGeffd4401a [2019-12-27 19:39:16,665 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 19:39:16,665 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix002_pso.oepc.i [2019-12-27 19:39:16,680 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50977c4c0/d621f78f85fe41c8903b6880b1222334/FLAGeffd4401a [2019-12-27 19:39:16,978 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50977c4c0/d621f78f85fe41c8903b6880b1222334 [2019-12-27 19:39:16,987 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 19:39:16,989 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 19:39:16,990 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 19:39:16,991 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 19:39:16,994 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 19:39:16,995 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:39:16" (1/1) ... [2019-12-27 19:39:16,998 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cd32435 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:39:16, skipping insertion in model container [2019-12-27 19:39:16,998 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:39:16" (1/1) ... [2019-12-27 19:39:17,006 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 19:39:17,064 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 19:39:17,570 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 19:39:17,589 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 19:39:17,674 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 19:39:17,755 INFO L208 MainTranslator]: Completed translation [2019-12-27 19:39:17,755 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:39:17 WrapperNode [2019-12-27 19:39:17,755 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 19:39:17,756 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 19:39:17,756 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 19:39:17,757 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 19:39:17,766 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:39:17" (1/1) ... [2019-12-27 19:39:17,788 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:39:17" (1/1) ... [2019-12-27 19:39:17,829 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 19:39:17,830 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 19:39:17,830 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 19:39:17,830 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 19:39:17,840 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:39:17" (1/1) ... [2019-12-27 19:39:17,840 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:39:17" (1/1) ... [2019-12-27 19:39:17,845 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:39:17" (1/1) ... [2019-12-27 19:39:17,845 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:39:17" (1/1) ... [2019-12-27 19:39:17,856 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:39:17" (1/1) ... [2019-12-27 19:39:17,861 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:39:17" (1/1) ... [2019-12-27 19:39:17,865 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:39:17" (1/1) ... [2019-12-27 19:39:17,870 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 19:39:17,871 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 19:39:17,871 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 19:39:17,871 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 19:39:17,872 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:39:17" (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 19:39:17,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 19:39:17,931 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 19:39:17,931 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 19:39:17,932 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 19:39:17,932 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 19:39:17,933 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 19:39:17,933 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 19:39:17,933 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 19:39:17,934 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 19:39:17,934 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 19:39:17,934 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 19:39:17,934 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 19:39:17,934 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 19:39:17,937 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 19:39:18,707 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 19:39:18,708 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 19:39:18,710 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:39:18 BoogieIcfgContainer [2019-12-27 19:39:18,710 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 19:39:18,711 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 19:39:18,711 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 19:39:18,715 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 19:39:18,715 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 07:39:16" (1/3) ... [2019-12-27 19:39:18,716 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bdb0093 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:39:18, skipping insertion in model container [2019-12-27 19:39:18,716 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:39:17" (2/3) ... [2019-12-27 19:39:18,717 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bdb0093 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:39:18, skipping insertion in model container [2019-12-27 19:39:18,717 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:39:18" (3/3) ... [2019-12-27 19:39:18,719 INFO L109 eAbstractionObserver]: Analyzing ICFG mix002_pso.oepc.i [2019-12-27 19:39:18,729 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 19:39:18,730 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 19:39:18,738 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 19:39:18,739 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 19:39:18,782 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,783 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,783 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,783 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,784 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,784 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,784 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,784 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,785 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,785 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,785 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,785 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,786 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,786 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,786 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,787 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,787 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,787 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,787 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,787 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,802 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,803 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,804 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,805 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,805 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,806 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,806 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,806 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,806 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,809 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,809 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,809 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,809 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,810 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,811 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,811 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,811 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,811 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,812 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,812 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,812 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,812 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,812 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,813 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,813 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,814 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,814 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,814 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,814 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,814 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,815 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,815 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,815 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,815 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,815 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,816 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,816 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,816 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,817 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,817 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,818 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,818 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,819 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,819 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,826 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,826 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,826 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,826 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,827 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,827 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,827 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,827 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,827 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,828 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,828 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,828 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,828 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,828 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,829 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,830 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,830 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,830 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,831 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,831 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,831 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,832 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,832 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,833 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,833 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,833 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,833 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,833 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,833 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,834 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,834 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,834 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,834 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,834 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,835 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,836 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,839 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,840 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,840 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,840 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,843 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,843 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,843 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,844 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,844 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,844 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,844 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,844 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,845 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,845 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,845 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,845 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,845 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,846 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,846 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,846 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,846 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,846 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,847 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,850 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,850 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,850 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,854 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,854 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,854 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,854 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,854 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,855 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,855 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,855 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,855 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,855 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,856 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,856 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,856 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,856 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,856 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,856 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,857 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,857 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,857 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,857 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,857 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,858 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,858 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,858 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,858 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,858 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,859 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,859 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,859 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,859 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,859 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,859 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,860 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,860 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,860 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,860 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,860 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,861 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,861 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,862 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,862 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,862 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,862 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,863 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,863 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,863 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,863 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,863 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,864 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,864 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,864 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,864 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,865 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,865 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,865 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,865 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,869 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,869 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,870 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,870 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,870 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,870 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,870 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,871 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,871 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,871 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,875 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,875 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,876 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,876 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,876 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,876 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,876 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,877 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,877 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,877 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,877 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,877 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,877 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,878 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,878 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,878 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,878 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,878 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,879 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,879 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,879 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,879 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,880 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,880 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,880 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,880 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,880 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,887 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,887 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,887 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,888 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,888 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,888 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,893 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,894 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,894 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,894 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,895 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,895 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,895 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,895 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,895 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,895 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,896 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,900 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:39:18,916 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 19:39:18,935 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 19:39:18,935 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 19:39:18,935 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 19:39:18,935 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 19:39:18,935 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 19:39:18,936 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 19:39:18,936 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 19:39:18,936 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 19:39:18,951 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 180 places, 217 transitions [2019-12-27 19:39:18,953 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 217 transitions [2019-12-27 19:39:19,068 INFO L132 PetriNetUnfolder]: 47/214 cut-off events. [2019-12-27 19:39:19,068 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 19:39:19,087 INFO L76 FinitePrefix]: Finished finitePrefix Result has 224 conditions, 214 events. 47/214 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 434 event pairs. 0/165 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 19:39:19,110 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 217 transitions [2019-12-27 19:39:19,164 INFO L132 PetriNetUnfolder]: 47/214 cut-off events. [2019-12-27 19:39:19,164 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 19:39:19,171 INFO L76 FinitePrefix]: Finished finitePrefix Result has 224 conditions, 214 events. 47/214 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 434 event pairs. 0/165 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 19:39:19,193 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 19:39:19,194 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 19:39:22,874 WARN L192 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-12-27 19:39:23,014 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-12-27 19:39:23,140 INFO L206 etLargeBlockEncoding]: Checked pairs total: 96061 [2019-12-27 19:39:23,141 INFO L214 etLargeBlockEncoding]: Total number of compositions: 115 [2019-12-27 19:39:23,147 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 96 places, 106 transitions [2019-12-27 19:39:42,282 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 123272 states. [2019-12-27 19:39:42,284 INFO L276 IsEmpty]: Start isEmpty. Operand 123272 states. [2019-12-27 19:39:42,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 19:39:42,289 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:39:42,290 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 19:39:42,290 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 19:39:42,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:39:42,295 INFO L82 PathProgramCache]: Analyzing trace with hash 920016, now seen corresponding path program 1 times [2019-12-27 19:39:42,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:39:42,304 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661841139] [2019-12-27 19:39:42,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:39:42,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:39:42,589 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 19:39:42,591 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661841139] [2019-12-27 19:39:42,592 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:39:42,592 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 19:39:42,595 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [790080663] [2019-12-27 19:39:42,596 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:39:42,601 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:39:42,617 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 19:39:42,617 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:39:42,621 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:39:42,622 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 19:39:42,622 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:39:42,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 19:39:42,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:39:42,642 INFO L87 Difference]: Start difference. First operand 123272 states. Second operand 3 states. [2019-12-27 19:39:46,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:39:46,596 INFO L93 Difference]: Finished difference Result 122274 states and 522952 transitions. [2019-12-27 19:39:46,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:39:46,598 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 19:39:46,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:39:47,280 INFO L225 Difference]: With dead ends: 122274 [2019-12-27 19:39:47,280 INFO L226 Difference]: Without dead ends: 115176 [2019-12-27 19:39:47,282 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 19:39:52,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115176 states. [2019-12-27 19:39:55,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115176 to 115176. [2019-12-27 19:39:55,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115176 states. [2019-12-27 19:39:59,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115176 states to 115176 states and 491986 transitions. [2019-12-27 19:39:59,517 INFO L78 Accepts]: Start accepts. Automaton has 115176 states and 491986 transitions. Word has length 3 [2019-12-27 19:39:59,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:39:59,518 INFO L462 AbstractCegarLoop]: Abstraction has 115176 states and 491986 transitions. [2019-12-27 19:39:59,518 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 19:39:59,518 INFO L276 IsEmpty]: Start isEmpty. Operand 115176 states and 491986 transitions. [2019-12-27 19:39:59,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 19:39:59,522 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:39:59,522 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:39:59,522 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 19:39:59,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:39:59,523 INFO L82 PathProgramCache]: Analyzing trace with hash -1323565433, now seen corresponding path program 1 times [2019-12-27 19:39:59,523 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:39:59,523 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067575406] [2019-12-27 19:39:59,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:39:59,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:39:59,612 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 19:39:59,612 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067575406] [2019-12-27 19:39:59,612 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:39:59,613 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 19:39:59,613 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1099358943] [2019-12-27 19:39:59,613 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:39:59,614 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:39:59,617 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 19:39:59,617 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:39:59,618 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:39:59,619 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 19:39:59,619 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:39:59,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 19:39:59,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 19:39:59,620 INFO L87 Difference]: Start difference. First operand 115176 states and 491986 transitions. Second operand 4 states. [2019-12-27 19:40:06,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:40:06,133 INFO L93 Difference]: Finished difference Result 183662 states and 752302 transitions. [2019-12-27 19:40:06,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 19:40:06,134 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 19:40:06,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:40:06,701 INFO L225 Difference]: With dead ends: 183662 [2019-12-27 19:40:06,701 INFO L226 Difference]: Without dead ends: 183613 [2019-12-27 19:40:06,702 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 19:40:12,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183613 states. [2019-12-27 19:40:16,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183613 to 166753. [2019-12-27 19:40:16,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166753 states. [2019-12-27 19:40:17,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166753 states to 166753 states and 692266 transitions. [2019-12-27 19:40:17,076 INFO L78 Accepts]: Start accepts. Automaton has 166753 states and 692266 transitions. Word has length 11 [2019-12-27 19:40:17,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:40:17,076 INFO L462 AbstractCegarLoop]: Abstraction has 166753 states and 692266 transitions. [2019-12-27 19:40:17,076 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 19:40:17,077 INFO L276 IsEmpty]: Start isEmpty. Operand 166753 states and 692266 transitions. [2019-12-27 19:40:17,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 19:40:17,083 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:40:17,083 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:40:17,084 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 19:40:17,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:40:17,084 INFO L82 PathProgramCache]: Analyzing trace with hash -447069332, now seen corresponding path program 1 times [2019-12-27 19:40:17,085 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:40:17,085 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744524950] [2019-12-27 19:40:17,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:40:17,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:40:17,146 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 19:40:17,147 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744524950] [2019-12-27 19:40:17,147 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:40:17,147 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 19:40:17,148 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [130886976] [2019-12-27 19:40:17,148 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:40:17,149 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:40:17,151 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 19:40:17,151 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:40:17,151 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:40:17,152 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 19:40:17,152 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:40:17,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 19:40:17,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:40:17,152 INFO L87 Difference]: Start difference. First operand 166753 states and 692266 transitions. Second operand 3 states. [2019-12-27 19:40:17,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:40:17,334 INFO L93 Difference]: Finished difference Result 35653 states and 116140 transitions. [2019-12-27 19:40:17,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:40:17,334 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 19:40:17,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:40:17,434 INFO L225 Difference]: With dead ends: 35653 [2019-12-27 19:40:17,434 INFO L226 Difference]: Without dead ends: 35653 [2019-12-27 19:40:17,435 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 19:40:17,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35653 states. [2019-12-27 19:40:23,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35653 to 35653. [2019-12-27 19:40:23,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35653 states. [2019-12-27 19:40:23,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35653 states to 35653 states and 116140 transitions. [2019-12-27 19:40:23,878 INFO L78 Accepts]: Start accepts. Automaton has 35653 states and 116140 transitions. Word has length 13 [2019-12-27 19:40:23,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:40:23,878 INFO L462 AbstractCegarLoop]: Abstraction has 35653 states and 116140 transitions. [2019-12-27 19:40:23,878 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 19:40:23,878 INFO L276 IsEmpty]: Start isEmpty. Operand 35653 states and 116140 transitions. [2019-12-27 19:40:23,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 19:40:23,881 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:40:23,881 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:40:23,881 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 19:40:23,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:40:23,881 INFO L82 PathProgramCache]: Analyzing trace with hash -1594630647, now seen corresponding path program 1 times [2019-12-27 19:40:23,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:40:23,882 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423409212] [2019-12-27 19:40:23,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:40:23,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:40:23,968 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 19:40:23,969 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423409212] [2019-12-27 19:40:23,969 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:40:23,969 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:40:23,969 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1646177013] [2019-12-27 19:40:23,970 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:40:23,972 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:40:23,975 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 19:40:23,975 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:40:23,975 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:40:23,976 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 19:40:23,976 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:40:23,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 19:40:23,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 19:40:23,977 INFO L87 Difference]: Start difference. First operand 35653 states and 116140 transitions. Second operand 5 states. [2019-12-27 19:40:24,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:40:24,454 INFO L93 Difference]: Finished difference Result 49040 states and 157904 transitions. [2019-12-27 19:40:24,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 19:40:24,454 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-27 19:40:24,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:40:24,543 INFO L225 Difference]: With dead ends: 49040 [2019-12-27 19:40:24,543 INFO L226 Difference]: Without dead ends: 49040 [2019-12-27 19:40:24,543 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 19:40:24,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49040 states. [2019-12-27 19:40:25,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49040 to 42019. [2019-12-27 19:40:25,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42019 states. [2019-12-27 19:40:25,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42019 states to 42019 states and 136433 transitions. [2019-12-27 19:40:25,425 INFO L78 Accepts]: Start accepts. Automaton has 42019 states and 136433 transitions. Word has length 16 [2019-12-27 19:40:25,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:40:25,426 INFO L462 AbstractCegarLoop]: Abstraction has 42019 states and 136433 transitions. [2019-12-27 19:40:25,426 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 19:40:25,426 INFO L276 IsEmpty]: Start isEmpty. Operand 42019 states and 136433 transitions. [2019-12-27 19:40:25,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 19:40:25,436 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:40:25,436 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 19:40:25,436 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 19:40:25,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:40:25,437 INFO L82 PathProgramCache]: Analyzing trace with hash -2124632115, now seen corresponding path program 1 times [2019-12-27 19:40:25,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:40:25,438 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260189991] [2019-12-27 19:40:25,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:40:25,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:40:25,549 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 19:40:25,550 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260189991] [2019-12-27 19:40:25,550 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:40:25,550 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 19:40:25,551 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1974864502] [2019-12-27 19:40:25,551 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:40:25,554 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:40:25,561 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 37 states and 50 transitions. [2019-12-27 19:40:25,561 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:40:25,563 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:40:25,564 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 19:40:25,564 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:40:25,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 19:40:25,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 19:40:25,564 INFO L87 Difference]: Start difference. First operand 42019 states and 136433 transitions. Second operand 6 states. [2019-12-27 19:40:26,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:40:26,829 INFO L93 Difference]: Finished difference Result 63228 states and 200109 transitions. [2019-12-27 19:40:26,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 19:40:26,830 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 19:40:26,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:40:26,933 INFO L225 Difference]: With dead ends: 63228 [2019-12-27 19:40:26,933 INFO L226 Difference]: Without dead ends: 63221 [2019-12-27 19:40:26,934 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-27 19:40:27,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63221 states. [2019-12-27 19:40:27,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63221 to 41773. [2019-12-27 19:40:27,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41773 states. [2019-12-27 19:40:27,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41773 states to 41773 states and 134916 transitions. [2019-12-27 19:40:27,820 INFO L78 Accepts]: Start accepts. Automaton has 41773 states and 134916 transitions. Word has length 22 [2019-12-27 19:40:27,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:40:27,820 INFO L462 AbstractCegarLoop]: Abstraction has 41773 states and 134916 transitions. [2019-12-27 19:40:27,820 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 19:40:27,820 INFO L276 IsEmpty]: Start isEmpty. Operand 41773 states and 134916 transitions. [2019-12-27 19:40:27,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 19:40:27,834 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:40:27,834 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 19:40:27,835 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 19:40:27,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:40:27,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1985611191, now seen corresponding path program 1 times [2019-12-27 19:40:27,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:40:27,836 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153230229] [2019-12-27 19:40:27,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:40:27,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:40:27,909 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 19:40:27,909 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153230229] [2019-12-27 19:40:27,909 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:40:27,909 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:40:27,910 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2102632353] [2019-12-27 19:40:27,910 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:40:27,915 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:40:27,925 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 73 transitions. [2019-12-27 19:40:27,926 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:40:27,926 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:40:27,926 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 19:40:27,927 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:40:27,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 19:40:27,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 19:40:27,928 INFO L87 Difference]: Start difference. First operand 41773 states and 134916 transitions. Second operand 4 states. [2019-12-27 19:40:27,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:40:27,996 INFO L93 Difference]: Finished difference Result 16487 states and 50228 transitions. [2019-12-27 19:40:27,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 19:40:27,996 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 19:40:27,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:40:28,023 INFO L225 Difference]: With dead ends: 16487 [2019-12-27 19:40:28,024 INFO L226 Difference]: Without dead ends: 16487 [2019-12-27 19:40:28,024 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 19:40:28,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16487 states. [2019-12-27 19:40:28,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16487 to 16124. [2019-12-27 19:40:28,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16124 states. [2019-12-27 19:40:28,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16124 states to 16124 states and 49192 transitions. [2019-12-27 19:40:28,298 INFO L78 Accepts]: Start accepts. Automaton has 16124 states and 49192 transitions. Word has length 25 [2019-12-27 19:40:28,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:40:28,298 INFO L462 AbstractCegarLoop]: Abstraction has 16124 states and 49192 transitions. [2019-12-27 19:40:28,298 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 19:40:28,298 INFO L276 IsEmpty]: Start isEmpty. Operand 16124 states and 49192 transitions. [2019-12-27 19:40:28,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 19:40:28,310 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:40:28,310 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 19:40:28,310 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 19:40:28,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:40:28,310 INFO L82 PathProgramCache]: Analyzing trace with hash -1670307795, now seen corresponding path program 1 times [2019-12-27 19:40:28,311 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:40:28,311 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897140649] [2019-12-27 19:40:28,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:40:28,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:40:28,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:40:28,385 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897140649] [2019-12-27 19:40:28,386 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:40:28,386 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:40:28,386 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [794268174] [2019-12-27 19:40:28,386 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:40:28,391 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:40:28,398 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 19:40:28,398 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:40:28,398 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:40:28,398 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 19:40:28,399 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:40:28,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 19:40:28,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:40:28,399 INFO L87 Difference]: Start difference. First operand 16124 states and 49192 transitions. Second operand 3 states. [2019-12-27 19:40:28,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:40:28,500 INFO L93 Difference]: Finished difference Result 23364 states and 69824 transitions. [2019-12-27 19:40:28,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:40:28,501 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-27 19:40:28,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:40:28,530 INFO L225 Difference]: With dead ends: 23364 [2019-12-27 19:40:28,531 INFO L226 Difference]: Without dead ends: 23364 [2019-12-27 19:40:28,531 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:40:28,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23364 states. [2019-12-27 19:40:28,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23364 to 17891. [2019-12-27 19:40:28,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17891 states. [2019-12-27 19:40:29,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17891 states to 17891 states and 54042 transitions. [2019-12-27 19:40:29,016 INFO L78 Accepts]: Start accepts. Automaton has 17891 states and 54042 transitions. Word has length 27 [2019-12-27 19:40:29,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:40:29,016 INFO L462 AbstractCegarLoop]: Abstraction has 17891 states and 54042 transitions. [2019-12-27 19:40:29,016 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 19:40:29,016 INFO L276 IsEmpty]: Start isEmpty. Operand 17891 states and 54042 transitions. [2019-12-27 19:40:29,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 19:40:29,028 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:40:29,028 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 19:40:29,028 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 19:40:29,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:40:29,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1181786131, now seen corresponding path program 1 times [2019-12-27 19:40:29,029 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:40:29,029 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412277376] [2019-12-27 19:40:29,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:40:29,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:40:29,134 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 19:40:29,135 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412277376] [2019-12-27 19:40:29,135 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:40:29,135 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 19:40:29,135 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [413619342] [2019-12-27 19:40:29,136 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:40:29,140 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:40:29,147 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 19:40:29,147 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:40:29,148 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:40:29,148 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 19:40:29,148 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:40:29,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 19:40:29,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 19:40:29,149 INFO L87 Difference]: Start difference. First operand 17891 states and 54042 transitions. Second operand 6 states. [2019-12-27 19:40:29,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:40:29,680 INFO L93 Difference]: Finished difference Result 25058 states and 73821 transitions. [2019-12-27 19:40:29,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 19:40:29,681 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 19:40:29,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:40:29,714 INFO L225 Difference]: With dead ends: 25058 [2019-12-27 19:40:29,715 INFO L226 Difference]: Without dead ends: 25058 [2019-12-27 19:40:29,715 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 19:40:29,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25058 states. [2019-12-27 19:40:30,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25058 to 20577. [2019-12-27 19:40:30,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20577 states. [2019-12-27 19:40:30,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20577 states to 20577 states and 61791 transitions. [2019-12-27 19:40:30,051 INFO L78 Accepts]: Start accepts. Automaton has 20577 states and 61791 transitions. Word has length 27 [2019-12-27 19:40:30,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:40:30,052 INFO L462 AbstractCegarLoop]: Abstraction has 20577 states and 61791 transitions. [2019-12-27 19:40:30,052 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 19:40:30,052 INFO L276 IsEmpty]: Start isEmpty. Operand 20577 states and 61791 transitions. [2019-12-27 19:40:30,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 19:40:30,073 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:40:30,073 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 19:40:30,073 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 19:40:30,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:40:30,074 INFO L82 PathProgramCache]: Analyzing trace with hash -2129802289, now seen corresponding path program 1 times [2019-12-27 19:40:30,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:40:30,074 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287924941] [2019-12-27 19:40:30,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:40:30,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:40:30,172 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 19:40:30,173 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287924941] [2019-12-27 19:40:30,173 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:40:30,173 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 19:40:30,173 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [65833093] [2019-12-27 19:40:30,174 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:40:30,179 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:40:30,192 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 48 states and 61 transitions. [2019-12-27 19:40:30,192 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:40:30,193 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:40:30,193 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 19:40:30,194 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:40:30,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 19:40:30,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 19:40:30,194 INFO L87 Difference]: Start difference. First operand 20577 states and 61791 transitions. Second operand 7 states. [2019-12-27 19:40:31,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:40:31,294 INFO L93 Difference]: Finished difference Result 27892 states and 81805 transitions. [2019-12-27 19:40:31,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 19:40:31,295 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-27 19:40:31,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:40:31,333 INFO L225 Difference]: With dead ends: 27892 [2019-12-27 19:40:31,333 INFO L226 Difference]: Without dead ends: 27892 [2019-12-27 19:40:31,333 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-27 19:40:31,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27892 states. [2019-12-27 19:40:31,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27892 to 18703. [2019-12-27 19:40:31,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18703 states. [2019-12-27 19:40:31,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18703 states to 18703 states and 56394 transitions. [2019-12-27 19:40:31,686 INFO L78 Accepts]: Start accepts. Automaton has 18703 states and 56394 transitions. Word has length 33 [2019-12-27 19:40:31,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:40:31,686 INFO L462 AbstractCegarLoop]: Abstraction has 18703 states and 56394 transitions. [2019-12-27 19:40:31,686 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 19:40:31,686 INFO L276 IsEmpty]: Start isEmpty. Operand 18703 states and 56394 transitions. [2019-12-27 19:40:31,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 19:40:31,711 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:40:31,711 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 19:40:31,711 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 19:40:31,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:40:31,711 INFO L82 PathProgramCache]: Analyzing trace with hash -559725799, now seen corresponding path program 1 times [2019-12-27 19:40:31,712 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:40:31,712 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166715786] [2019-12-27 19:40:31,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:40:31,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:40:31,770 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 19:40:31,771 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166715786] [2019-12-27 19:40:31,771 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:40:31,771 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 19:40:31,771 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1107392057] [2019-12-27 19:40:31,772 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:40:31,781 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:40:31,849 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 170 states and 351 transitions. [2019-12-27 19:40:31,849 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:40:31,850 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:40:31,851 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 19:40:31,851 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:40:31,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 19:40:31,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:40:31,851 INFO L87 Difference]: Start difference. First operand 18703 states and 56394 transitions. Second operand 3 states. [2019-12-27 19:40:32,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:40:32,137 INFO L93 Difference]: Finished difference Result 18702 states and 56392 transitions. [2019-12-27 19:40:32,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:40:32,138 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 19:40:32,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:40:32,170 INFO L225 Difference]: With dead ends: 18702 [2019-12-27 19:40:32,170 INFO L226 Difference]: Without dead ends: 18702 [2019-12-27 19:40:32,170 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 19:40:32,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18702 states. [2019-12-27 19:40:32,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18702 to 18702. [2019-12-27 19:40:32,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18702 states. [2019-12-27 19:40:32,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18702 states to 18702 states and 56392 transitions. [2019-12-27 19:40:32,454 INFO L78 Accepts]: Start accepts. Automaton has 18702 states and 56392 transitions. Word has length 39 [2019-12-27 19:40:32,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:40:32,455 INFO L462 AbstractCegarLoop]: Abstraction has 18702 states and 56392 transitions. [2019-12-27 19:40:32,455 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 19:40:32,455 INFO L276 IsEmpty]: Start isEmpty. Operand 18702 states and 56392 transitions. [2019-12-27 19:40:32,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 19:40:32,478 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:40:32,478 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 19:40:32,479 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 19:40:32,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:40:32,479 INFO L82 PathProgramCache]: Analyzing trace with hash -1324353592, now seen corresponding path program 1 times [2019-12-27 19:40:32,479 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:40:32,480 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817478945] [2019-12-27 19:40:32,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:40:32,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:40:32,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:40:32,547 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817478945] [2019-12-27 19:40:32,548 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:40:32,548 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 19:40:32,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [655773136] [2019-12-27 19:40:32,548 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:40:32,557 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:40:32,659 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 210 states and 423 transitions. [2019-12-27 19:40:32,659 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:40:32,721 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 19:40:32,721 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 19:40:32,721 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:40:32,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 19:40:32,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 19:40:32,722 INFO L87 Difference]: Start difference. First operand 18702 states and 56392 transitions. Second operand 6 states. [2019-12-27 19:40:32,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:40:32,826 INFO L93 Difference]: Finished difference Result 17378 states and 53366 transitions. [2019-12-27 19:40:32,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 19:40:32,826 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-27 19:40:32,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:40:32,854 INFO L225 Difference]: With dead ends: 17378 [2019-12-27 19:40:32,854 INFO L226 Difference]: Without dead ends: 17378 [2019-12-27 19:40:32,854 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 19:40:32,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17378 states. [2019-12-27 19:40:33,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17378 to 16713. [2019-12-27 19:40:33,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16713 states. [2019-12-27 19:40:33,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16713 states to 16713 states and 51571 transitions. [2019-12-27 19:40:33,118 INFO L78 Accepts]: Start accepts. Automaton has 16713 states and 51571 transitions. Word has length 40 [2019-12-27 19:40:33,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:40:33,118 INFO L462 AbstractCegarLoop]: Abstraction has 16713 states and 51571 transitions. [2019-12-27 19:40:33,118 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 19:40:33,119 INFO L276 IsEmpty]: Start isEmpty. Operand 16713 states and 51571 transitions. [2019-12-27 19:40:33,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 19:40:33,135 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:40:33,135 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 19:40:33,135 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 19:40:33,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:40:33,135 INFO L82 PathProgramCache]: Analyzing trace with hash 1560507821, now seen corresponding path program 1 times [2019-12-27 19:40:33,136 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:40:33,136 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892785634] [2019-12-27 19:40:33,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:40:33,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:40:33,197 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 19:40:33,198 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892785634] [2019-12-27 19:40:33,198 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:40:33,198 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:40:33,198 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1217098255] [2019-12-27 19:40:33,198 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:40:33,220 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:40:33,488 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 312 states and 575 transitions. [2019-12-27 19:40:33,488 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:40:33,516 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 19:40:33,516 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 19:40:33,517 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:40:33,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 19:40:33,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:40:33,517 INFO L87 Difference]: Start difference. First operand 16713 states and 51571 transitions. Second operand 3 states. [2019-12-27 19:40:33,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:40:33,612 INFO L93 Difference]: Finished difference Result 22522 states and 68098 transitions. [2019-12-27 19:40:33,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:40:33,612 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 19:40:33,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:40:33,641 INFO L225 Difference]: With dead ends: 22522 [2019-12-27 19:40:33,641 INFO L226 Difference]: Without dead ends: 22522 [2019-12-27 19:40:33,642 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 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 19:40:33,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22522 states. [2019-12-27 19:40:34,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22522 to 16531. [2019-12-27 19:40:34,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16531 states. [2019-12-27 19:40:34,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16531 states to 16531 states and 50417 transitions. [2019-12-27 19:40:34,150 INFO L78 Accepts]: Start accepts. Automaton has 16531 states and 50417 transitions. Word has length 64 [2019-12-27 19:40:34,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:40:34,151 INFO L462 AbstractCegarLoop]: Abstraction has 16531 states and 50417 transitions. [2019-12-27 19:40:34,151 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 19:40:34,151 INFO L276 IsEmpty]: Start isEmpty. Operand 16531 states and 50417 transitions. [2019-12-27 19:40:34,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 19:40:34,169 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:40:34,170 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 19:40:34,170 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 19:40:34,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:40:34,170 INFO L82 PathProgramCache]: Analyzing trace with hash -1583187919, now seen corresponding path program 1 times [2019-12-27 19:40:34,171 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:40:34,171 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371919581] [2019-12-27 19:40:34,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:40:34,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:40:34,284 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 19:40:34,284 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371919581] [2019-12-27 19:40:34,284 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:40:34,285 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 19:40:34,285 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [395392895] [2019-12-27 19:40:34,285 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:40:34,306 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:40:34,540 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 312 states and 575 transitions. [2019-12-27 19:40:34,540 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:40:34,598 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 10 times. [2019-12-27 19:40:34,598 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 19:40:34,598 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:40:34,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 19:40:34,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 19:40:34,599 INFO L87 Difference]: Start difference. First operand 16531 states and 50417 transitions. Second operand 9 states. [2019-12-27 19:40:37,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:40:37,864 INFO L93 Difference]: Finished difference Result 76264 states and 227755 transitions. [2019-12-27 19:40:37,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-27 19:40:37,867 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-27 19:40:37,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:40:37,949 INFO L225 Difference]: With dead ends: 76264 [2019-12-27 19:40:37,949 INFO L226 Difference]: Without dead ends: 59696 [2019-12-27 19:40:37,950 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=220, Invalid=836, Unknown=0, NotChecked=0, Total=1056 [2019-12-27 19:40:38,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59696 states. [2019-12-27 19:40:38,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59696 to 20250. [2019-12-27 19:40:38,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20250 states. [2019-12-27 19:40:38,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20250 states to 20250 states and 62030 transitions. [2019-12-27 19:40:38,869 INFO L78 Accepts]: Start accepts. Automaton has 20250 states and 62030 transitions. Word has length 64 [2019-12-27 19:40:38,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:40:38,869 INFO L462 AbstractCegarLoop]: Abstraction has 20250 states and 62030 transitions. [2019-12-27 19:40:38,869 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 19:40:38,869 INFO L276 IsEmpty]: Start isEmpty. Operand 20250 states and 62030 transitions. [2019-12-27 19:40:38,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 19:40:38,898 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:40:38,898 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 19:40:38,898 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 19:40:38,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:40:38,899 INFO L82 PathProgramCache]: Analyzing trace with hash 713705511, now seen corresponding path program 2 times [2019-12-27 19:40:38,900 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:40:38,900 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817985280] [2019-12-27 19:40:38,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:40:38,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:40:38,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:40:38,977 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817985280] [2019-12-27 19:40:38,978 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:40:38,978 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 19:40:38,978 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2138362215] [2019-12-27 19:40:38,978 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:40:38,999 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:40:39,213 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 260 states and 496 transitions. [2019-12-27 19:40:39,213 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:40:39,228 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 19:40:39,229 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 19:40:39,229 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:40:39,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 19:40:39,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 19:40:39,230 INFO L87 Difference]: Start difference. First operand 20250 states and 62030 transitions. Second operand 8 states. [2019-12-27 19:40:41,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:40:41,841 INFO L93 Difference]: Finished difference Result 79163 states and 238834 transitions. [2019-12-27 19:40:41,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 19:40:41,842 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 64 [2019-12-27 19:40:41,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:40:41,921 INFO L225 Difference]: With dead ends: 79163 [2019-12-27 19:40:41,921 INFO L226 Difference]: Without dead ends: 53828 [2019-12-27 19:40:41,922 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=167, Invalid=703, Unknown=0, NotChecked=0, Total=870 [2019-12-27 19:40:42,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53828 states. [2019-12-27 19:40:42,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53828 to 25397. [2019-12-27 19:40:42,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25397 states. [2019-12-27 19:40:42,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25397 states to 25397 states and 77623 transitions. [2019-12-27 19:40:42,872 INFO L78 Accepts]: Start accepts. Automaton has 25397 states and 77623 transitions. Word has length 64 [2019-12-27 19:40:42,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:40:42,872 INFO L462 AbstractCegarLoop]: Abstraction has 25397 states and 77623 transitions. [2019-12-27 19:40:42,872 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 19:40:42,872 INFO L276 IsEmpty]: Start isEmpty. Operand 25397 states and 77623 transitions. [2019-12-27 19:40:42,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 19:40:42,901 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:40:42,901 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 19:40:42,901 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 19:40:42,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:40:42,902 INFO L82 PathProgramCache]: Analyzing trace with hash -1281034255, now seen corresponding path program 3 times [2019-12-27 19:40:42,902 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:40:42,902 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37646374] [2019-12-27 19:40:42,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:40:42,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:40:43,018 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 19:40:43,019 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37646374] [2019-12-27 19:40:43,019 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:40:43,019 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 19:40:43,020 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1060626178] [2019-12-27 19:40:43,020 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:40:43,040 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:40:43,219 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 177 states and 309 transitions. [2019-12-27 19:40:43,219 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:40:43,255 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 19:40:43,255 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 19:40:43,255 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:40:43,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 19:40:43,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-12-27 19:40:43,256 INFO L87 Difference]: Start difference. First operand 25397 states and 77623 transitions. Second operand 11 states. [2019-12-27 19:40:46,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:40:46,185 INFO L93 Difference]: Finished difference Result 103739 states and 313245 transitions. [2019-12-27 19:40:46,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-12-27 19:40:46,189 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2019-12-27 19:40:46,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:40:46,338 INFO L225 Difference]: With dead ends: 103739 [2019-12-27 19:40:46,338 INFO L226 Difference]: Without dead ends: 101116 [2019-12-27 19:40:46,339 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 709 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=489, Invalid=1767, Unknown=0, NotChecked=0, Total=2256 [2019-12-27 19:40:46,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101116 states. [2019-12-27 19:40:47,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101116 to 25590. [2019-12-27 19:40:47,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25590 states. [2019-12-27 19:40:47,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25590 states to 25590 states and 78483 transitions. [2019-12-27 19:40:47,684 INFO L78 Accepts]: Start accepts. Automaton has 25590 states and 78483 transitions. Word has length 64 [2019-12-27 19:40:47,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:40:47,684 INFO L462 AbstractCegarLoop]: Abstraction has 25590 states and 78483 transitions. [2019-12-27 19:40:47,684 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 19:40:47,684 INFO L276 IsEmpty]: Start isEmpty. Operand 25590 states and 78483 transitions. [2019-12-27 19:40:47,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 19:40:47,710 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:40:47,710 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 19:40:47,710 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 19:40:47,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:40:47,711 INFO L82 PathProgramCache]: Analyzing trace with hash 1004584677, now seen corresponding path program 4 times [2019-12-27 19:40:47,711 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:40:47,711 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413029299] [2019-12-27 19:40:47,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:40:47,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:40:47,843 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 19:40:47,844 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413029299] [2019-12-27 19:40:47,846 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:40:47,846 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 19:40:47,846 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1060208280] [2019-12-27 19:40:47,846 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:40:47,866 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:40:48,178 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 339 states and 654 transitions. [2019-12-27 19:40:48,178 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:40:48,423 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 43 times. [2019-12-27 19:40:48,424 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 19:40:48,424 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:40:48,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 19:40:48,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-12-27 19:40:48,425 INFO L87 Difference]: Start difference. First operand 25590 states and 78483 transitions. Second operand 12 states. [2019-12-27 19:40:50,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:40:50,950 INFO L93 Difference]: Finished difference Result 86250 states and 258970 transitions. [2019-12-27 19:40:50,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-27 19:40:50,951 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 64 [2019-12-27 19:40:50,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:40:51,105 INFO L225 Difference]: With dead ends: 86250 [2019-12-27 19:40:51,105 INFO L226 Difference]: Without dead ends: 85897 [2019-12-27 19:40:51,106 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 41 SyntacticMatches, 17 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=214, Invalid=488, Unknown=0, NotChecked=0, Total=702 [2019-12-27 19:40:51,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85897 states. [2019-12-27 19:40:52,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85897 to 35072. [2019-12-27 19:40:52,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35072 states. [2019-12-27 19:40:52,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35072 states to 35072 states and 106938 transitions. [2019-12-27 19:40:52,336 INFO L78 Accepts]: Start accepts. Automaton has 35072 states and 106938 transitions. Word has length 64 [2019-12-27 19:40:52,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:40:52,337 INFO L462 AbstractCegarLoop]: Abstraction has 35072 states and 106938 transitions. [2019-12-27 19:40:52,337 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 19:40:52,337 INFO L276 IsEmpty]: Start isEmpty. Operand 35072 states and 106938 transitions. [2019-12-27 19:40:52,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 19:40:52,371 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:40:52,371 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 19:40:52,372 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 19:40:52,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:40:52,372 INFO L82 PathProgramCache]: Analyzing trace with hash 1162994701, now seen corresponding path program 5 times [2019-12-27 19:40:52,373 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:40:52,373 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602505176] [2019-12-27 19:40:52,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:40:52,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:40:52,456 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 19:40:52,456 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602505176] [2019-12-27 19:40:52,457 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:40:52,457 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 19:40:52,457 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [444599016] [2019-12-27 19:40:52,457 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:40:52,476 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:40:52,908 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 345 states and 664 transitions. [2019-12-27 19:40:52,909 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:40:52,965 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 19:40:52,965 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 19:40:52,966 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:40:52,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 19:40:52,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 19:40:52,966 INFO L87 Difference]: Start difference. First operand 35072 states and 106938 transitions. Second operand 5 states. [2019-12-27 19:40:53,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:40:53,437 INFO L93 Difference]: Finished difference Result 37280 states and 113124 transitions. [2019-12-27 19:40:53,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 19:40:53,437 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 64 [2019-12-27 19:40:53,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:40:53,494 INFO L225 Difference]: With dead ends: 37280 [2019-12-27 19:40:53,494 INFO L226 Difference]: Without dead ends: 37280 [2019-12-27 19:40:53,495 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 9 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 19:40:53,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37280 states. [2019-12-27 19:40:54,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37280 to 35497. [2019-12-27 19:40:54,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35497 states. [2019-12-27 19:40:54,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35497 states to 35497 states and 108239 transitions. [2019-12-27 19:40:54,550 INFO L78 Accepts]: Start accepts. Automaton has 35497 states and 108239 transitions. Word has length 64 [2019-12-27 19:40:54,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:40:54,551 INFO L462 AbstractCegarLoop]: Abstraction has 35497 states and 108239 transitions. [2019-12-27 19:40:54,551 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 19:40:54,551 INFO L276 IsEmpty]: Start isEmpty. Operand 35497 states and 108239 transitions. [2019-12-27 19:40:54,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 19:40:54,591 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:40:54,591 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 19:40:54,591 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 19:40:54,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:40:54,592 INFO L82 PathProgramCache]: Analyzing trace with hash -815010243, now seen corresponding path program 6 times [2019-12-27 19:40:54,592 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:40:54,593 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624581961] [2019-12-27 19:40:54,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:40:54,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:40:54,705 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 19:40:54,705 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624581961] [2019-12-27 19:40:54,705 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:40:54,706 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 19:40:54,706 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1715479317] [2019-12-27 19:40:54,706 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:40:54,730 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:40:55,092 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 305 states and 558 transitions. [2019-12-27 19:40:55,092 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:40:55,179 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 23 times. [2019-12-27 19:40:55,180 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 19:40:55,180 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:40:55,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 19:40:55,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 19:40:55,180 INFO L87 Difference]: Start difference. First operand 35497 states and 108239 transitions. Second operand 6 states. [2019-12-27 19:40:55,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:40:55,692 INFO L93 Difference]: Finished difference Result 37806 states and 114507 transitions. [2019-12-27 19:40:55,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 19:40:55,693 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2019-12-27 19:40:55,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:40:55,749 INFO L225 Difference]: With dead ends: 37806 [2019-12-27 19:40:55,749 INFO L226 Difference]: Without dead ends: 37806 [2019-12-27 19:40:55,749 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 19 SyntacticMatches, 12 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 19:40:55,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37806 states. [2019-12-27 19:40:56,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37806 to 35884. [2019-12-27 19:40:56,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35884 states. [2019-12-27 19:40:56,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35884 states to 35884 states and 109329 transitions. [2019-12-27 19:40:56,334 INFO L78 Accepts]: Start accepts. Automaton has 35884 states and 109329 transitions. Word has length 64 [2019-12-27 19:40:56,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:40:56,334 INFO L462 AbstractCegarLoop]: Abstraction has 35884 states and 109329 transitions. [2019-12-27 19:40:56,334 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 19:40:56,334 INFO L276 IsEmpty]: Start isEmpty. Operand 35884 states and 109329 transitions. [2019-12-27 19:40:56,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 19:40:56,374 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:40:56,374 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 19:40:56,374 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 19:40:56,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:40:56,374 INFO L82 PathProgramCache]: Analyzing trace with hash -1576440573, now seen corresponding path program 7 times [2019-12-27 19:40:56,375 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:40:56,375 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023560787] [2019-12-27 19:40:56,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:40:56,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:40:56,430 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 19:40:56,430 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023560787] [2019-12-27 19:40:56,431 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:40:56,431 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 19:40:56,431 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [374181301] [2019-12-27 19:40:56,431 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:40:56,447 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:40:56,680 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 240 states and 418 transitions. [2019-12-27 19:40:56,680 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:40:56,681 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:40:56,681 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 19:40:56,681 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:40:56,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 19:40:56,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:40:56,682 INFO L87 Difference]: Start difference. First operand 35884 states and 109329 transitions. Second operand 3 states. [2019-12-27 19:40:56,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:40:56,802 INFO L93 Difference]: Finished difference Result 35883 states and 109327 transitions. [2019-12-27 19:40:56,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:40:56,803 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 19:40:56,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:40:57,157 INFO L225 Difference]: With dead ends: 35883 [2019-12-27 19:40:57,157 INFO L226 Difference]: Without dead ends: 35883 [2019-12-27 19:40:57,157 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 19:40:57,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35883 states. [2019-12-27 19:40:57,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35883 to 32600. [2019-12-27 19:40:57,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32600 states. [2019-12-27 19:40:57,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32600 states to 32600 states and 99930 transitions. [2019-12-27 19:40:57,713 INFO L78 Accepts]: Start accepts. Automaton has 32600 states and 99930 transitions. Word has length 64 [2019-12-27 19:40:57,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:40:57,713 INFO L462 AbstractCegarLoop]: Abstraction has 32600 states and 99930 transitions. [2019-12-27 19:40:57,714 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 19:40:57,714 INFO L276 IsEmpty]: Start isEmpty. Operand 32600 states and 99930 transitions. [2019-12-27 19:40:57,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 19:40:57,755 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:40:57,755 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 19:40:57,755 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 19:40:57,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:40:57,756 INFO L82 PathProgramCache]: Analyzing trace with hash 1878395350, now seen corresponding path program 1 times [2019-12-27 19:40:57,756 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:40:57,756 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277730103] [2019-12-27 19:40:57,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:40:57,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:40:57,884 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 19:40:57,884 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277730103] [2019-12-27 19:40:57,885 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:40:57,885 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 19:40:57,885 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [313920542] [2019-12-27 19:40:57,885 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:40:57,902 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:40:58,215 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 340 states and 648 transitions. [2019-12-27 19:40:58,216 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:40:58,279 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 20 times. [2019-12-27 19:40:58,280 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 19:40:58,280 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:40:58,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 19:40:58,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-12-27 19:40:58,280 INFO L87 Difference]: Start difference. First operand 32600 states and 99930 transitions. Second operand 11 states. [2019-12-27 19:41:03,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:41:03,033 INFO L93 Difference]: Finished difference Result 106599 states and 322141 transitions. [2019-12-27 19:41:03,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-12-27 19:41:03,034 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2019-12-27 19:41:03,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:41:03,207 INFO L225 Difference]: With dead ends: 106599 [2019-12-27 19:41:03,207 INFO L226 Difference]: Without dead ends: 106379 [2019-12-27 19:41:03,208 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 26 SyntacticMatches, 6 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 900 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=567, Invalid=2295, Unknown=0, NotChecked=0, Total=2862 [2019-12-27 19:41:03,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106379 states. [2019-12-27 19:41:04,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106379 to 37135. [2019-12-27 19:41:04,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37135 states. [2019-12-27 19:41:04,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37135 states to 37135 states and 114032 transitions. [2019-12-27 19:41:04,370 INFO L78 Accepts]: Start accepts. Automaton has 37135 states and 114032 transitions. Word has length 65 [2019-12-27 19:41:04,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:41:04,371 INFO L462 AbstractCegarLoop]: Abstraction has 37135 states and 114032 transitions. [2019-12-27 19:41:04,371 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 19:41:04,371 INFO L276 IsEmpty]: Start isEmpty. Operand 37135 states and 114032 transitions. [2019-12-27 19:41:04,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 19:41:04,413 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:41:04,413 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:41:04,413 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 19:41:04,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:41:04,413 INFO L82 PathProgramCache]: Analyzing trace with hash 296700108, now seen corresponding path program 2 times [2019-12-27 19:41:04,414 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:41:04,414 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482325908] [2019-12-27 19:41:04,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:41:04,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:41:04,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:41:04,565 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482325908] [2019-12-27 19:41:04,565 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:41:04,565 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 19:41:04,565 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [748818709] [2019-12-27 19:41:04,566 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:41:04,582 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:41:05,066 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 353 states and 680 transitions. [2019-12-27 19:41:05,067 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:41:05,298 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 33 times. [2019-12-27 19:41:05,298 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 19:41:05,299 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:41:05,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 19:41:05,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2019-12-27 19:41:05,299 INFO L87 Difference]: Start difference. First operand 37135 states and 114032 transitions. Second operand 14 states. [2019-12-27 19:41:15,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:41:15,216 INFO L93 Difference]: Finished difference Result 127593 states and 381218 transitions. [2019-12-27 19:41:15,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2019-12-27 19:41:15,217 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 65 [2019-12-27 19:41:15,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:41:15,420 INFO L225 Difference]: With dead ends: 127593 [2019-12-27 19:41:15,420 INFO L226 Difference]: Without dead ends: 127341 [2019-12-27 19:41:15,424 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 40 SyntacticMatches, 11 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6667 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=2294, Invalid=14476, Unknown=0, NotChecked=0, Total=16770 [2019-12-27 19:41:15,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127341 states. [2019-12-27 19:41:17,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127341 to 39092. [2019-12-27 19:41:17,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39092 states. [2019-12-27 19:41:17,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39092 states to 39092 states and 119587 transitions. [2019-12-27 19:41:17,300 INFO L78 Accepts]: Start accepts. Automaton has 39092 states and 119587 transitions. Word has length 65 [2019-12-27 19:41:17,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:41:17,300 INFO L462 AbstractCegarLoop]: Abstraction has 39092 states and 119587 transitions. [2019-12-27 19:41:17,300 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 19:41:17,300 INFO L276 IsEmpty]: Start isEmpty. Operand 39092 states and 119587 transitions. [2019-12-27 19:41:17,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 19:41:17,343 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:41:17,343 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:41:17,343 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 19:41:17,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:41:17,344 INFO L82 PathProgramCache]: Analyzing trace with hash -823976072, now seen corresponding path program 3 times [2019-12-27 19:41:17,345 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:41:17,345 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464579837] [2019-12-27 19:41:17,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:41:17,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:41:17,433 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 19:41:17,433 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464579837] [2019-12-27 19:41:17,434 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:41:17,434 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 19:41:17,434 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1188272515] [2019-12-27 19:41:17,434 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:41:17,448 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:41:17,671 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 241 states and 407 transitions. [2019-12-27 19:41:17,672 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:41:17,674 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 19:41:17,675 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 19:41:17,675 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:41:17,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 19:41:17,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:41:17,677 INFO L87 Difference]: Start difference. First operand 39092 states and 119587 transitions. Second operand 3 states. [2019-12-27 19:41:17,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:41:17,850 INFO L93 Difference]: Finished difference Result 43179 states and 132427 transitions. [2019-12-27 19:41:17,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:41:17,850 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 19:41:17,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:41:17,911 INFO L225 Difference]: With dead ends: 43179 [2019-12-27 19:41:17,911 INFO L226 Difference]: Without dead ends: 43179 [2019-12-27 19:41:17,912 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 3 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 19:41:18,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43179 states. [2019-12-27 19:41:18,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43179 to 35337. [2019-12-27 19:41:18,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35337 states. [2019-12-27 19:41:18,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35337 states to 35337 states and 109575 transitions. [2019-12-27 19:41:18,531 INFO L78 Accepts]: Start accepts. Automaton has 35337 states and 109575 transitions. Word has length 65 [2019-12-27 19:41:18,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:41:18,531 INFO L462 AbstractCegarLoop]: Abstraction has 35337 states and 109575 transitions. [2019-12-27 19:41:18,531 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 19:41:18,531 INFO L276 IsEmpty]: Start isEmpty. Operand 35337 states and 109575 transitions. [2019-12-27 19:41:18,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 19:41:18,574 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:41:18,574 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 19:41:18,575 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 19:41:18,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:41:18,575 INFO L82 PathProgramCache]: Analyzing trace with hash 120396183, now seen corresponding path program 1 times [2019-12-27 19:41:18,576 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:41:18,576 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471881321] [2019-12-27 19:41:18,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:41:18,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:41:18,624 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 19:41:18,624 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471881321] [2019-12-27 19:41:18,625 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:41:18,625 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:41:18,625 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [379421968] [2019-12-27 19:41:18,625 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:41:18,640 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:41:19,091 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 168 states and 293 transitions. [2019-12-27 19:41:19,092 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:41:19,093 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 19:41:19,094 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 19:41:19,094 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:41:19,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 19:41:19,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:41:19,094 INFO L87 Difference]: Start difference. First operand 35337 states and 109575 transitions. Second operand 3 states. [2019-12-27 19:41:19,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:41:19,380 INFO L93 Difference]: Finished difference Result 51133 states and 158969 transitions. [2019-12-27 19:41:19,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:41:19,381 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 19:41:19,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:41:19,461 INFO L225 Difference]: With dead ends: 51133 [2019-12-27 19:41:19,462 INFO L226 Difference]: Without dead ends: 51133 [2019-12-27 19:41:19,462 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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 19:41:19,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51133 states. [2019-12-27 19:41:20,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51133 to 36206. [2019-12-27 19:41:20,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36206 states. [2019-12-27 19:41:20,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36206 states to 36206 states and 112443 transitions. [2019-12-27 19:41:20,161 INFO L78 Accepts]: Start accepts. Automaton has 36206 states and 112443 transitions. Word has length 66 [2019-12-27 19:41:20,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:41:20,161 INFO L462 AbstractCegarLoop]: Abstraction has 36206 states and 112443 transitions. [2019-12-27 19:41:20,161 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 19:41:20,161 INFO L276 IsEmpty]: Start isEmpty. Operand 36206 states and 112443 transitions. [2019-12-27 19:41:20,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 19:41:20,203 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:41:20,203 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 19:41:20,203 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 19:41:20,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:41:20,203 INFO L82 PathProgramCache]: Analyzing trace with hash -1461299059, now seen corresponding path program 2 times [2019-12-27 19:41:20,204 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:41:20,204 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611626535] [2019-12-27 19:41:20,204 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:41:20,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:41:20,288 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 19:41:20,289 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611626535] [2019-12-27 19:41:20,289 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:41:20,289 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 19:41:20,289 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [150632056] [2019-12-27 19:41:20,290 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:41:20,308 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:41:20,532 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 193 states and 354 transitions. [2019-12-27 19:41:20,532 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:41:20,533 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 19:41:20,533 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 19:41:20,533 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:41:20,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 19:41:20,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 19:41:20,534 INFO L87 Difference]: Start difference. First operand 36206 states and 112443 transitions. Second operand 8 states. [2019-12-27 19:41:21,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:41:21,498 INFO L93 Difference]: Finished difference Result 88139 states and 270039 transitions. [2019-12-27 19:41:21,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 19:41:21,498 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 66 [2019-12-27 19:41:21,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:41:21,624 INFO L225 Difference]: With dead ends: 88139 [2019-12-27 19:41:21,624 INFO L226 Difference]: Without dead ends: 81547 [2019-12-27 19:41:21,624 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2019-12-27 19:41:21,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81547 states. [2019-12-27 19:41:22,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81547 to 36345. [2019-12-27 19:41:22,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36345 states. [2019-12-27 19:41:22,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36345 states to 36345 states and 112995 transitions. [2019-12-27 19:41:22,954 INFO L78 Accepts]: Start accepts. Automaton has 36345 states and 112995 transitions. Word has length 66 [2019-12-27 19:41:22,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:41:22,955 INFO L462 AbstractCegarLoop]: Abstraction has 36345 states and 112995 transitions. [2019-12-27 19:41:22,955 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 19:41:22,955 INFO L276 IsEmpty]: Start isEmpty. Operand 36345 states and 112995 transitions. [2019-12-27 19:41:22,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 19:41:22,995 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:41:22,995 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 19:41:22,995 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 19:41:22,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:41:22,996 INFO L82 PathProgramCache]: Analyzing trace with hash 1669827773, now seen corresponding path program 3 times [2019-12-27 19:41:22,996 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:41:22,997 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853742662] [2019-12-27 19:41:22,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:41:23,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:41:23,103 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 19:41:23,103 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853742662] [2019-12-27 19:41:23,103 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:41:23,103 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 19:41:23,104 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1816196845] [2019-12-27 19:41:23,104 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:41:23,119 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:41:23,390 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 220 states and 406 transitions. [2019-12-27 19:41:23,390 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:41:23,543 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 19:41:23,543 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 19:41:23,544 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:41:23,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 19:41:23,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-12-27 19:41:23,544 INFO L87 Difference]: Start difference. First operand 36345 states and 112995 transitions. Second operand 12 states. [2019-12-27 19:41:29,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:41:29,748 INFO L93 Difference]: Finished difference Result 145300 states and 442542 transitions. [2019-12-27 19:41:29,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-12-27 19:41:29,748 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2019-12-27 19:41:29,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:41:29,953 INFO L225 Difference]: With dead ends: 145300 [2019-12-27 19:41:29,954 INFO L226 Difference]: Without dead ends: 119910 [2019-12-27 19:41:29,955 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1693 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=840, Invalid=3990, Unknown=0, NotChecked=0, Total=4830 [2019-12-27 19:41:30,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119910 states. [2019-12-27 19:41:31,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119910 to 38891. [2019-12-27 19:41:31,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38891 states. [2019-12-27 19:41:31,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38891 states to 38891 states and 121156 transitions. [2019-12-27 19:41:31,712 INFO L78 Accepts]: Start accepts. Automaton has 38891 states and 121156 transitions. Word has length 66 [2019-12-27 19:41:31,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:41:31,712 INFO L462 AbstractCegarLoop]: Abstraction has 38891 states and 121156 transitions. [2019-12-27 19:41:31,712 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 19:41:31,712 INFO L276 IsEmpty]: Start isEmpty. Operand 38891 states and 121156 transitions. [2019-12-27 19:41:31,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 19:41:31,753 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:41:31,753 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 19:41:31,753 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 19:41:31,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:41:31,753 INFO L82 PathProgramCache]: Analyzing trace with hash 967993997, now seen corresponding path program 4 times [2019-12-27 19:41:31,754 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:41:31,754 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830749023] [2019-12-27 19:41:31,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:41:31,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:41:31,870 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 19:41:31,870 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830749023] [2019-12-27 19:41:31,871 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:41:31,871 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 19:41:31,871 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [750035158] [2019-12-27 19:41:31,871 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:41:31,886 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:41:32,042 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 193 states and 354 transitions. [2019-12-27 19:41:32,042 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:41:32,044 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 19:41:32,045 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 19:41:32,045 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:41:32,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 19:41:32,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 19:41:32,046 INFO L87 Difference]: Start difference. First operand 38891 states and 121156 transitions. Second operand 9 states. [2019-12-27 19:41:33,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:41:33,512 INFO L93 Difference]: Finished difference Result 107003 states and 324750 transitions. [2019-12-27 19:41:33,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 19:41:33,512 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-12-27 19:41:33,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:41:33,670 INFO L225 Difference]: With dead ends: 107003 [2019-12-27 19:41:33,670 INFO L226 Difference]: Without dead ends: 100581 [2019-12-27 19:41:33,671 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=159, Invalid=491, Unknown=0, NotChecked=0, Total=650 [2019-12-27 19:41:33,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100581 states. [2019-12-27 19:41:35,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100581 to 38714. [2019-12-27 19:41:35,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38714 states. [2019-12-27 19:41:35,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38714 states to 38714 states and 120429 transitions. [2019-12-27 19:41:35,076 INFO L78 Accepts]: Start accepts. Automaton has 38714 states and 120429 transitions. Word has length 66 [2019-12-27 19:41:35,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:41:35,076 INFO L462 AbstractCegarLoop]: Abstraction has 38714 states and 120429 transitions. [2019-12-27 19:41:35,076 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 19:41:35,076 INFO L276 IsEmpty]: Start isEmpty. Operand 38714 states and 120429 transitions. [2019-12-27 19:41:35,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 19:41:35,117 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:41:35,117 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 19:41:35,117 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 19:41:35,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:41:35,117 INFO L82 PathProgramCache]: Analyzing trace with hash -395808603, now seen corresponding path program 5 times [2019-12-27 19:41:35,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:41:35,118 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573157702] [2019-12-27 19:41:35,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:41:35,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:41:35,207 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 19:41:35,208 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573157702] [2019-12-27 19:41:35,208 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:41:35,208 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 19:41:35,208 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [600385758] [2019-12-27 19:41:35,208 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:41:35,223 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:41:35,522 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 277 states and 487 transitions. [2019-12-27 19:41:35,522 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:41:35,524 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 19:41:35,525 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 19:41:35,525 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:41:35,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 19:41:35,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 19:41:35,525 INFO L87 Difference]: Start difference. First operand 38714 states and 120429 transitions. Second operand 6 states. [2019-12-27 19:41:36,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:41:36,082 INFO L93 Difference]: Finished difference Result 62527 states and 195795 transitions. [2019-12-27 19:41:36,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 19:41:36,082 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-12-27 19:41:36,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:41:36,182 INFO L225 Difference]: With dead ends: 62527 [2019-12-27 19:41:36,182 INFO L226 Difference]: Without dead ends: 62527 [2019-12-27 19:41:36,182 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-12-27 19:41:36,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62527 states. [2019-12-27 19:41:36,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62527 to 44310. [2019-12-27 19:41:36,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44310 states. [2019-12-27 19:41:37,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44310 states to 44310 states and 139585 transitions. [2019-12-27 19:41:37,008 INFO L78 Accepts]: Start accepts. Automaton has 44310 states and 139585 transitions. Word has length 66 [2019-12-27 19:41:37,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:41:37,008 INFO L462 AbstractCegarLoop]: Abstraction has 44310 states and 139585 transitions. [2019-12-27 19:41:37,008 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 19:41:37,008 INFO L276 IsEmpty]: Start isEmpty. Operand 44310 states and 139585 transitions. [2019-12-27 19:41:37,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 19:41:37,054 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:41:37,054 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 19:41:37,054 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 19:41:37,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:41:37,055 INFO L82 PathProgramCache]: Analyzing trace with hash -25266104, now seen corresponding path program 1 times [2019-12-27 19:41:37,055 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:41:37,055 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657848228] [2019-12-27 19:41:37,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:41:37,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:41:37,116 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 19:41:37,117 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657848228] [2019-12-27 19:41:37,117 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:41:37,117 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 19:41:37,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1681596070] [2019-12-27 19:41:37,117 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:41:37,131 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:41:37,779 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 308 states and 520 transitions. [2019-12-27 19:41:37,780 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:41:37,793 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 19:41:37,793 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 19:41:37,793 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:41:37,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 19:41:37,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 19:41:37,794 INFO L87 Difference]: Start difference. First operand 44310 states and 139585 transitions. Second operand 4 states. [2019-12-27 19:41:38,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:41:38,202 INFO L93 Difference]: Finished difference Result 50129 states and 153972 transitions. [2019-12-27 19:41:38,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 19:41:38,202 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-27 19:41:38,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:41:38,280 INFO L225 Difference]: With dead ends: 50129 [2019-12-27 19:41:38,281 INFO L226 Difference]: Without dead ends: 50129 [2019-12-27 19:41:38,281 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 19:41:38,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50129 states. [2019-12-27 19:41:38,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50129 to 34448. [2019-12-27 19:41:38,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34448 states. [2019-12-27 19:41:38,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34448 states to 34448 states and 106496 transitions. [2019-12-27 19:41:38,935 INFO L78 Accepts]: Start accepts. Automaton has 34448 states and 106496 transitions. Word has length 66 [2019-12-27 19:41:38,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:41:38,935 INFO L462 AbstractCegarLoop]: Abstraction has 34448 states and 106496 transitions. [2019-12-27 19:41:38,935 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 19:41:38,935 INFO L276 IsEmpty]: Start isEmpty. Operand 34448 states and 106496 transitions. [2019-12-27 19:41:38,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 19:41:38,972 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:41:38,972 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 19:41:38,972 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 19:41:38,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:41:38,973 INFO L82 PathProgramCache]: Analyzing trace with hash -271477992, now seen corresponding path program 1 times [2019-12-27 19:41:38,973 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:41:38,973 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889491544] [2019-12-27 19:41:38,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:41:38,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:41:39,080 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 19:41:39,080 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889491544] [2019-12-27 19:41:39,081 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:41:39,081 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 19:41:39,081 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [299248902] [2019-12-27 19:41:39,081 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:41:39,096 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:41:39,315 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 248 states and 464 transitions. [2019-12-27 19:41:39,315 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:41:39,343 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 19:41:39,343 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 19:41:39,344 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:41:39,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 19:41:39,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-27 19:41:39,344 INFO L87 Difference]: Start difference. First operand 34448 states and 106496 transitions. Second operand 9 states. [2019-12-27 19:41:40,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:41:40,866 INFO L93 Difference]: Finished difference Result 60685 states and 185646 transitions. [2019-12-27 19:41:40,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 19:41:40,867 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2019-12-27 19:41:40,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:41:40,949 INFO L225 Difference]: With dead ends: 60685 [2019-12-27 19:41:40,950 INFO L226 Difference]: Without dead ends: 52388 [2019-12-27 19:41:40,950 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2019-12-27 19:41:41,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52388 states. [2019-12-27 19:41:41,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52388 to 35414. [2019-12-27 19:41:41,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35414 states. [2019-12-27 19:41:41,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35414 states to 35414 states and 108920 transitions. [2019-12-27 19:41:41,943 INFO L78 Accepts]: Start accepts. Automaton has 35414 states and 108920 transitions. Word has length 67 [2019-12-27 19:41:41,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:41:41,943 INFO L462 AbstractCegarLoop]: Abstraction has 35414 states and 108920 transitions. [2019-12-27 19:41:41,943 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 19:41:41,943 INFO L276 IsEmpty]: Start isEmpty. Operand 35414 states and 108920 transitions. [2019-12-27 19:41:41,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 19:41:41,986 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:41:41,986 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 19:41:41,986 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 19:41:41,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:41:41,986 INFO L82 PathProgramCache]: Analyzing trace with hash -147249512, now seen corresponding path program 2 times [2019-12-27 19:41:41,987 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:41:41,987 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370758215] [2019-12-27 19:41:41,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:41:42,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:41:42,120 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 19:41:42,120 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370758215] [2019-12-27 19:41:42,120 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:41:42,121 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 19:41:42,121 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [771080479] [2019-12-27 19:41:42,121 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:41:42,137 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:41:42,364 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 230 states and 439 transitions. [2019-12-27 19:41:42,364 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:41:42,509 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 11 times. [2019-12-27 19:41:42,510 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 19:41:42,510 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:41:42,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 19:41:42,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-12-27 19:41:42,511 INFO L87 Difference]: Start difference. First operand 35414 states and 108920 transitions. Second operand 12 states. [2019-12-27 19:41:44,981 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 40 [2019-12-27 19:41:45,546 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 48 [2019-12-27 19:41:50,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:41:50,281 INFO L93 Difference]: Finished difference Result 147810 states and 449545 transitions. [2019-12-27 19:41:50,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-12-27 19:41:50,282 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-27 19:41:50,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:41:50,981 INFO L225 Difference]: With dead ends: 147810 [2019-12-27 19:41:50,981 INFO L226 Difference]: Without dead ends: 147810 [2019-12-27 19:41:50,983 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 14 SyntacticMatches, 7 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1751 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1072, Invalid=4040, Unknown=0, NotChecked=0, Total=5112 [2019-12-27 19:41:51,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147810 states. [2019-12-27 19:41:52,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147810 to 39859. [2019-12-27 19:41:52,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39859 states. [2019-12-27 19:41:52,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39859 states to 39859 states and 124123 transitions. [2019-12-27 19:41:52,454 INFO L78 Accepts]: Start accepts. Automaton has 39859 states and 124123 transitions. Word has length 67 [2019-12-27 19:41:52,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:41:52,454 INFO L462 AbstractCegarLoop]: Abstraction has 39859 states and 124123 transitions. [2019-12-27 19:41:52,455 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 19:41:52,455 INFO L276 IsEmpty]: Start isEmpty. Operand 39859 states and 124123 transitions. [2019-12-27 19:41:52,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 19:41:52,502 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:41:52,502 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 19:41:52,503 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 19:41:52,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:41:52,503 INFO L82 PathProgramCache]: Analyzing trace with hash 1579680440, now seen corresponding path program 3 times [2019-12-27 19:41:52,504 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:41:52,504 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731985784] [2019-12-27 19:41:52,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:41:52,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:41:52,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:41:52,590 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731985784] [2019-12-27 19:41:52,590 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:41:52,590 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 19:41:52,591 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [623667841] [2019-12-27 19:41:52,591 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:41:52,606 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:41:52,832 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 236 states and 427 transitions. [2019-12-27 19:41:52,832 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:41:52,852 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 19:41:52,852 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 19:41:52,853 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:41:52,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 19:41:52,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 19:41:52,856 INFO L87 Difference]: Start difference. First operand 39859 states and 124123 transitions. Second operand 5 states. [2019-12-27 19:41:53,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:41:53,047 INFO L93 Difference]: Finished difference Result 39510 states and 122807 transitions. [2019-12-27 19:41:53,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 19:41:53,048 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-12-27 19:41:53,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:41:53,105 INFO L225 Difference]: With dead ends: 39510 [2019-12-27 19:41:53,105 INFO L226 Difference]: Without dead ends: 39510 [2019-12-27 19:41:53,105 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 7 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 19:41:53,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39510 states. [2019-12-27 19:41:53,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39510 to 27021. [2019-12-27 19:41:53,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27021 states. [2019-12-27 19:41:53,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27021 states to 27021 states and 81943 transitions. [2019-12-27 19:41:53,943 INFO L78 Accepts]: Start accepts. Automaton has 27021 states and 81943 transitions. Word has length 67 [2019-12-27 19:41:53,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:41:53,944 INFO L462 AbstractCegarLoop]: Abstraction has 27021 states and 81943 transitions. [2019-12-27 19:41:53,944 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 19:41:53,944 INFO L276 IsEmpty]: Start isEmpty. Operand 27021 states and 81943 transitions. [2019-12-27 19:41:53,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 19:41:53,971 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:41:53,971 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 19:41:53,971 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 19:41:53,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:41:53,972 INFO L82 PathProgramCache]: Analyzing trace with hash -887039031, now seen corresponding path program 1 times [2019-12-27 19:41:53,972 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:41:53,972 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463451357] [2019-12-27 19:41:53,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:41:53,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:41:54,129 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 19:41:54,129 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463451357] [2019-12-27 19:41:54,130 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:41:54,130 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 19:41:54,130 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2008721902] [2019-12-27 19:41:54,130 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:41:54,160 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:41:54,425 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 190 states and 324 transitions. [2019-12-27 19:41:54,425 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:41:54,552 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 19:41:54,553 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 19:41:54,553 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:41:54,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 19:41:54,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-27 19:41:54,554 INFO L87 Difference]: Start difference. First operand 27021 states and 81943 transitions. Second operand 12 states. [2019-12-27 19:41:56,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:41:56,066 INFO L93 Difference]: Finished difference Result 34066 states and 102843 transitions. [2019-12-27 19:41:56,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 19:41:56,066 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-27 19:41:56,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:41:56,111 INFO L225 Difference]: With dead ends: 34066 [2019-12-27 19:41:56,111 INFO L226 Difference]: Without dead ends: 32511 [2019-12-27 19:41:56,111 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 5 SyntacticMatches, 6 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=456, Unknown=0, NotChecked=0, Total=552 [2019-12-27 19:41:56,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32511 states. [2019-12-27 19:41:56,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32511 to 27117. [2019-12-27 19:41:56,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27117 states. [2019-12-27 19:41:56,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27117 states to 27117 states and 82184 transitions. [2019-12-27 19:41:56,541 INFO L78 Accepts]: Start accepts. Automaton has 27117 states and 82184 transitions. Word has length 67 [2019-12-27 19:41:56,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:41:56,541 INFO L462 AbstractCegarLoop]: Abstraction has 27117 states and 82184 transitions. [2019-12-27 19:41:56,541 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 19:41:56,541 INFO L276 IsEmpty]: Start isEmpty. Operand 27117 states and 82184 transitions. [2019-12-27 19:41:56,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 19:41:56,569 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:41:56,569 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 19:41:56,569 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:41:56,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:41:56,569 INFO L82 PathProgramCache]: Analyzing trace with hash 882845507, now seen corresponding path program 2 times [2019-12-27 19:41:56,570 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:41:56,570 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305485856] [2019-12-27 19:41:56,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:41:56,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:41:56,790 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 19:41:56,791 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305485856] [2019-12-27 19:41:56,791 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:41:56,791 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 19:41:56,792 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1114875319] [2019-12-27 19:41:56,792 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:41:56,819 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:41:57,269 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 289 states and 588 transitions. [2019-12-27 19:41:57,269 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:41:57,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 19:41:57,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 19:41:57,490 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 15 times. [2019-12-27 19:41:57,491 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 19:41:57,491 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:41:57,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 19:41:57,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-12-27 19:41:57,491 INFO L87 Difference]: Start difference. First operand 27117 states and 82184 transitions. Second operand 17 states. [2019-12-27 19:42:01,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:42:01,648 INFO L93 Difference]: Finished difference Result 62672 states and 188847 transitions. [2019-12-27 19:42:01,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-12-27 19:42:01,649 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 67 [2019-12-27 19:42:01,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:42:01,750 INFO L225 Difference]: With dead ends: 62672 [2019-12-27 19:42:01,750 INFO L226 Difference]: Without dead ends: 62013 [2019-12-27 19:42:01,751 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 7 SyntacticMatches, 5 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 550 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=382, Invalid=2068, Unknown=0, NotChecked=0, Total=2450 [2019-12-27 19:42:01,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62013 states. [2019-12-27 19:42:02,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62013 to 27069. [2019-12-27 19:42:02,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27069 states. [2019-12-27 19:42:02,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27069 states to 27069 states and 82068 transitions. [2019-12-27 19:42:02,497 INFO L78 Accepts]: Start accepts. Automaton has 27069 states and 82068 transitions. Word has length 67 [2019-12-27 19:42:02,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:42:02,497 INFO L462 AbstractCegarLoop]: Abstraction has 27069 states and 82068 transitions. [2019-12-27 19:42:02,497 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 19:42:02,497 INFO L276 IsEmpty]: Start isEmpty. Operand 27069 states and 82068 transitions. [2019-12-27 19:42:02,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 19:42:02,531 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:42:02,531 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 19:42:02,531 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:42:02,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:42:02,531 INFO L82 PathProgramCache]: Analyzing trace with hash 1595816749, now seen corresponding path program 3 times [2019-12-27 19:42:02,532 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:42:02,532 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060538810] [2019-12-27 19:42:02,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:42:02,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:42:02,707 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 19:42:02,707 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060538810] [2019-12-27 19:42:02,708 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:42:02,708 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 19:42:02,708 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2031754426] [2019-12-27 19:42:02,708 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:42:02,723 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:42:03,078 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 244 states and 472 transitions. [2019-12-27 19:42:03,078 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:42:03,172 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 19:42:03,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 19:42:03,172 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:42:03,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 19:42:03,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-12-27 19:42:03,173 INFO L87 Difference]: Start difference. First operand 27069 states and 82068 transitions. Second operand 15 states. [2019-12-27 19:42:09,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:42:09,710 INFO L93 Difference]: Finished difference Result 99835 states and 299031 transitions. [2019-12-27 19:42:09,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-12-27 19:42:09,710 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2019-12-27 19:42:09,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:42:09,818 INFO L225 Difference]: With dead ends: 99835 [2019-12-27 19:42:09,818 INFO L226 Difference]: Without dead ends: 72638 [2019-12-27 19:42:09,820 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3837 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1438, Invalid=9068, Unknown=0, NotChecked=0, Total=10506 [2019-12-27 19:42:10,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72638 states. [2019-12-27 19:42:10,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72638 to 26684. [2019-12-27 19:42:10,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26684 states. [2019-12-27 19:42:10,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26684 states to 26684 states and 80357 transitions. [2019-12-27 19:42:10,566 INFO L78 Accepts]: Start accepts. Automaton has 26684 states and 80357 transitions. Word has length 67 [2019-12-27 19:42:10,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:42:10,566 INFO L462 AbstractCegarLoop]: Abstraction has 26684 states and 80357 transitions. [2019-12-27 19:42:10,567 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 19:42:10,567 INFO L276 IsEmpty]: Start isEmpty. Operand 26684 states and 80357 transitions. [2019-12-27 19:42:10,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 19:42:10,596 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:42:10,596 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 19:42:10,596 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:42:10,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:42:10,597 INFO L82 PathProgramCache]: Analyzing trace with hash -1265411945, now seen corresponding path program 4 times [2019-12-27 19:42:10,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:42:10,597 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522490362] [2019-12-27 19:42:10,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:42:10,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:42:10,749 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 19:42:10,750 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522490362] [2019-12-27 19:42:10,750 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:42:10,750 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 19:42:10,750 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1827813831] [2019-12-27 19:42:10,750 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:42:10,764 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:42:10,968 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 242 states and 464 transitions. [2019-12-27 19:42:10,968 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:42:11,074 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 11 times. [2019-12-27 19:42:11,074 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 19:42:11,075 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:42:11,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 19:42:11,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-27 19:42:11,075 INFO L87 Difference]: Start difference. First operand 26684 states and 80357 transitions. Second operand 12 states. [2019-12-27 19:42:12,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:42:12,109 INFO L93 Difference]: Finished difference Result 43186 states and 128782 transitions. [2019-12-27 19:42:12,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 19:42:12,109 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-27 19:42:12,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:42:12,169 INFO L225 Difference]: With dead ends: 43186 [2019-12-27 19:42:12,169 INFO L226 Difference]: Without dead ends: 42959 [2019-12-27 19:42:12,170 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 7 SyntacticMatches, 5 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=136, Invalid=566, Unknown=0, NotChecked=0, Total=702 [2019-12-27 19:42:12,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42959 states. [2019-12-27 19:42:12,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42959 to 26668. [2019-12-27 19:42:12,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26668 states. [2019-12-27 19:42:12,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26668 states to 26668 states and 80317 transitions. [2019-12-27 19:42:12,686 INFO L78 Accepts]: Start accepts. Automaton has 26668 states and 80317 transitions. Word has length 67 [2019-12-27 19:42:12,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:42:12,687 INFO L462 AbstractCegarLoop]: Abstraction has 26668 states and 80317 transitions. [2019-12-27 19:42:12,687 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 19:42:12,687 INFO L276 IsEmpty]: Start isEmpty. Operand 26668 states and 80317 transitions. [2019-12-27 19:42:12,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 19:42:12,715 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:42:12,715 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 19:42:12,715 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:42:12,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:42:12,715 INFO L82 PathProgramCache]: Analyzing trace with hash 56904589, now seen corresponding path program 5 times [2019-12-27 19:42:12,716 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:42:12,716 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251030679] [2019-12-27 19:42:12,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:42:12,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 19:42:12,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 19:42:12,820 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 19:42:12,820 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 19:42:12,824 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [901] [901] ULTIMATE.startENTRY-->L842: Formula: (let ((.cse0 (store |v_#valid_64| 0 0))) (and (= v_~main$tmp_guard0~0_10 0) (= 0 v_~a$mem_tmp~0_9) (= 0 v_~weak$$choice0~0_8) (= 0 v_~a$w_buff0_used~0_114) (= 0 v_~a$w_buff1_used~0_71) (= 0 v_~a$read_delayed_var~0.base_7) (= 0 v_~__unbuffered_cnt~0_20) (= v_~a$r_buff0_thd2~0_18 0) (= 0 v_~__unbuffered_p1_EAX~0_12) (= 0 v_~a$read_delayed~0_7) (= 0 v_~__unbuffered_p0_EAX~0_12) (= v_~a$read_delayed_var~0.offset_7 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t44~0.base_23| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t44~0.base_23|) |v_ULTIMATE.start_main_~#t44~0.offset_18| 0)) |v_#memory_int_21|) (= 0 v_~a$w_buff0~0_27) (= v_~__unbuffered_p2_EBX~0_12 0) (= 0 v_~a$r_buff1_thd1~0_15) (= v_~a$flush_delayed~0_12 0) (= 0 v_~z~0_7) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t44~0.base_23|) (= 0 |v_ULTIMATE.start_main_~#t44~0.offset_18|) (< 0 |v_#StackHeapBarrier_18|) (= 0 v_~__unbuffered_p2_EAX~0_11) (= 0 |v_#NULL.base_4|) (= 0 v_~weak$$choice2~0_33) (= (select .cse0 |v_ULTIMATE.start_main_~#t44~0.base_23|) 0) (= v_~a$r_buff0_thd0~0_18 0) (= |v_#valid_62| (store .cse0 |v_ULTIMATE.start_main_~#t44~0.base_23| 1)) (= v_~__unbuffered_p0_EBX~0_12 0) (= v_~a$r_buff0_thd1~0_23 0) (= v_~a$r_buff0_thd3~0_75 0) (= |v_#NULL.offset_4| 0) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t44~0.base_23| 4)) (= v_~main$tmp_guard1~0_13 0) (= 0 v_~a$w_buff1~0_25) (= 0 v_~a$r_buff1_thd2~0_18) (= v_~__unbuffered_p1_EBX~0_12 0) (= 0 v_~a$r_buff1_thd0~0_18) (= 0 v_~a$r_buff1_thd3~0_47) (= v_~a~0_27 0) (= 0 v_~x~0_8) (= 0 v_~y~0_9))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_18, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_13|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_11|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_18, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_11|, ~a~0=v_~a~0_27, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_17|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_12, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_12, ULTIMATE.start_main_~#t46~0.base=|v_ULTIMATE.start_main_~#t46~0.base_20|, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_11, ULTIMATE.start_main_~#t45~0.offset=|v_ULTIMATE.start_main_~#t45~0.offset_18|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_12, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_12, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_10|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_47, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_114, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_23, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_7, ~a$w_buff0~0=v_~a$w_buff0~0_27, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_18, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, ~x~0=v_~x~0_8, ~a$read_delayed~0=v_~a$read_delayed~0_7, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_18, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_13|, ULTIMATE.start_main_~#t46~0.offset=|v_ULTIMATE.start_main_~#t46~0.offset_15|, ULTIMATE.start_main_~#t45~0.base=|v_ULTIMATE.start_main_~#t45~0.base_23|, ~a$mem_tmp~0=v_~a$mem_tmp~0_9, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_11|, ~a$w_buff1~0=v_~a$w_buff1~0_25, ~y~0=v_~y~0_9, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_12, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_9|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_15, ULTIMATE.start_main_~#t44~0.base=|v_ULTIMATE.start_main_~#t44~0.base_23|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_75, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ULTIMATE.start_main_~#t44~0.offset=|v_ULTIMATE.start_main_~#t44~0.offset_18|, #NULL.base=|v_#NULL.base_4|, ~a$flush_delayed~0=v_~a$flush_delayed~0_12, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_7, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_71, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_7} AuxVars[] AssignedVars[~a$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ~a$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite50, ~a~0, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t46~0.base, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t45~0.offset, ~__unbuffered_p2_EBX~0, ~__unbuffered_p0_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, ULTIMATE.start_main_~#t46~0.offset, ULTIMATE.start_main_~#t45~0.base, ~a$mem_tmp~0, ULTIMATE.start_main_#t~ite51, ~a$w_buff1~0, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ~a$r_buff1_thd1~0, ULTIMATE.start_main_~#t44~0.base, ~a$r_buff0_thd3~0, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t44~0.offset, #NULL.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] because there is no mapped edge [2019-12-27 19:42:12,825 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [881] [881] P0ENTRY-->L4-3: Formula: (and (= ~a$w_buff1_used~0_Out-1311700766 ~a$w_buff0_used~0_In-1311700766) (= P0Thread1of1ForFork2_~arg.offset_Out-1311700766 |P0Thread1of1ForFork2_#in~arg.offset_In-1311700766|) (= ~a$w_buff1~0_Out-1311700766 ~a$w_buff0~0_In-1311700766) (= |P0Thread1of1ForFork2_#in~arg.base_In-1311700766| P0Thread1of1ForFork2_~arg.base_Out-1311700766) (= 0 (mod ~a$w_buff1_used~0_Out-1311700766 256)) (= P0Thread1of1ForFork2___VERIFIER_assert_~expression_Out-1311700766 |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression_Out-1311700766|) (= 1 ~a$w_buff0_used~0_Out-1311700766) (= 1 |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression_Out-1311700766|) (= ~a$w_buff0~0_Out-1311700766 1)) InVars {P0Thread1of1ForFork2_#in~arg.offset=|P0Thread1of1ForFork2_#in~arg.offset_In-1311700766|, ~a$w_buff0~0=~a$w_buff0~0_In-1311700766, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1311700766, P0Thread1of1ForFork2_#in~arg.base=|P0Thread1of1ForFork2_#in~arg.base_In-1311700766|} OutVars{~a$w_buff1~0=~a$w_buff1~0_Out-1311700766, P0Thread1of1ForFork2_#in~arg.offset=|P0Thread1of1ForFork2_#in~arg.offset_In-1311700766|, ~a$w_buff0~0=~a$w_buff0~0_Out-1311700766, P0Thread1of1ForFork2_~arg.offset=P0Thread1of1ForFork2_~arg.offset_Out-1311700766, ~a$w_buff0_used~0=~a$w_buff0_used~0_Out-1311700766, P0Thread1of1ForFork2___VERIFIER_assert_~expression=P0Thread1of1ForFork2___VERIFIER_assert_~expression_Out-1311700766, P0Thread1of1ForFork2_#in~arg.base=|P0Thread1of1ForFork2_#in~arg.base_In-1311700766|, ~a$w_buff1_used~0=~a$w_buff1_used~0_Out-1311700766, P0Thread1of1ForFork2_~arg.base=P0Thread1of1ForFork2_~arg.base_Out-1311700766, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression=|P0Thread1of1ForFork2___VERIFIER_assert_#in~expression_Out-1311700766|} AuxVars[] AssignedVars[~a$w_buff1~0, ~a$w_buff0~0, P0Thread1of1ForFork2_~arg.offset, ~a$w_buff0_used~0, P0Thread1of1ForFork2___VERIFIER_assert_~expression, ~a$w_buff1_used~0, P0Thread1of1ForFork2_~arg.base, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 19:42:12,826 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L842-1-->L844: Formula: (and (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t45~0.base_13| 4)) (= (select |v_#valid_37| |v_ULTIMATE.start_main_~#t45~0.base_13|) 0) (= 0 |v_ULTIMATE.start_main_~#t45~0.offset_11|) (not (= 0 |v_ULTIMATE.start_main_~#t45~0.base_13|)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t45~0.base_13|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t45~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t45~0.base_13|) |v_ULTIMATE.start_main_~#t45~0.offset_11| 1)) |v_#memory_int_13|) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t45~0.base_13| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|, ULTIMATE.start_main_~#t45~0.base=|v_ULTIMATE.start_main_~#t45~0.base_13|, ULTIMATE.start_main_~#t45~0.offset=|v_ULTIMATE.start_main_~#t45~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length, ULTIMATE.start_main_~#t45~0.base, ULTIMATE.start_main_~#t45~0.offset] because there is no mapped edge [2019-12-27 19:42:12,828 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L783-2-->L783-5: Formula: (let ((.cse1 (= |P1Thread1of1ForFork0_#t~ite10_Out-260447563| |P1Thread1of1ForFork0_#t~ite9_Out-260447563|)) (.cse2 (= (mod ~a$w_buff1_used~0_In-260447563 256) 0)) (.cse0 (= 0 (mod ~a$r_buff1_thd2~0_In-260447563 256)))) (or (and (not .cse0) .cse1 (not .cse2) (= |P1Thread1of1ForFork0_#t~ite9_Out-260447563| ~a$w_buff1~0_In-260447563)) (and (= ~a~0_In-260447563 |P1Thread1of1ForFork0_#t~ite9_Out-260447563|) .cse1 (or .cse2 .cse0)))) InVars {~a~0=~a~0_In-260447563, ~a$w_buff1~0=~a$w_buff1~0_In-260447563, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-260447563, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-260447563} OutVars{~a~0=~a~0_In-260447563, ~a$w_buff1~0=~a$w_buff1~0_In-260447563, P1Thread1of1ForFork0_#t~ite10=|P1Thread1of1ForFork0_#t~ite10_Out-260447563|, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-260447563, P1Thread1of1ForFork0_#t~ite9=|P1Thread1of1ForFork0_#t~ite9_Out-260447563|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-260447563} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite10, P1Thread1of1ForFork0_#t~ite9] because there is no mapped edge [2019-12-27 19:42:12,829 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L784-->L784-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In960680502 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd2~0_In960680502 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork0_#t~ite11_Out960680502| 0) (not .cse1)) (and (= |P1Thread1of1ForFork0_#t~ite11_Out960680502| ~a$w_buff0_used~0_In960680502) (or .cse1 .cse0)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In960680502, ~a$w_buff0_used~0=~a$w_buff0_used~0_In960680502} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In960680502, P1Thread1of1ForFork0_#t~ite11=|P1Thread1of1ForFork0_#t~ite11_Out960680502|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In960680502} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite11] because there is no mapped edge [2019-12-27 19:42:12,830 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L785-->L785-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In-1292904132 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In-1292904132 256))) (.cse3 (= 0 (mod ~a$r_buff1_thd2~0_In-1292904132 256))) (.cse2 (= 0 (mod ~a$w_buff1_used~0_In-1292904132 256)))) (or (and (= 0 |P1Thread1of1ForFork0_#t~ite12_Out-1292904132|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork0_#t~ite12_Out-1292904132| ~a$w_buff1_used~0_In-1292904132) (or .cse3 .cse2)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1292904132, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1292904132, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1292904132, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1292904132} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1292904132, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1292904132, P1Thread1of1ForFork0_#t~ite12=|P1Thread1of1ForFork0_#t~ite12_Out-1292904132|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1292904132, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1292904132} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-27 19:42:12,831 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [853] [853] L786-->L786-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd2~0_In-1481721515 256) 0)) (.cse0 (= (mod ~a$w_buff0_used~0_In-1481721515 256) 0))) (or (and (= ~a$r_buff0_thd2~0_In-1481721515 |P1Thread1of1ForFork0_#t~ite13_Out-1481721515|) (or .cse0 .cse1)) (and (= 0 |P1Thread1of1ForFork0_#t~ite13_Out-1481721515|) (not .cse1) (not .cse0)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1481721515, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1481721515} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1481721515, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1481721515, P1Thread1of1ForFork0_#t~ite13=|P1Thread1of1ForFork0_#t~ite13_Out-1481721515|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite13] because there is no mapped edge [2019-12-27 19:42:12,831 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [854] [854] L787-->L787-2: Formula: (let ((.cse0 (= (mod ~a$r_buff1_thd2~0_In-756370428 256) 0)) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In-756370428 256))) (.cse2 (= 0 (mod ~a$r_buff0_thd2~0_In-756370428 256))) (.cse3 (= 0 (mod ~a$w_buff0_used~0_In-756370428 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork0_#t~ite14_Out-756370428| 0)) (and (= |P1Thread1of1ForFork0_#t~ite14_Out-756370428| ~a$r_buff1_thd2~0_In-756370428) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-756370428, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-756370428, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-756370428, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-756370428} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-756370428, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-756370428, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-756370428, P1Thread1of1ForFork0_#t~ite14=|P1Thread1of1ForFork0_#t~ite14_Out-756370428|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-756370428} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-27 19:42:12,832 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [856] [856] L787-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= v_~a$r_buff1_thd2~0_13 |v_P1Thread1of1ForFork0_#t~ite14_8|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_11 1) v_~__unbuffered_cnt~0_10)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P1Thread1of1ForFork0_#t~ite14=|v_P1Thread1of1ForFork0_#t~ite14_8|} OutVars{~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_13, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, P1Thread1of1ForFork0_#t~ite14=|v_P1Thread1of1ForFork0_#t~ite14_7|, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[~a$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#t~ite14, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-27 19:42:12,832 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [876] [876] L844-1-->L846: Formula: (and (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t46~0.base_12|) (= 0 |v_ULTIMATE.start_main_~#t46~0.offset_10|) (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t46~0.base_12| 1)) (= |v_#memory_int_11| (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t46~0.base_12| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t46~0.base_12|) |v_ULTIMATE.start_main_~#t46~0.offset_10| 2))) (not (= 0 |v_ULTIMATE.start_main_~#t46~0.base_12|)) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t46~0.base_12| 4)) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t46~0.base_12|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t46~0.base=|v_ULTIMATE.start_main_~#t46~0.base_12|, #valid=|v_#valid_34|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_6|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|, ULTIMATE.start_main_~#t46~0.offset=|v_ULTIMATE.start_main_~#t46~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t46~0.base, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t46~0.offset] because there is no mapped edge [2019-12-27 19:42:12,834 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [882] [882] L808-->L808-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In243148168 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite21_Out243148168| ~a$w_buff0~0_In243148168) (= |P2Thread1of1ForFork1_#t~ite20_In243148168| |P2Thread1of1ForFork1_#t~ite20_Out243148168|)) (and (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In243148168 256) 0))) (or (and (= 0 (mod ~a$r_buff1_thd3~0_In243148168 256)) .cse1) (= 0 (mod ~a$w_buff0_used~0_In243148168 256)) (and .cse1 (= 0 (mod ~a$w_buff1_used~0_In243148168 256))))) .cse0 (= |P2Thread1of1ForFork1_#t~ite20_Out243148168| ~a$w_buff0~0_In243148168) (= |P2Thread1of1ForFork1_#t~ite20_Out243148168| |P2Thread1of1ForFork1_#t~ite21_Out243148168|)))) InVars {P2Thread1of1ForFork1_#t~ite20=|P2Thread1of1ForFork1_#t~ite20_In243148168|, ~a$w_buff0~0=~a$w_buff0~0_In243148168, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In243148168, ~a$w_buff0_used~0=~a$w_buff0_used~0_In243148168, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In243148168, ~a$w_buff1_used~0=~a$w_buff1_used~0_In243148168, ~weak$$choice2~0=~weak$$choice2~0_In243148168} OutVars{P2Thread1of1ForFork1_#t~ite20=|P2Thread1of1ForFork1_#t~ite20_Out243148168|, P2Thread1of1ForFork1_#t~ite21=|P2Thread1of1ForFork1_#t~ite21_Out243148168|, ~a$w_buff0~0=~a$w_buff0~0_In243148168, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In243148168, ~a$w_buff0_used~0=~a$w_buff0_used~0_In243148168, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In243148168, ~a$w_buff1_used~0=~a$w_buff1_used~0_In243148168, ~weak$$choice2~0=~weak$$choice2~0_In243148168} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite20, P2Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-27 19:42:12,836 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] L810-->L810-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-563989013 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite26_In-563989013| |P2Thread1of1ForFork1_#t~ite26_Out-563989013|) (= |P2Thread1of1ForFork1_#t~ite27_Out-563989013| ~a$w_buff0_used~0_In-563989013) (not .cse0)) (and (= |P2Thread1of1ForFork1_#t~ite26_Out-563989013| |P2Thread1of1ForFork1_#t~ite27_Out-563989013|) (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In-563989013 256) 0))) (or (and .cse1 (= 0 (mod ~a$w_buff1_used~0_In-563989013 256))) (and (= 0 (mod ~a$r_buff1_thd3~0_In-563989013 256)) .cse1) (= (mod ~a$w_buff0_used~0_In-563989013 256) 0))) (= |P2Thread1of1ForFork1_#t~ite26_Out-563989013| ~a$w_buff0_used~0_In-563989013) .cse0))) InVars {P2Thread1of1ForFork1_#t~ite26=|P2Thread1of1ForFork1_#t~ite26_In-563989013|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-563989013, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-563989013, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-563989013, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-563989013, ~weak$$choice2~0=~weak$$choice2~0_In-563989013} OutVars{P2Thread1of1ForFork1_#t~ite26=|P2Thread1of1ForFork1_#t~ite26_Out-563989013|, P2Thread1of1ForFork1_#t~ite27=|P2Thread1of1ForFork1_#t~ite27_Out-563989013|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-563989013, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-563989013, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-563989013, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-563989013, ~weak$$choice2~0=~weak$$choice2~0_In-563989013} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite26, P2Thread1of1ForFork1_#t~ite27] because there is no mapped edge [2019-12-27 19:42:12,837 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L812-->L813: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_15 256))) (= v_~a$r_buff0_thd3~0_48 v_~a$r_buff0_thd3~0_47)) InVars {~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_48, ~weak$$choice2~0=v_~weak$$choice2~0_15} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_9|, P2Thread1of1ForFork1_#t~ite31=|v_P2Thread1of1ForFork1_#t~ite31_8|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_9|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_47, ~weak$$choice2~0=v_~weak$$choice2~0_15} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite31, P2Thread1of1ForFork1_#t~ite33, ~a$r_buff0_thd3~0] because there is no mapped edge [2019-12-27 19:42:12,839 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [798] [798] L815-->L819: Formula: (and (not (= 0 (mod v_~a$flush_delayed~0_8 256))) (= v_~a$flush_delayed~0_7 0) (= v_~a~0_20 v_~a$mem_tmp~0_5)) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_5, ~a$flush_delayed~0=v_~a$flush_delayed~0_8} OutVars{~a~0=v_~a~0_20, ~a$mem_tmp~0=v_~a$mem_tmp~0_5, P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_7|, ~a$flush_delayed~0=v_~a$flush_delayed~0_7} AuxVars[] AssignedVars[~a~0, P2Thread1of1ForFork1_#t~ite37, ~a$flush_delayed~0] because there is no mapped edge [2019-12-27 19:42:12,839 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L819-2-->L819-4: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff1_thd3~0_In-1105380287 256))) (.cse0 (= (mod ~a$w_buff1_used~0_In-1105380287 256) 0))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork1_#t~ite38_Out-1105380287| ~a$w_buff1~0_In-1105380287)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork1_#t~ite38_Out-1105380287| ~a~0_In-1105380287)))) InVars {~a~0=~a~0_In-1105380287, ~a$w_buff1~0=~a$w_buff1~0_In-1105380287, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1105380287, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1105380287} OutVars{~a~0=~a~0_In-1105380287, P2Thread1of1ForFork1_#t~ite38=|P2Thread1of1ForFork1_#t~ite38_Out-1105380287|, ~a$w_buff1~0=~a$w_buff1~0_In-1105380287, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1105380287, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1105380287} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite38] because there is no mapped edge [2019-12-27 19:42:12,840 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L819-4-->L820: Formula: (= v_~a~0_18 |v_P2Thread1of1ForFork1_#t~ite38_8|) InVars {P2Thread1of1ForFork1_#t~ite38=|v_P2Thread1of1ForFork1_#t~ite38_8|} OutVars{~a~0=v_~a~0_18, P2Thread1of1ForFork1_#t~ite38=|v_P2Thread1of1ForFork1_#t~ite38_7|, P2Thread1of1ForFork1_#t~ite39=|v_P2Thread1of1ForFork1_#t~ite39_7|} AuxVars[] AssignedVars[~a~0, P2Thread1of1ForFork1_#t~ite38, P2Thread1of1ForFork1_#t~ite39] because there is no mapped edge [2019-12-27 19:42:12,840 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L820-->L820-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd3~0_In-2083682191 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-2083682191 256)))) (or (and (= ~a$w_buff0_used~0_In-2083682191 |P2Thread1of1ForFork1_#t~ite40_Out-2083682191|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |P2Thread1of1ForFork1_#t~ite40_Out-2083682191|) (not .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-2083682191, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-2083682191} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-2083682191, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-2083682191, P2Thread1of1ForFork1_#t~ite40=|P2Thread1of1ForFork1_#t~ite40_Out-2083682191|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite40] because there is no mapped edge [2019-12-27 19:42:12,840 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L821-->L821-2: Formula: (let ((.cse3 (= 0 (mod ~a$w_buff0_used~0_In1355370042 256))) (.cse2 (= (mod ~a$r_buff0_thd3~0_In1355370042 256) 0)) (.cse1 (= 0 (mod ~a$r_buff1_thd3~0_In1355370042 256))) (.cse0 (= (mod ~a$w_buff1_used~0_In1355370042 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite41_Out1355370042| ~a$w_buff1_used~0_In1355370042) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P2Thread1of1ForFork1_#t~ite41_Out1355370042| 0)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1355370042, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1355370042, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1355370042, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1355370042} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1355370042, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1355370042, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1355370042, P2Thread1of1ForFork1_#t~ite41=|P2Thread1of1ForFork1_#t~ite41_Out1355370042|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1355370042} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite41] because there is no mapped edge [2019-12-27 19:42:12,841 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L822-->L822-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In1276502487 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In1276502487 256)))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork1_#t~ite42_Out1276502487|) (not .cse1)) (and (= ~a$r_buff0_thd3~0_In1276502487 |P2Thread1of1ForFork1_#t~ite42_Out1276502487|) (or .cse1 .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1276502487, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1276502487} OutVars{P2Thread1of1ForFork1_#t~ite42=|P2Thread1of1ForFork1_#t~ite42_Out1276502487|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1276502487, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1276502487} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite42] because there is no mapped edge [2019-12-27 19:42:12,842 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L823-->L823-2: Formula: (let ((.cse3 (= 0 (mod ~a$r_buff0_thd3~0_In1200483694 256))) (.cse2 (= (mod ~a$w_buff0_used~0_In1200483694 256) 0)) (.cse1 (= (mod ~a$w_buff1_used~0_In1200483694 256) 0)) (.cse0 (= 0 (mod ~a$r_buff1_thd3~0_In1200483694 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite43_Out1200483694| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~a$r_buff1_thd3~0_In1200483694 |P2Thread1of1ForFork1_#t~ite43_Out1200483694|) (or .cse1 .cse0)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1200483694, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1200483694, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1200483694, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1200483694} OutVars{P2Thread1of1ForFork1_#t~ite43=|P2Thread1of1ForFork1_#t~ite43_Out1200483694|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1200483694, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1200483694, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1200483694, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1200483694} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite43] because there is no mapped edge [2019-12-27 19:42:12,842 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L823-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= v_~a$r_buff1_thd3~0_40 |v_P2Thread1of1ForFork1_#t~ite43_8|)) InVars {P2Thread1of1ForFork1_#t~ite43=|v_P2Thread1of1ForFork1_#t~ite43_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{P2Thread1of1ForFork1_#t~ite43=|v_P2Thread1of1ForFork1_#t~ite43_7|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_40, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite43, P2Thread1of1ForFork1_#res.base, ~a$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-27 19:42:12,842 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L761-->L761-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd1~0_In1321368128 256) 0)) (.cse1 (= (mod ~a$w_buff0_used~0_In1321368128 256) 0))) (or (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In1321368128 |P0Thread1of1ForFork2_#t~ite5_Out1321368128|)) (and (not .cse0) (= 0 |P0Thread1of1ForFork2_#t~ite5_Out1321368128|) (not .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1321368128, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1321368128} OutVars{P0Thread1of1ForFork2_#t~ite5=|P0Thread1of1ForFork2_#t~ite5_Out1321368128|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1321368128, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1321368128} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-27 19:42:12,843 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L762-->L762-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In-1428709607 256))) (.cse0 (= (mod ~a$r_buff0_thd1~0_In-1428709607 256) 0)) (.cse2 (= 0 (mod ~a$w_buff1_used~0_In-1428709607 256))) (.cse3 (= 0 (mod ~a$r_buff1_thd1~0_In-1428709607 256)))) (or (and (= 0 |P0Thread1of1ForFork2_#t~ite6_Out-1428709607|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse2 .cse3) (= ~a$w_buff1_used~0_In-1428709607 |P0Thread1of1ForFork2_#t~ite6_Out-1428709607|)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1428709607, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1428709607, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1428709607, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1428709607} OutVars{~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1428709607, P0Thread1of1ForFork2_#t~ite6=|P0Thread1of1ForFork2_#t~ite6_Out-1428709607|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1428709607, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1428709607, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1428709607} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-27 19:42:12,844 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L763-->L764: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd1~0_In1045500993 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In1045500993 256)))) (or (and (= ~a$r_buff0_thd1~0_Out1045500993 0) (not .cse0) (not .cse1)) (and (= ~a$r_buff0_thd1~0_Out1045500993 ~a$r_buff0_thd1~0_In1045500993) (or .cse1 .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1045500993, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1045500993} OutVars{P0Thread1of1ForFork2_#t~ite7=|P0Thread1of1ForFork2_#t~ite7_Out1045500993|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1045500993, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out1045500993} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 19:42:12,844 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L764-->L764-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff1_thd1~0_In-8236162 256))) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In-8236162 256))) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In-8236162 256))) (.cse3 (= 0 (mod ~a$r_buff0_thd1~0_In-8236162 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork2_#t~ite8_Out-8236162| 0)) (and (or .cse1 .cse0) (or .cse2 .cse3) (= ~a$r_buff1_thd1~0_In-8236162 |P0Thread1of1ForFork2_#t~ite8_Out-8236162|)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-8236162, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-8236162, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-8236162, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-8236162} OutVars{P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_Out-8236162|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-8236162, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-8236162, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-8236162, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-8236162} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-27 19:42:12,844 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [878] [878] L764-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= 0 |v_P0Thread1of1ForFork2_#res.base_5|) (= |v_P0Thread1of1ForFork2_#t~ite8_8| v_~a$r_buff1_thd1~0_10)) InVars {P0Thread1of1ForFork2_#t~ite8=|v_P0Thread1of1ForFork2_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16} OutVars{P0Thread1of1ForFork2_#t~ite8=|v_P0Thread1of1ForFork2_#t~ite8_7|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_10, P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite8, ~a$r_buff1_thd1~0, P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-27 19:42:12,844 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L846-1-->L852: Formula: (and (= v_~__unbuffered_cnt~0_9 3) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 19:42:12,845 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L852-2-->L852-4: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff1_thd0~0_In1789725700 256))) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In1789725700 256)))) (or (and (= ~a~0_In1789725700 |ULTIMATE.start_main_#t~ite47_Out1789725700|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= ~a$w_buff1~0_In1789725700 |ULTIMATE.start_main_#t~ite47_Out1789725700|)))) InVars {~a~0=~a~0_In1789725700, ~a$w_buff1~0=~a$w_buff1~0_In1789725700, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1789725700, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1789725700} OutVars{~a~0=~a~0_In1789725700, ~a$w_buff1~0=~a$w_buff1~0_In1789725700, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out1789725700|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1789725700, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1789725700} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-27 19:42:12,845 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [802] [802] L852-4-->L853: Formula: (= v_~a~0_22 |v_ULTIMATE.start_main_#t~ite47_7|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_7|} OutVars{~a~0=v_~a~0_22, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_6|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_6|} AuxVars[] AssignedVars[~a~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 19:42:12,845 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L853-->L853-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd0~0_In42756430 256) 0)) (.cse1 (= (mod ~a$w_buff0_used~0_In42756430 256) 0))) (or (and (= ~a$w_buff0_used~0_In42756430 |ULTIMATE.start_main_#t~ite49_Out42756430|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite49_Out42756430|) (not .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In42756430, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In42756430} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In42756430, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out42756430|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In42756430} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 19:42:12,846 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L854-->L854-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff1_thd0~0_In-1941626393 256))) (.cse0 (= (mod ~a$w_buff1_used~0_In-1941626393 256) 0)) (.cse2 (= 0 (mod ~a$r_buff0_thd0~0_In-1941626393 256))) (.cse3 (= (mod ~a$w_buff0_used~0_In-1941626393 256) 0))) (or (and (= ~a$w_buff1_used~0_In-1941626393 |ULTIMATE.start_main_#t~ite50_Out-1941626393|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite50_Out-1941626393|)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1941626393, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1941626393, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1941626393, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1941626393} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-1941626393|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1941626393, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1941626393, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1941626393, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1941626393} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 19:42:12,846 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L855-->L855-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In-735435661 256) 0)) (.cse1 (= (mod ~a$r_buff0_thd0~0_In-735435661 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite51_Out-735435661|)) (and (= ~a$r_buff0_thd0~0_In-735435661 |ULTIMATE.start_main_#t~ite51_Out-735435661|) (or .cse0 .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-735435661, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-735435661} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-735435661|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-735435661, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-735435661} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 19:42:12,847 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [851] [851] L856-->L856-2: Formula: (let ((.cse3 (= 0 (mod ~a$r_buff1_thd0~0_In-1250694799 256))) (.cse2 (= (mod ~a$w_buff1_used~0_In-1250694799 256) 0)) (.cse0 (= 0 (mod ~a$r_buff0_thd0~0_In-1250694799 256))) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-1250694799 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite52_Out-1250694799| ~a$r_buff1_thd0~0_In-1250694799)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= 0 |ULTIMATE.start_main_#t~ite52_Out-1250694799|)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1250694799, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1250694799, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1250694799, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1250694799} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-1250694799|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1250694799, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1250694799, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1250694799, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1250694799} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 19:42:12,847 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [891] [891] L856-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~__unbuffered_p2_EAX~0_8 1) (= v_~main$tmp_guard1~0_9 0) (= 1 v_~__unbuffered_p1_EAX~0_8) (= 0 v_~__unbuffered_p1_EBX~0_8) (= v_~__unbuffered_p2_EBX~0_9 0) (= v_~__unbuffered_p0_EBX~0_8 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|) (= v_~__unbuffered_p0_EAX~0_8 1) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 0) (= |v_ULTIMATE.start_main_#t~ite52_12| v_~a$r_buff1_thd0~0_14)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_12|, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_8, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_11|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_8, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_14, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} 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 19:42:12,952 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 07:42:12 BasicIcfg [2019-12-27 19:42:12,952 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 19:42:12,953 INFO L168 Benchmark]: Toolchain (without parser) took 175965.01 ms. Allocated memory was 139.5 MB in the beginning and 3.9 GB in the end (delta: 3.8 GB). Free memory was 102.7 MB in the beginning and 818.7 MB in the end (delta: -716.0 MB). Peak memory consumption was 3.1 GB. Max. memory is 7.1 GB. [2019-12-27 19:42:12,954 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 139.5 MB. Free memory was 122.7 MB in the beginning and 122.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 19:42:12,954 INFO L168 Benchmark]: CACSL2BoogieTranslator took 765.43 ms. Allocated memory was 139.5 MB in the beginning and 203.9 MB in the end (delta: 64.5 MB). Free memory was 102.3 MB in the beginning and 157.4 MB in the end (delta: -55.1 MB). Peak memory consumption was 25.9 MB. Max. memory is 7.1 GB. [2019-12-27 19:42:12,955 INFO L168 Benchmark]: Boogie Procedure Inliner took 73.50 ms. Allocated memory is still 203.9 MB. Free memory was 157.4 MB in the beginning and 154.1 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2019-12-27 19:42:12,955 INFO L168 Benchmark]: Boogie Preprocessor took 40.54 ms. Allocated memory is still 203.9 MB. Free memory was 154.1 MB in the beginning and 152.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 19:42:12,955 INFO L168 Benchmark]: RCFGBuilder took 839.16 ms. Allocated memory is still 203.9 MB. Free memory was 152.1 MB in the beginning and 101.0 MB in the end (delta: 51.2 MB). Peak memory consumption was 51.2 MB. Max. memory is 7.1 GB. [2019-12-27 19:42:12,956 INFO L168 Benchmark]: TraceAbstraction took 174240.91 ms. Allocated memory was 203.9 MB in the beginning and 3.9 GB in the end (delta: 3.7 GB). Free memory was 101.0 MB in the beginning and 818.7 MB in the end (delta: -717.7 MB). Peak memory consumption was 3.0 GB. Max. memory is 7.1 GB. [2019-12-27 19:42:12,958 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.16 ms. Allocated memory is still 139.5 MB. Free memory was 122.7 MB in the beginning and 122.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 765.43 ms. Allocated memory was 139.5 MB in the beginning and 203.9 MB in the end (delta: 64.5 MB). Free memory was 102.3 MB in the beginning and 157.4 MB in the end (delta: -55.1 MB). Peak memory consumption was 25.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 73.50 ms. Allocated memory is still 203.9 MB. Free memory was 157.4 MB in the beginning and 154.1 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.54 ms. Allocated memory is still 203.9 MB. Free memory was 154.1 MB in the beginning and 152.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 839.16 ms. Allocated memory is still 203.9 MB. Free memory was 152.1 MB in the beginning and 101.0 MB in the end (delta: 51.2 MB). Peak memory consumption was 51.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 174240.91 ms. Allocated memory was 203.9 MB in the beginning and 3.9 GB in the end (delta: 3.7 GB). Free memory was 101.0 MB in the beginning and 818.7 MB in the end (delta: -717.7 MB). Peak memory consumption was 3.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.1s, 180 ProgramPointsBefore, 96 ProgramPointsAfterwards, 217 TransitionsBefore, 106 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 8 FixpointIterations, 37 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 31 ChoiceCompositions, 7307 VarBasedMoverChecksPositive, 219 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 96061 CheckedPairsTotal, 115 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L842] FCALL, FORK 0 pthread_create(&t44, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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] [L744] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L745] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L746] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L747] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L748] 1 a$r_buff0_thd1 = (_Bool)1 [L751] 1 x = 1 [L754] 1 __unbuffered_p0_EAX = x [L757] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L760] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L844] FCALL, FORK 0 pthread_create(&t45, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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] [L774] 2 y = 1 [L777] 2 __unbuffered_p1_EAX = y [L780] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L783] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L760] 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) [L783] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L784] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L785] 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 [L786] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L846] FCALL, FORK 0 pthread_create(&t46, ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L797] 3 z = 1 [L800] 3 __unbuffered_p2_EAX = z [L803] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L804] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L805] 3 a$flush_delayed = weak$$choice2 [L806] 3 a$mem_tmp = a VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L807] 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, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L807] 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) [L808] 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)) [L809] 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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1))=0, x=1, y=1, z=1] [L809] 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)) [L810] 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)) [L811] EXPR 3 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L811] 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)) [L813] 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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L813] 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)) [L814] 3 __unbuffered_p2_EBX = a VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L819] 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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L820] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L821] 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 [L822] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L761] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L762] 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 [L852] 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L853] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L854] 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 [L855] 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, 171 locations, 2 error locations. Result: UNSAFE, OverallTime: 173.8s, OverallIterations: 36, TraceHistogramMax: 1, AutomataDifference: 79.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 10653 SDtfs, 18510 SDslu, 43070 SDs, 0 SdLazy, 34536 SolverSat, 1384 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 32.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1178 GetRequests, 285 SyntacticMatches, 103 SemanticMatches, 790 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17337 ImplicationChecksByTransitivity, 19.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=166753occurred 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: 56.0s AutomataMinimizationTime, 35 MinimizatonAttempts, 914952 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 1895 NumberOfCodeBlocks, 1895 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 1793 ConstructedInterpolants, 0 QuantifiedInterpolants, 389306 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 35 InterpolantComputations, 35 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...