/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/mix031_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 20:54:32,682 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 20:54:32,685 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 20:54:32,702 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 20:54:32,703 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 20:54:32,704 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 20:54:32,705 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 20:54:32,707 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 20:54:32,709 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 20:54:32,709 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 20:54:32,710 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 20:54:32,711 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 20:54:32,712 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 20:54:32,713 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 20:54:32,714 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 20:54:32,715 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 20:54:32,715 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 20:54:32,716 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 20:54:32,718 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 20:54:32,720 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 20:54:32,721 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 20:54:32,722 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 20:54:32,723 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 20:54:32,724 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 20:54:32,726 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 20:54:32,727 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 20:54:32,727 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 20:54:32,728 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 20:54:32,728 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 20:54:32,729 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 20:54:32,729 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 20:54:32,730 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 20:54:32,731 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 20:54:32,732 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 20:54:32,733 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 20:54:32,733 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 20:54:32,733 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 20:54:32,734 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 20:54:32,734 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 20:54:32,735 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 20:54:32,735 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 20:54:32,736 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 20:54:32,750 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 20:54:32,750 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 20:54:32,751 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 20:54:32,751 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 20:54:32,752 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 20:54:32,752 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 20:54:32,752 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 20:54:32,752 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 20:54:32,752 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 20:54:32,753 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 20:54:32,753 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 20:54:32,753 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 20:54:32,753 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 20:54:32,753 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 20:54:32,754 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 20:54:32,754 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 20:54:32,754 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 20:54:32,754 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 20:54:32,754 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 20:54:32,755 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 20:54:32,755 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 20:54:32,755 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 20:54:32,755 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 20:54:32,755 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 20:54:32,756 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 20:54:32,756 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 20:54:32,756 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 20:54:32,756 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 20:54:32,756 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 20:54:32,757 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 20:54:32,757 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 20:54:32,757 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 20:54:33,012 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 20:54:33,030 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 20:54:33,035 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 20:54:33,037 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 20:54:33,038 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 20:54:33,040 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix031_power.oepc.i [2019-12-27 20:54:33,122 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/013851ee5/f6a8484ad9af49d49f41241dd7106e80/FLAG71343810e [2019-12-27 20:54:33,672 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 20:54:33,672 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix031_power.oepc.i [2019-12-27 20:54:33,690 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/013851ee5/f6a8484ad9af49d49f41241dd7106e80/FLAG71343810e [2019-12-27 20:54:33,937 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/013851ee5/f6a8484ad9af49d49f41241dd7106e80 [2019-12-27 20:54:33,946 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 20:54:33,947 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 20:54:33,949 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 20:54:33,949 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 20:54:33,952 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 20:54:33,953 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:54:33" (1/1) ... [2019-12-27 20:54:33,956 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6943ffe6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:54:33, skipping insertion in model container [2019-12-27 20:54:33,956 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:54:33" (1/1) ... [2019-12-27 20:54:33,963 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 20:54:34,025 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 20:54:34,580 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 20:54:34,596 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 20:54:34,657 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 20:54:34,729 INFO L208 MainTranslator]: Completed translation [2019-12-27 20:54:34,729 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:54:34 WrapperNode [2019-12-27 20:54:34,730 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 20:54:34,730 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 20:54:34,731 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 20:54:34,731 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 20:54:34,739 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:54:34" (1/1) ... [2019-12-27 20:54:34,759 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:54:34" (1/1) ... [2019-12-27 20:54:34,815 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 20:54:34,815 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 20:54:34,816 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 20:54:34,816 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 20:54:34,828 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:54:34" (1/1) ... [2019-12-27 20:54:34,828 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:54:34" (1/1) ... [2019-12-27 20:54:34,833 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:54:34" (1/1) ... [2019-12-27 20:54:34,834 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:54:34" (1/1) ... [2019-12-27 20:54:34,843 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:54:34" (1/1) ... [2019-12-27 20:54:34,847 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:54:34" (1/1) ... [2019-12-27 20:54:34,851 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:54:34" (1/1) ... [2019-12-27 20:54:34,855 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 20:54:34,862 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 20:54:34,862 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 20:54:34,862 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 20:54:34,863 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:54:34" (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 20:54:34,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 20:54:34,914 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 20:54:34,914 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 20:54:34,914 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 20:54:34,915 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 20:54:34,915 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 20:54:34,915 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 20:54:34,915 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 20:54:34,915 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 20:54:34,916 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 20:54:34,916 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 20:54:34,918 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 20:54:35,645 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 20:54:35,646 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 20:54:35,647 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:54:35 BoogieIcfgContainer [2019-12-27 20:54:35,647 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 20:54:35,649 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 20:54:35,649 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 20:54:35,652 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 20:54:35,652 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 08:54:33" (1/3) ... [2019-12-27 20:54:35,653 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@281bae1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:54:35, skipping insertion in model container [2019-12-27 20:54:35,654 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:54:34" (2/3) ... [2019-12-27 20:54:35,654 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@281bae1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:54:35, skipping insertion in model container [2019-12-27 20:54:35,654 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:54:35" (3/3) ... [2019-12-27 20:54:35,656 INFO L109 eAbstractionObserver]: Analyzing ICFG mix031_power.oepc.i [2019-12-27 20:54:35,667 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 20:54:35,667 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 20:54:35,675 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 20:54:35,676 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 20:54:35,714 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,714 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,715 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,715 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,715 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,715 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,716 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,716 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,717 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,717 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,717 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,717 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,718 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,718 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,718 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,719 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,719 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,719 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,719 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,720 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,720 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,720 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,720 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,721 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,721 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,721 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,721 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,722 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,722 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,722 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,722 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,723 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,723 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,723 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,724 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,726 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,726 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,726 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,727 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,727 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,727 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,727 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,728 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,728 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,728 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,728 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,729 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,729 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,729 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,729 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,729 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,732 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,732 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,732 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,732 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,733 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,733 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,733 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,733 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,734 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,734 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,734 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,734 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,734 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,735 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,735 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,735 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,735 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,736 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,736 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,736 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,736 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,737 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,737 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,737 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,737 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,738 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,738 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,738 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,738 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,739 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,739 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,739 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,739 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,740 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,740 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,740 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,740 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,740 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,741 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,741 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,741 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,742 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,742 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,742 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,742 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,743 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,743 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,743 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,743 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,744 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,744 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,744 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,744 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,745 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,745 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,745 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,745 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,746 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,746 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,746 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,746 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,747 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,747 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,747 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,747 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,748 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,748 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,769 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,771 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,771 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,772 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,772 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,772 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,772 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,772 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,772 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,773 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,773 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,774 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,774 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,774 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,774 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,774 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,775 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,775 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,775 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,775 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,776 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,776 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,782 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,782 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,782 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,782 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,783 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,783 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,783 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,783 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,783 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,784 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,784 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,784 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,787 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,787 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,787 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,787 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,788 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,788 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,788 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,788 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,788 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,789 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,789 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,789 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,789 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,789 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,790 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,790 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,790 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,790 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,790 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,791 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,791 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,791 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,791 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,791 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,792 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,792 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,792 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,792 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,792 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,792 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,793 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,793 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,793 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:35,808 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 20:54:35,828 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 20:54:35,828 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 20:54:35,828 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 20:54:35,828 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 20:54:35,828 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 20:54:35,828 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 20:54:35,829 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 20:54:35,829 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 20:54:35,845 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 151 places, 185 transitions [2019-12-27 20:54:35,847 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 151 places, 185 transitions [2019-12-27 20:54:35,969 INFO L132 PetriNetUnfolder]: 41/183 cut-off events. [2019-12-27 20:54:35,969 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 20:54:35,988 INFO L76 FinitePrefix]: Finished finitePrefix Result has 190 conditions, 183 events. 41/183 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 341 event pairs. 0/140 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 20:54:36,007 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 151 places, 185 transitions [2019-12-27 20:54:36,083 INFO L132 PetriNetUnfolder]: 41/183 cut-off events. [2019-12-27 20:54:36,083 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 20:54:36,092 INFO L76 FinitePrefix]: Finished finitePrefix Result has 190 conditions, 183 events. 41/183 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 341 event pairs. 0/140 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 20:54:36,111 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-27 20:54:36,112 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 20:54:39,664 WARN L192 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-27 20:54:39,781 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-27 20:54:39,968 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-27 20:54:40,091 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-27 20:54:40,113 INFO L206 etLargeBlockEncoding]: Checked pairs total: 56825 [2019-12-27 20:54:40,113 INFO L214 etLargeBlockEncoding]: Total number of compositions: 105 [2019-12-27 20:54:40,117 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 78 places, 90 transitions [2019-12-27 20:54:40,561 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8850 states. [2019-12-27 20:54:40,564 INFO L276 IsEmpty]: Start isEmpty. Operand 8850 states. [2019-12-27 20:54:40,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 20:54:40,570 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:54:40,571 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 20:54:40,571 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:54:40,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:54:40,578 INFO L82 PathProgramCache]: Analyzing trace with hash 799211, now seen corresponding path program 1 times [2019-12-27 20:54:40,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:54:40,590 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500014238] [2019-12-27 20:54:40,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:54:40,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:54:40,789 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 20:54:40,790 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500014238] [2019-12-27 20:54:40,791 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:54:40,791 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 20:54:40,792 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1587504605] [2019-12-27 20:54:40,794 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:54:40,800 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:54:40,815 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 20:54:40,816 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:54:40,822 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:54:40,822 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:54:40,822 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:54:40,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:54:40,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:54:40,840 INFO L87 Difference]: Start difference. First operand 8850 states. Second operand 3 states. [2019-12-27 20:54:41,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:54:41,139 INFO L93 Difference]: Finished difference Result 8682 states and 28632 transitions. [2019-12-27 20:54:41,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:54:41,141 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 20:54:41,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:54:41,242 INFO L225 Difference]: With dead ends: 8682 [2019-12-27 20:54:41,242 INFO L226 Difference]: Without dead ends: 8178 [2019-12-27 20:54:41,243 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 20:54:41,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8178 states. [2019-12-27 20:54:41,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8178 to 8178. [2019-12-27 20:54:41,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8178 states. [2019-12-27 20:54:41,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8178 states to 8178 states and 26922 transitions. [2019-12-27 20:54:41,798 INFO L78 Accepts]: Start accepts. Automaton has 8178 states and 26922 transitions. Word has length 3 [2019-12-27 20:54:41,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:54:41,798 INFO L462 AbstractCegarLoop]: Abstraction has 8178 states and 26922 transitions. [2019-12-27 20:54:41,799 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:54:41,799 INFO L276 IsEmpty]: Start isEmpty. Operand 8178 states and 26922 transitions. [2019-12-27 20:54:41,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 20:54:41,802 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:54:41,802 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:54:41,803 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:54:41,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:54:41,803 INFO L82 PathProgramCache]: Analyzing trace with hash -1718486747, now seen corresponding path program 1 times [2019-12-27 20:54:41,803 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:54:41,804 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516587259] [2019-12-27 20:54:41,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:54:41,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:54:41,869 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 20:54:41,870 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516587259] [2019-12-27 20:54:41,870 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:54:41,870 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:54:41,870 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1323655088] [2019-12-27 20:54:41,870 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:54:41,873 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:54:41,876 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 20:54:41,876 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:54:41,878 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:54:41,879 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:54:41,879 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:54:41,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:54:41,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:54:41,880 INFO L87 Difference]: Start difference. First operand 8178 states and 26922 transitions. Second operand 3 states. [2019-12-27 20:54:41,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:54:41,914 INFO L93 Difference]: Finished difference Result 1311 states and 3027 transitions. [2019-12-27 20:54:41,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:54:41,915 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-27 20:54:41,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:54:41,922 INFO L225 Difference]: With dead ends: 1311 [2019-12-27 20:54:41,922 INFO L226 Difference]: Without dead ends: 1311 [2019-12-27 20:54:41,923 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 20:54:41,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1311 states. [2019-12-27 20:54:41,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1311 to 1311. [2019-12-27 20:54:41,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1311 states. [2019-12-27 20:54:41,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1311 states to 1311 states and 3027 transitions. [2019-12-27 20:54:41,957 INFO L78 Accepts]: Start accepts. Automaton has 1311 states and 3027 transitions. Word has length 11 [2019-12-27 20:54:41,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:54:41,958 INFO L462 AbstractCegarLoop]: Abstraction has 1311 states and 3027 transitions. [2019-12-27 20:54:41,958 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:54:41,958 INFO L276 IsEmpty]: Start isEmpty. Operand 1311 states and 3027 transitions. [2019-12-27 20:54:41,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 20:54:41,960 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:54:41,960 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:54:41,960 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:54:41,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:54:41,961 INFO L82 PathProgramCache]: Analyzing trace with hash 950402147, now seen corresponding path program 1 times [2019-12-27 20:54:41,961 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:54:41,961 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848034383] [2019-12-27 20:54:41,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:54:42,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:54:42,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:54:42,106 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848034383] [2019-12-27 20:54:42,106 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:54:42,108 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:54:42,108 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [228414360] [2019-12-27 20:54:42,108 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:54:42,112 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:54:42,116 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 15 states and 14 transitions. [2019-12-27 20:54:42,116 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:54:42,117 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:54:42,117 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:54:42,117 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:54:42,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:54:42,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:54:42,118 INFO L87 Difference]: Start difference. First operand 1311 states and 3027 transitions. Second operand 3 states. [2019-12-27 20:54:42,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:54:42,203 INFO L93 Difference]: Finished difference Result 2020 states and 4648 transitions. [2019-12-27 20:54:42,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:54:42,204 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-27 20:54:42,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:54:42,216 INFO L225 Difference]: With dead ends: 2020 [2019-12-27 20:54:42,217 INFO L226 Difference]: Without dead ends: 2020 [2019-12-27 20:54:42,218 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 20:54:42,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2020 states. [2019-12-27 20:54:42,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2020 to 1471. [2019-12-27 20:54:42,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1471 states. [2019-12-27 20:54:42,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1471 states to 1471 states and 3484 transitions. [2019-12-27 20:54:42,267 INFO L78 Accepts]: Start accepts. Automaton has 1471 states and 3484 transitions. Word has length 14 [2019-12-27 20:54:42,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:54:42,267 INFO L462 AbstractCegarLoop]: Abstraction has 1471 states and 3484 transitions. [2019-12-27 20:54:42,267 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:54:42,267 INFO L276 IsEmpty]: Start isEmpty. Operand 1471 states and 3484 transitions. [2019-12-27 20:54:42,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 20:54:42,271 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:54:42,271 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:54:42,271 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:54:42,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:54:42,272 INFO L82 PathProgramCache]: Analyzing trace with hash 950504478, now seen corresponding path program 1 times [2019-12-27 20:54:42,275 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:54:42,276 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911387735] [2019-12-27 20:54:42,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:54:42,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:54:42,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:54:42,384 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911387735] [2019-12-27 20:54:42,384 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:54:42,384 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:54:42,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1310981471] [2019-12-27 20:54:42,384 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:54:42,389 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:54:42,392 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 15 states and 14 transitions. [2019-12-27 20:54:42,393 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:54:42,393 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:54:42,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:54:42,394 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:54:42,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:54:42,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:54:42,394 INFO L87 Difference]: Start difference. First operand 1471 states and 3484 transitions. Second operand 4 states. [2019-12-27 20:54:42,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:54:42,637 INFO L93 Difference]: Finished difference Result 1830 states and 4214 transitions. [2019-12-27 20:54:42,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:54:42,638 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 20:54:42,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:54:42,648 INFO L225 Difference]: With dead ends: 1830 [2019-12-27 20:54:42,648 INFO L226 Difference]: Without dead ends: 1830 [2019-12-27 20:54:42,649 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 20:54:42,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1830 states. [2019-12-27 20:54:42,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1830 to 1766. [2019-12-27 20:54:42,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1766 states. [2019-12-27 20:54:42,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1766 states to 1766 states and 4090 transitions. [2019-12-27 20:54:42,696 INFO L78 Accepts]: Start accepts. Automaton has 1766 states and 4090 transitions. Word has length 14 [2019-12-27 20:54:42,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:54:42,697 INFO L462 AbstractCegarLoop]: Abstraction has 1766 states and 4090 transitions. [2019-12-27 20:54:42,697 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:54:42,697 INFO L276 IsEmpty]: Start isEmpty. Operand 1766 states and 4090 transitions. [2019-12-27 20:54:42,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 20:54:42,698 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:54:42,698 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:54:42,698 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:54:42,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:54:42,699 INFO L82 PathProgramCache]: Analyzing trace with hash 785604646, now seen corresponding path program 1 times [2019-12-27 20:54:42,699 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:54:42,700 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430041904] [2019-12-27 20:54:42,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:54:42,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:54:42,773 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 20:54:42,774 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430041904] [2019-12-27 20:54:42,774 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:54:42,774 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:54:42,775 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [995951945] [2019-12-27 20:54:42,775 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:54:42,777 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:54:42,779 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 15 states and 14 transitions. [2019-12-27 20:54:42,779 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:54:42,779 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:54:42,779 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:54:42,780 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:54:42,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:54:42,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:54:42,780 INFO L87 Difference]: Start difference. First operand 1766 states and 4090 transitions. Second operand 4 states. [2019-12-27 20:54:42,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:54:42,977 INFO L93 Difference]: Finished difference Result 2141 states and 4886 transitions. [2019-12-27 20:54:42,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:54:42,977 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 20:54:42,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:54:42,998 INFO L225 Difference]: With dead ends: 2141 [2019-12-27 20:54:42,999 INFO L226 Difference]: Without dead ends: 2141 [2019-12-27 20:54:42,999 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 20:54:43,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2141 states. [2019-12-27 20:54:43,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2141 to 1881. [2019-12-27 20:54:43,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1881 states. [2019-12-27 20:54:43,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1881 states to 1881 states and 4350 transitions. [2019-12-27 20:54:43,044 INFO L78 Accepts]: Start accepts. Automaton has 1881 states and 4350 transitions. Word has length 14 [2019-12-27 20:54:43,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:54:43,044 INFO L462 AbstractCegarLoop]: Abstraction has 1881 states and 4350 transitions. [2019-12-27 20:54:43,045 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:54:43,045 INFO L276 IsEmpty]: Start isEmpty. Operand 1881 states and 4350 transitions. [2019-12-27 20:54:43,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 20:54:43,047 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:54:43,047 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 20:54:43,047 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:54:43,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:54:43,048 INFO L82 PathProgramCache]: Analyzing trace with hash -1292642456, now seen corresponding path program 1 times [2019-12-27 20:54:43,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:54:43,048 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043850561] [2019-12-27 20:54:43,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:54:43,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:54:43,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 20:54:43,134 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043850561] [2019-12-27 20:54:43,134 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:54:43,135 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:54:43,135 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2068303155] [2019-12-27 20:54:43,136 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:54:43,140 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:54:43,144 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 20:54:43,145 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:54:43,145 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:54:43,146 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:54:43,147 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:54:43,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:54:43,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:54:43,147 INFO L87 Difference]: Start difference. First operand 1881 states and 4350 transitions. Second operand 5 states. [2019-12-27 20:54:43,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:54:43,393 INFO L93 Difference]: Finished difference Result 2408 states and 5400 transitions. [2019-12-27 20:54:43,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 20:54:43,394 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 20:54:43,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:54:43,404 INFO L225 Difference]: With dead ends: 2408 [2019-12-27 20:54:43,404 INFO L226 Difference]: Without dead ends: 2408 [2019-12-27 20:54:43,405 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 20:54:43,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2408 states. [2019-12-27 20:54:43,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2408 to 2152. [2019-12-27 20:54:43,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2152 states. [2019-12-27 20:54:43,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2152 states to 2152 states and 4906 transitions. [2019-12-27 20:54:43,459 INFO L78 Accepts]: Start accepts. Automaton has 2152 states and 4906 transitions. Word has length 25 [2019-12-27 20:54:43,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:54:43,460 INFO L462 AbstractCegarLoop]: Abstraction has 2152 states and 4906 transitions. [2019-12-27 20:54:43,460 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:54:43,460 INFO L276 IsEmpty]: Start isEmpty. Operand 2152 states and 4906 transitions. [2019-12-27 20:54:43,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 20:54:43,463 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:54:43,463 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] [2019-12-27 20:54:43,463 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:54:43,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:54:43,464 INFO L82 PathProgramCache]: Analyzing trace with hash -797480945, now seen corresponding path program 1 times [2019-12-27 20:54:43,464 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:54:43,465 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578336276] [2019-12-27 20:54:43,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:54:43,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:54:43,519 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 20:54:43,520 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578336276] [2019-12-27 20:54:43,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:54:43,520 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 20:54:43,520 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2140901150] [2019-12-27 20:54:43,520 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:54:43,525 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:54:43,533 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 49 states and 70 transitions. [2019-12-27 20:54:43,534 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:54:43,535 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:54:43,535 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:54:43,536 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:54:43,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:54:43,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:54:43,536 INFO L87 Difference]: Start difference. First operand 2152 states and 4906 transitions. Second operand 3 states. [2019-12-27 20:54:43,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:54:43,615 INFO L93 Difference]: Finished difference Result 2151 states and 4904 transitions. [2019-12-27 20:54:43,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:54:43,616 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-12-27 20:54:43,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:54:43,628 INFO L225 Difference]: With dead ends: 2151 [2019-12-27 20:54:43,628 INFO L226 Difference]: Without dead ends: 2151 [2019-12-27 20:54:43,628 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 20:54:43,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2151 states. [2019-12-27 20:54:43,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2151 to 2151. [2019-12-27 20:54:43,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2151 states. [2019-12-27 20:54:43,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2151 states to 2151 states and 4904 transitions. [2019-12-27 20:54:43,676 INFO L78 Accepts]: Start accepts. Automaton has 2151 states and 4904 transitions. Word has length 26 [2019-12-27 20:54:43,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:54:43,676 INFO L462 AbstractCegarLoop]: Abstraction has 2151 states and 4904 transitions. [2019-12-27 20:54:43,676 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:54:43,677 INFO L276 IsEmpty]: Start isEmpty. Operand 2151 states and 4904 transitions. [2019-12-27 20:54:43,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 20:54:43,679 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:54:43,680 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] [2019-12-27 20:54:43,680 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:54:43,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:54:43,680 INFO L82 PathProgramCache]: Analyzing trace with hash -1810395798, now seen corresponding path program 1 times [2019-12-27 20:54:43,681 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:54:43,681 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582280104] [2019-12-27 20:54:43,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:54:43,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:54:43,777 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 20:54:43,777 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582280104] [2019-12-27 20:54:43,778 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:54:43,778 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:54:43,778 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [172294466] [2019-12-27 20:54:43,778 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:54:43,783 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:54:43,790 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 27 states and 26 transitions. [2019-12-27 20:54:43,790 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:54:43,790 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:54:43,790 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:54:43,791 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:54:43,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:54:43,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:54:43,791 INFO L87 Difference]: Start difference. First operand 2151 states and 4904 transitions. Second operand 5 states. [2019-12-27 20:54:44,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:54:44,042 INFO L93 Difference]: Finished difference Result 2528 states and 5638 transitions. [2019-12-27 20:54:44,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 20:54:44,043 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-27 20:54:44,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:54:44,049 INFO L225 Difference]: With dead ends: 2528 [2019-12-27 20:54:44,050 INFO L226 Difference]: Without dead ends: 2528 [2019-12-27 20:54:44,050 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 20:54:44,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2528 states. [2019-12-27 20:54:44,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2528 to 2001. [2019-12-27 20:54:44,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2001 states. [2019-12-27 20:54:44,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2001 states to 2001 states and 4588 transitions. [2019-12-27 20:54:44,098 INFO L78 Accepts]: Start accepts. Automaton has 2001 states and 4588 transitions. Word has length 26 [2019-12-27 20:54:44,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:54:44,101 INFO L462 AbstractCegarLoop]: Abstraction has 2001 states and 4588 transitions. [2019-12-27 20:54:44,101 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:54:44,101 INFO L276 IsEmpty]: Start isEmpty. Operand 2001 states and 4588 transitions. [2019-12-27 20:54:44,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 20:54:44,103 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:54:44,104 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:54:44,104 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:54:44,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:54:44,104 INFO L82 PathProgramCache]: Analyzing trace with hash 211358289, now seen corresponding path program 1 times [2019-12-27 20:54:44,105 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:54:44,109 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133604921] [2019-12-27 20:54:44,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:54:44,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:54:44,164 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 20:54:44,165 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133604921] [2019-12-27 20:54:44,165 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:54:44,166 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:54:44,166 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [400577316] [2019-12-27 20:54:44,166 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:54:44,171 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:54:44,177 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 31 states and 33 transitions. [2019-12-27 20:54:44,177 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:54:44,190 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 20:54:44,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:54:44,190 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:54:44,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:54:44,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:54:44,191 INFO L87 Difference]: Start difference. First operand 2001 states and 4588 transitions. Second operand 5 states. [2019-12-27 20:54:44,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:54:44,253 INFO L93 Difference]: Finished difference Result 3199 states and 7453 transitions. [2019-12-27 20:54:44,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:54:44,253 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-27 20:54:44,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:54:44,257 INFO L225 Difference]: With dead ends: 3199 [2019-12-27 20:54:44,257 INFO L226 Difference]: Without dead ends: 1476 [2019-12-27 20:54:44,258 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 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 20:54:44,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1476 states. [2019-12-27 20:54:44,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1476 to 1458. [2019-12-27 20:54:44,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1458 states. [2019-12-27 20:54:44,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1458 states to 1458 states and 3355 transitions. [2019-12-27 20:54:44,292 INFO L78 Accepts]: Start accepts. Automaton has 1458 states and 3355 transitions. Word has length 27 [2019-12-27 20:54:44,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:54:44,292 INFO L462 AbstractCegarLoop]: Abstraction has 1458 states and 3355 transitions. [2019-12-27 20:54:44,292 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:54:44,293 INFO L276 IsEmpty]: Start isEmpty. Operand 1458 states and 3355 transitions. [2019-12-27 20:54:44,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 20:54:44,295 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:54:44,295 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 20:54:44,296 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:54:44,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:54:44,296 INFO L82 PathProgramCache]: Analyzing trace with hash 204269275, now seen corresponding path program 2 times [2019-12-27 20:54:44,296 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:54:44,297 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032922873] [2019-12-27 20:54:44,297 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:54:44,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:54:44,375 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 20:54:44,376 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032922873] [2019-12-27 20:54:44,376 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:54:44,376 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 20:54:44,376 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [196620172] [2019-12-27 20:54:44,376 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:54:44,381 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:54:44,387 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 35 states and 41 transitions. [2019-12-27 20:54:44,387 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:54:44,451 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 20:54:44,451 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 20:54:44,451 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:54:44,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 20:54:44,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 20:54:44,452 INFO L87 Difference]: Start difference. First operand 1458 states and 3355 transitions. Second operand 6 states. [2019-12-27 20:54:45,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:54:45,156 INFO L93 Difference]: Finished difference Result 2302 states and 5154 transitions. [2019-12-27 20:54:45,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 20:54:45,156 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 20:54:45,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:54:45,161 INFO L225 Difference]: With dead ends: 2302 [2019-12-27 20:54:45,161 INFO L226 Difference]: Without dead ends: 2302 [2019-12-27 20:54:45,162 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 20:54:45,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2302 states. [2019-12-27 20:54:45,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2302 to 2100. [2019-12-27 20:54:45,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2100 states. [2019-12-27 20:54:45,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2100 states to 2100 states and 4761 transitions. [2019-12-27 20:54:45,206 INFO L78 Accepts]: Start accepts. Automaton has 2100 states and 4761 transitions. Word has length 27 [2019-12-27 20:54:45,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:54:45,209 INFO L462 AbstractCegarLoop]: Abstraction has 2100 states and 4761 transitions. [2019-12-27 20:54:45,209 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 20:54:45,209 INFO L276 IsEmpty]: Start isEmpty. Operand 2100 states and 4761 transitions. [2019-12-27 20:54:45,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 20:54:45,215 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:54:45,215 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:54:45,215 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:54:45,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:54:45,215 INFO L82 PathProgramCache]: Analyzing trace with hash 545456611, now seen corresponding path program 1 times [2019-12-27 20:54:45,216 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:54:45,216 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128327456] [2019-12-27 20:54:45,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:54:45,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:54:45,269 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 20:54:45,269 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128327456] [2019-12-27 20:54:45,269 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:54:45,270 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:54:45,270 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [444785816] [2019-12-27 20:54:45,270 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:54:45,276 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:54:45,283 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 36 states and 42 transitions. [2019-12-27 20:54:45,283 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:54:45,284 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:54:45,284 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:54:45,284 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:54:45,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:54:45,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:54:45,285 INFO L87 Difference]: Start difference. First operand 2100 states and 4761 transitions. Second operand 4 states. [2019-12-27 20:54:45,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:54:45,299 INFO L93 Difference]: Finished difference Result 1134 states and 2437 transitions. [2019-12-27 20:54:45,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 20:54:45,300 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-12-27 20:54:45,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:54:45,302 INFO L225 Difference]: With dead ends: 1134 [2019-12-27 20:54:45,302 INFO L226 Difference]: Without dead ends: 1022 [2019-12-27 20:54:45,303 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 20:54:45,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1022 states. [2019-12-27 20:54:45,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1022 to 980. [2019-12-27 20:54:45,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 980 states. [2019-12-27 20:54:45,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 980 states to 980 states and 2183 transitions. [2019-12-27 20:54:45,322 INFO L78 Accepts]: Start accepts. Automaton has 980 states and 2183 transitions. Word has length 28 [2019-12-27 20:54:45,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:54:45,323 INFO L462 AbstractCegarLoop]: Abstraction has 980 states and 2183 transitions. [2019-12-27 20:54:45,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:54:45,323 INFO L276 IsEmpty]: Start isEmpty. Operand 980 states and 2183 transitions. [2019-12-27 20:54:45,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 20:54:45,326 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:54:45,326 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] [2019-12-27 20:54:45,326 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:54:45,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:54:45,327 INFO L82 PathProgramCache]: Analyzing trace with hash 1584554722, now seen corresponding path program 1 times [2019-12-27 20:54:45,327 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:54:45,327 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708990531] [2019-12-27 20:54:45,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:54:45,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:54:45,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:54:45,461 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708990531] [2019-12-27 20:54:45,462 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:54:45,462 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 20:54:45,462 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [964027435] [2019-12-27 20:54:45,462 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:54:45,481 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:54:45,527 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 95 states and 137 transitions. [2019-12-27 20:54:45,527 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:54:45,529 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 20:54:45,529 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 20:54:45,529 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:54:45,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 20:54:45,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 20:54:45,530 INFO L87 Difference]: Start difference. First operand 980 states and 2183 transitions. Second operand 7 states. [2019-12-27 20:54:45,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:54:45,810 INFO L93 Difference]: Finished difference Result 2849 states and 5974 transitions. [2019-12-27 20:54:45,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 20:54:45,811 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-12-27 20:54:45,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:54:45,816 INFO L225 Difference]: With dead ends: 2849 [2019-12-27 20:54:45,817 INFO L226 Difference]: Without dead ends: 1894 [2019-12-27 20:54:45,817 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-12-27 20:54:45,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1894 states. [2019-12-27 20:54:45,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1894 to 1021. [2019-12-27 20:54:45,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1021 states. [2019-12-27 20:54:45,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1021 states to 1021 states and 2247 transitions. [2019-12-27 20:54:45,845 INFO L78 Accepts]: Start accepts. Automaton has 1021 states and 2247 transitions. Word has length 51 [2019-12-27 20:54:45,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:54:45,845 INFO L462 AbstractCegarLoop]: Abstraction has 1021 states and 2247 transitions. [2019-12-27 20:54:45,846 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 20:54:45,846 INFO L276 IsEmpty]: Start isEmpty. Operand 1021 states and 2247 transitions. [2019-12-27 20:54:45,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 20:54:45,848 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:54:45,848 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] [2019-12-27 20:54:45,848 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:54:45,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:54:45,849 INFO L82 PathProgramCache]: Analyzing trace with hash 898082634, now seen corresponding path program 2 times [2019-12-27 20:54:45,849 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:54:45,850 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714094659] [2019-12-27 20:54:45,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:54:45,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:54:45,952 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 20:54:45,953 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714094659] [2019-12-27 20:54:45,953 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:54:45,953 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:54:45,953 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [163642058] [2019-12-27 20:54:45,954 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:54:45,970 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:54:46,016 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 88 states and 123 transitions. [2019-12-27 20:54:46,016 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:54:46,023 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 20:54:46,024 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:54:46,024 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:54:46,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:54:46,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:54:46,024 INFO L87 Difference]: Start difference. First operand 1021 states and 2247 transitions. Second operand 3 states. [2019-12-27 20:54:46,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:54:46,077 INFO L93 Difference]: Finished difference Result 1257 states and 2726 transitions. [2019-12-27 20:54:46,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:54:46,077 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-27 20:54:46,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:54:46,080 INFO L225 Difference]: With dead ends: 1257 [2019-12-27 20:54:46,081 INFO L226 Difference]: Without dead ends: 1257 [2019-12-27 20:54:46,081 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 4 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 20:54:46,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1257 states. [2019-12-27 20:54:46,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1257 to 1055. [2019-12-27 20:54:46,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1055 states. [2019-12-27 20:54:46,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1055 states to 1055 states and 2325 transitions. [2019-12-27 20:54:46,105 INFO L78 Accepts]: Start accepts. Automaton has 1055 states and 2325 transitions. Word has length 51 [2019-12-27 20:54:46,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:54:46,105 INFO L462 AbstractCegarLoop]: Abstraction has 1055 states and 2325 transitions. [2019-12-27 20:54:46,105 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:54:46,106 INFO L276 IsEmpty]: Start isEmpty. Operand 1055 states and 2325 transitions. [2019-12-27 20:54:46,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 20:54:46,108 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:54:46,108 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] [2019-12-27 20:54:46,109 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:54:46,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:54:46,109 INFO L82 PathProgramCache]: Analyzing trace with hash -1959690206, now seen corresponding path program 1 times [2019-12-27 20:54:46,110 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:54:46,110 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565608509] [2019-12-27 20:54:46,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:54:46,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:54:46,161 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 20:54:46,162 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565608509] [2019-12-27 20:54:46,162 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:54:46,162 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 20:54:46,162 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1513238526] [2019-12-27 20:54:46,162 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:54:46,181 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:54:46,241 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 86 states and 114 transitions. [2019-12-27 20:54:46,241 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:54:46,299 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 20:54:46,299 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 20:54:46,299 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:54:46,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 20:54:46,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 20:54:46,300 INFO L87 Difference]: Start difference. First operand 1055 states and 2325 transitions. Second operand 6 states. [2019-12-27 20:54:46,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:54:46,729 INFO L93 Difference]: Finished difference Result 2032 states and 4425 transitions. [2019-12-27 20:54:46,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 20:54:46,730 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-12-27 20:54:46,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:54:46,735 INFO L225 Difference]: With dead ends: 2032 [2019-12-27 20:54:46,735 INFO L226 Difference]: Without dead ends: 2032 [2019-12-27 20:54:46,736 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-12-27 20:54:46,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2032 states. [2019-12-27 20:54:46,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2032 to 1125. [2019-12-27 20:54:46,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1125 states. [2019-12-27 20:54:46,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1125 states to 1125 states and 2499 transitions. [2019-12-27 20:54:46,770 INFO L78 Accepts]: Start accepts. Automaton has 1125 states and 2499 transitions. Word has length 52 [2019-12-27 20:54:46,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:54:46,771 INFO L462 AbstractCegarLoop]: Abstraction has 1125 states and 2499 transitions. [2019-12-27 20:54:46,771 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 20:54:46,771 INFO L276 IsEmpty]: Start isEmpty. Operand 1125 states and 2499 transitions. [2019-12-27 20:54:46,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 20:54:46,774 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:54:46,774 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] [2019-12-27 20:54:46,774 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:54:46,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:54:46,775 INFO L82 PathProgramCache]: Analyzing trace with hash 2062627214, now seen corresponding path program 2 times [2019-12-27 20:54:46,776 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:54:46,776 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052625331] [2019-12-27 20:54:46,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:54:46,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:54:46,821 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 20:54:46,821 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052625331] [2019-12-27 20:54:46,821 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:54:46,822 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:54:46,822 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [610417693] [2019-12-27 20:54:46,822 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:54:46,888 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:54:46,942 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 86 states and 112 transitions. [2019-12-27 20:54:46,942 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:54:46,943 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:54:46,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:54:46,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:54:46,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:54:46,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:54:46,944 INFO L87 Difference]: Start difference. First operand 1125 states and 2499 transitions. Second operand 3 states. [2019-12-27 20:54:47,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:54:47,055 INFO L93 Difference]: Finished difference Result 1590 states and 3555 transitions. [2019-12-27 20:54:47,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:54:47,055 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 20:54:47,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:54:47,060 INFO L225 Difference]: With dead ends: 1590 [2019-12-27 20:54:47,060 INFO L226 Difference]: Without dead ends: 1590 [2019-12-27 20:54:47,060 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 20:54:47,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1590 states. [2019-12-27 20:54:47,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1590 to 1101. [2019-12-27 20:54:47,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1101 states. [2019-12-27 20:54:47,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1101 states to 1101 states and 2444 transitions. [2019-12-27 20:54:47,081 INFO L78 Accepts]: Start accepts. Automaton has 1101 states and 2444 transitions. Word has length 52 [2019-12-27 20:54:47,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:54:47,081 INFO L462 AbstractCegarLoop]: Abstraction has 1101 states and 2444 transitions. [2019-12-27 20:54:47,081 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:54:47,081 INFO L276 IsEmpty]: Start isEmpty. Operand 1101 states and 2444 transitions. [2019-12-27 20:54:47,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 20:54:47,084 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:54:47,084 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:54:47,084 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:54:47,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:54:47,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1122069892, now seen corresponding path program 3 times [2019-12-27 20:54:47,085 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:54:47,085 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680195928] [2019-12-27 20:54:47,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:54:47,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:54:47,203 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 20:54:47,203 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680195928] [2019-12-27 20:54:47,204 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:54:47,204 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 20:54:47,204 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1260172439] [2019-12-27 20:54:47,204 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:54:47,230 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:54:47,301 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 109 states and 164 transitions. [2019-12-27 20:54:47,301 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:54:47,419 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 13 times. [2019-12-27 20:54:47,419 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 20:54:47,419 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:54:47,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 20:54:47,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 20:54:47,420 INFO L87 Difference]: Start difference. First operand 1101 states and 2444 transitions. Second operand 9 states. [2019-12-27 20:54:49,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:54:49,922 INFO L93 Difference]: Finished difference Result 6505 states and 13537 transitions. [2019-12-27 20:54:49,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-12-27 20:54:49,922 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 52 [2019-12-27 20:54:49,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:54:49,930 INFO L225 Difference]: With dead ends: 6505 [2019-12-27 20:54:49,931 INFO L226 Difference]: Without dead ends: 3720 [2019-12-27 20:54:49,932 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 11 SyntacticMatches, 4 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 463 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=348, Invalid=1292, Unknown=0, NotChecked=0, Total=1640 [2019-12-27 20:54:49,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3720 states. [2019-12-27 20:54:49,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3720 to 1349. [2019-12-27 20:54:49,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1349 states. [2019-12-27 20:54:49,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1349 states to 1349 states and 2985 transitions. [2019-12-27 20:54:49,979 INFO L78 Accepts]: Start accepts. Automaton has 1349 states and 2985 transitions. Word has length 52 [2019-12-27 20:54:49,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:54:49,979 INFO L462 AbstractCegarLoop]: Abstraction has 1349 states and 2985 transitions. [2019-12-27 20:54:49,979 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 20:54:49,979 INFO L276 IsEmpty]: Start isEmpty. Operand 1349 states and 2985 transitions. [2019-12-27 20:54:49,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 20:54:49,983 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:54:49,983 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] [2019-12-27 20:54:49,984 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:54:49,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:54:49,984 INFO L82 PathProgramCache]: Analyzing trace with hash 1309400956, now seen corresponding path program 4 times [2019-12-27 20:54:49,985 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:54:49,985 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354204930] [2019-12-27 20:54:49,985 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:54:50,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:54:50,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:54:50,127 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354204930] [2019-12-27 20:54:50,128 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:54:50,128 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 20:54:50,128 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1479034846] [2019-12-27 20:54:50,128 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:54:50,153 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:54:50,283 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 89 states and 124 transitions. [2019-12-27 20:54:50,283 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:54:50,290 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 20:54:50,290 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 20:54:50,290 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:54:50,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 20:54:50,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 20:54:50,291 INFO L87 Difference]: Start difference. First operand 1349 states and 2985 transitions. Second operand 6 states. [2019-12-27 20:54:50,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:54:50,534 INFO L93 Difference]: Finished difference Result 1933 states and 4228 transitions. [2019-12-27 20:54:50,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 20:54:50,534 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-12-27 20:54:50,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:54:50,538 INFO L225 Difference]: With dead ends: 1933 [2019-12-27 20:54:50,538 INFO L226 Difference]: Without dead ends: 1933 [2019-12-27 20:54:50,538 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 5 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-27 20:54:50,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1933 states. [2019-12-27 20:54:50,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1933 to 1323. [2019-12-27 20:54:50,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1323 states. [2019-12-27 20:54:50,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1323 states to 1323 states and 2913 transitions. [2019-12-27 20:54:50,566 INFO L78 Accepts]: Start accepts. Automaton has 1323 states and 2913 transitions. Word has length 52 [2019-12-27 20:54:50,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:54:50,567 INFO L462 AbstractCegarLoop]: Abstraction has 1323 states and 2913 transitions. [2019-12-27 20:54:50,567 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 20:54:50,567 INFO L276 IsEmpty]: Start isEmpty. Operand 1323 states and 2913 transitions. [2019-12-27 20:54:50,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 20:54:50,570 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:54:50,570 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] [2019-12-27 20:54:50,571 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:54:50,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:54:50,571 INFO L82 PathProgramCache]: Analyzing trace with hash 1371884580, now seen corresponding path program 1 times [2019-12-27 20:54:50,572 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:54:50,572 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587393534] [2019-12-27 20:54:50,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:54:50,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:54:50,603 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 20:54:50,603 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587393534] [2019-12-27 20:54:50,603 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:54:50,603 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:54:50,604 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1537128653] [2019-12-27 20:54:50,604 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:54:50,619 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:54:50,671 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 89 states and 124 transitions. [2019-12-27 20:54:50,671 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:54:50,672 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:54:50,672 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:54:50,672 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:54:50,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:54:50,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:54:50,673 INFO L87 Difference]: Start difference. First operand 1323 states and 2913 transitions. Second operand 3 states. [2019-12-27 20:54:50,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:54:50,716 INFO L93 Difference]: Finished difference Result 1531 states and 3122 transitions. [2019-12-27 20:54:50,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:54:50,716 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 20:54:50,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:54:50,718 INFO L225 Difference]: With dead ends: 1531 [2019-12-27 20:54:50,718 INFO L226 Difference]: Without dead ends: 1531 [2019-12-27 20:54:50,719 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 20:54:50,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1531 states. [2019-12-27 20:54:50,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1531 to 1156. [2019-12-27 20:54:50,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1156 states. [2019-12-27 20:54:50,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1156 states to 1156 states and 2415 transitions. [2019-12-27 20:54:50,739 INFO L78 Accepts]: Start accepts. Automaton has 1156 states and 2415 transitions. Word has length 52 [2019-12-27 20:54:50,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:54:50,740 INFO L462 AbstractCegarLoop]: Abstraction has 1156 states and 2415 transitions. [2019-12-27 20:54:50,740 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:54:50,740 INFO L276 IsEmpty]: Start isEmpty. Operand 1156 states and 2415 transitions. [2019-12-27 20:54:50,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 20:54:50,742 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:54:50,742 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] [2019-12-27 20:54:50,742 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:54:50,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:54:50,743 INFO L82 PathProgramCache]: Analyzing trace with hash -1747792130, now seen corresponding path program 1 times [2019-12-27 20:54:50,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:54:50,744 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035464113] [2019-12-27 20:54:50,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:54:50,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:54:50,799 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 20:54:50,799 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035464113] [2019-12-27 20:54:50,800 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:54:50,800 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:54:50,800 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1378815139] [2019-12-27 20:54:50,800 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:54:50,814 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:54:50,861 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 88 states and 121 transitions. [2019-12-27 20:54:50,861 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:54:50,862 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:54:50,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:54:50,862 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:54:50,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:54:50,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:54:50,863 INFO L87 Difference]: Start difference. First operand 1156 states and 2415 transitions. Second operand 3 states. [2019-12-27 20:54:50,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:54:50,876 INFO L93 Difference]: Finished difference Result 1155 states and 2413 transitions. [2019-12-27 20:54:50,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:54:50,877 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 20:54:50,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:54:50,878 INFO L225 Difference]: With dead ends: 1155 [2019-12-27 20:54:50,878 INFO L226 Difference]: Without dead ends: 1155 [2019-12-27 20:54:50,879 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 20:54:50,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1155 states. [2019-12-27 20:54:50,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1155 to 1045. [2019-12-27 20:54:50,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1045 states. [2019-12-27 20:54:50,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1045 states to 1045 states and 2213 transitions. [2019-12-27 20:54:50,896 INFO L78 Accepts]: Start accepts. Automaton has 1045 states and 2213 transitions. Word has length 52 [2019-12-27 20:54:50,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:54:50,896 INFO L462 AbstractCegarLoop]: Abstraction has 1045 states and 2213 transitions. [2019-12-27 20:54:50,896 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:54:50,896 INFO L276 IsEmpty]: Start isEmpty. Operand 1045 states and 2213 transitions. [2019-12-27 20:54:50,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 20:54:50,898 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:54:50,899 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] [2019-12-27 20:54:50,899 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:54:50,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:54:50,899 INFO L82 PathProgramCache]: Analyzing trace with hash 161095200, now seen corresponding path program 1 times [2019-12-27 20:54:50,900 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:54:50,900 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355550366] [2019-12-27 20:54:50,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:54:50,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 20:54:50,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 20:54:51,002 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 20:54:51,002 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 20:54:51,006 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] ULTIMATE.startENTRY-->L814: Formula: (let ((.cse0 (store |v_#valid_55| 0 0))) (and (= v_~main$tmp_guard1~0_17 0) (= (store |v_#length_20| |v_ULTIMATE.start_main_~#t833~0.base_25| 4) |v_#length_19|) (= 0 v_~weak$$choice0~0_9) (= |v_ULTIMATE.start_main_~#t833~0.offset_19| 0) (= 0 v_~__unbuffered_p1_EAX~0_15) (= 0 v_~__unbuffered_p0_EAX~0_15) (= 0 v_~a$read_delayed_var~0.base_8) (= 0 v_~a$r_buff1_thd2~0_49) (= 0 v_~a$read_delayed~0_7) (= 0 v_~a$w_buff0_used~0_103) (< 0 |v_#StackHeapBarrier_16|) (= v_~__unbuffered_p0_EBX~0_13 0) (= 0 v_~x~0_9) (= 0 v_~weak$$choice2~0_34) (= |v_#NULL.offset_2| 0) (= v_~a$flush_delayed~0_13 0) (= 0 v_~a$r_buff1_thd1~0_18) (= 0 v_~a$w_buff0~0_29) (= 0 v_~a$w_buff1~0_28) (= v_~a$r_buff0_thd1~0_24 0) (= v_~a~0_24 0) (= v_~a$mem_tmp~0_10 0) (= v_~__unbuffered_p1_EBX~0_16 0) (= |v_#valid_54| (store .cse0 |v_ULTIMATE.start_main_~#t833~0.base_25| 1)) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t833~0.base_25|) (= 0 v_~z~0_9) (= v_~a$r_buff0_thd2~0_76 0) (= v_~y~0_10 0) (= v_~main$tmp_guard0~0_11 0) (= v_~a$read_delayed_var~0.offset_8 0) (= 0 v_~__unbuffered_cnt~0_18) (= 0 v_~a$w_buff1_used~0_68) (= v_~a$r_buff0_thd0~0_19 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t833~0.base_25| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t833~0.base_25|) |v_ULTIMATE.start_main_~#t833~0.offset_19| 0)) |v_#memory_int_17|) (= (select .cse0 |v_ULTIMATE.start_main_~#t833~0.base_25|) 0) (= 0 |v_#NULL.base_2|) (= 0 v_~a$r_buff1_thd0~0_20))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_55|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{~a$read_delayed~0=v_~a$read_delayed~0_7, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_49, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_76, #NULL.offset=|v_#NULL.offset_2|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_19, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_11|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_11|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_21|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_11|, ULTIMATE.start_main_~#t834~0.base=|v_ULTIMATE.start_main_~#t834~0.base_21|, ~a$mem_tmp~0=v_~a$mem_tmp~0_10, ~a~0=v_~a~0_24, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_15, ~a$w_buff1~0=v_~a$w_buff1~0_28, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_15, #length=|v_#length_19|, ~y~0=v_~y~0_10, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_16, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_13, ULTIMATE.start_main_~#t833~0.offset=|v_ULTIMATE.start_main_~#t833~0.offset_19|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_18, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_103, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_24, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_11, #NULL.base=|v_#NULL.base_2|, ~weak$$choice0~0=v_~weak$$choice0~0_9, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_8, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_13|, ULTIMATE.start_main_~#t834~0.offset=|v_ULTIMATE.start_main_~#t834~0.offset_16|, ~a$w_buff0~0=v_~a$w_buff0~0_29, ~a$flush_delayed~0=v_~a$flush_delayed~0_13, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_10|, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_20, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_9|, ~z~0=v_~z~0_9, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_68, ~weak$$choice2~0=v_~weak$$choice2~0_34, ~x~0=v_~x~0_9, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_8, ULTIMATE.start_main_~#t833~0.base=|v_ULTIMATE.start_main_~#t833~0.base_25|} AuxVars[] AssignedVars[~a$read_delayed~0, ~a$r_buff1_thd2~0, ~a$r_buff0_thd2~0, #NULL.offset, ~main$tmp_guard1~0, ~a$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t834~0.base, ~a$mem_tmp~0, ~a~0, ~__unbuffered_p0_EAX~0, ~a$w_buff1~0, ~__unbuffered_p1_EAX~0, #length, ~y~0, ~__unbuffered_p1_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_~#t833~0.offset, ~a$r_buff1_thd1~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~main$tmp_guard0~0, #NULL.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ~a$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_~#t834~0.offset, ~a$w_buff0~0, ~a$flush_delayed~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ~a$r_buff1_thd0~0, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~z~0, ~a$w_buff1_used~0, ~weak$$choice2~0, ~x~0, ~a$read_delayed_var~0.base, ULTIMATE.start_main_~#t833~0.base] because there is no mapped edge [2019-12-27 20:54:51,007 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] P0ENTRY-->L4-3: Formula: (and (= |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-782385187| P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out-782385187) (= ~a$w_buff1_used~0_Out-782385187 ~a$w_buff0_used~0_In-782385187) (= 1 ~a$w_buff0~0_Out-782385187) (= 0 (mod ~a$w_buff1_used~0_Out-782385187 256)) (= |P0Thread1of1ForFork0_#in~arg.offset_In-782385187| P0Thread1of1ForFork0_~arg.offset_Out-782385187) (= |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-782385187| 1) (= P0Thread1of1ForFork0_~arg.base_Out-782385187 |P0Thread1of1ForFork0_#in~arg.base_In-782385187|) (= ~a$w_buff1~0_Out-782385187 ~a$w_buff0~0_In-782385187) (= 1 ~a$w_buff0_used~0_Out-782385187)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In-782385187|, ~a$w_buff0~0=~a$w_buff0~0_In-782385187, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In-782385187|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-782385187} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In-782385187|, ~a$w_buff1~0=~a$w_buff1~0_Out-782385187, ~a$w_buff0~0=~a$w_buff0~0_Out-782385187, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out-782385187, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In-782385187|, ~a$w_buff0_used~0=~a$w_buff0_used~0_Out-782385187, ~a$w_buff1_used~0=~a$w_buff1_used~0_Out-782385187, P0Thread1of1ForFork0_~arg.base=P0Thread1of1ForFork0_~arg.base_Out-782385187, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-782385187|, P0Thread1of1ForFork0_~arg.offset=P0Thread1of1ForFork0_~arg.offset_Out-782385187} AuxVars[] AssignedVars[~a$w_buff1~0, ~a$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~a$w_buff0_used~0, ~a$w_buff1_used~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-27 20:54:51,008 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L814-1-->L816: Formula: (and (= 0 (select |v_#valid_20| |v_ULTIMATE.start_main_~#t834~0.base_10|)) (not (= |v_ULTIMATE.start_main_~#t834~0.base_10| 0)) (= |v_#memory_int_7| (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t834~0.base_10| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t834~0.base_10|) |v_ULTIMATE.start_main_~#t834~0.offset_9| 1))) (= |v_ULTIMATE.start_main_~#t834~0.offset_9| 0) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t834~0.base_10| 4) |v_#length_9|) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t834~0.base_10|) (= |v_#valid_19| (store |v_#valid_20| |v_ULTIMATE.start_main_~#t834~0.base_10| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_8|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t834~0.base=|v_ULTIMATE.start_main_~#t834~0.base_10|, #StackHeapBarrier=|v_#StackHeapBarrier_7|, ULTIMATE.start_main_~#t834~0.offset=|v_ULTIMATE.start_main_~#t834~0.offset_9|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t834~0.base, ULTIMATE.start_main_~#t834~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-27 20:54:51,016 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L783-->L783-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1358559056 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite23_In1358559056| |P1Thread1of1ForFork1_#t~ite23_Out1358559056|) (= |P1Thread1of1ForFork1_#t~ite24_Out1358559056| ~a$w_buff1_used~0_In1358559056)) (and (let ((.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In1358559056 256)))) (or (and (= (mod ~a$w_buff1_used~0_In1358559056 256) 0) .cse1) (= 0 (mod ~a$w_buff0_used~0_In1358559056 256)) (and .cse1 (= 0 (mod ~a$r_buff1_thd2~0_In1358559056 256))))) (= ~a$w_buff1_used~0_In1358559056 |P1Thread1of1ForFork1_#t~ite23_Out1358559056|) (= |P1Thread1of1ForFork1_#t~ite24_Out1358559056| |P1Thread1of1ForFork1_#t~ite23_Out1358559056|) .cse0))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1358559056, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1358559056, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In1358559056|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1358559056, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1358559056, ~weak$$choice2~0=~weak$$choice2~0_In1358559056} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1358559056, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out1358559056|, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1358559056, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out1358559056|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1358559056, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1358559056, ~weak$$choice2~0=~weak$$choice2~0_In1358559056} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24] because there is no mapped edge [2019-12-27 20:54:51,017 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L784-->L785: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_26 256))) (= v_~a$r_buff0_thd2~0_68 v_~a$r_buff0_thd2~0_67)) InVars {~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_68, ~weak$$choice2~0=v_~weak$$choice2~0_26} OutVars{~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_67, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_8|, ~weak$$choice2~0=v_~weak$$choice2~0_26, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_9|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_10|} AuxVars[] AssignedVars[~a$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-27 20:54:51,019 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L753-->L753-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd1~0_In-158667828 256))) (.cse0 (= (mod ~a$w_buff0_used~0_In-158667828 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-158667828|)) (and (= ~a$w_buff0_used~0_In-158667828 |P0Thread1of1ForFork0_#t~ite5_Out-158667828|) (or .cse1 .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-158667828, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-158667828} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-158667828|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-158667828, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-158667828} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 20:54:51,020 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [733] [733] L754-->L754-2: Formula: (let ((.cse3 (= 0 (mod ~a$r_buff0_thd1~0_In624801183 256))) (.cse2 (= (mod ~a$w_buff0_used~0_In624801183 256) 0)) (.cse1 (= (mod ~a$w_buff1_used~0_In624801183 256) 0)) (.cse0 (= (mod ~a$r_buff1_thd1~0_In624801183 256) 0))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite6_Out624801183|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= ~a$w_buff1_used~0_In624801183 |P0Thread1of1ForFork0_#t~ite6_Out624801183|)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In624801183, ~a$w_buff0_used~0=~a$w_buff0_used~0_In624801183, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In624801183, ~a$w_buff1_used~0=~a$w_buff1_used~0_In624801183} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out624801183|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In624801183, ~a$w_buff0_used~0=~a$w_buff0_used~0_In624801183, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In624801183, ~a$w_buff1_used~0=~a$w_buff1_used~0_In624801183} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 20:54:51,021 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L755-->L756: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd1~0_In-1091824847 256) 0)) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In-1091824847 256)))) (or (and (not .cse0) (not .cse1) (= 0 ~a$r_buff0_thd1~0_Out-1091824847)) (and (or .cse1 .cse0) (= ~a$r_buff0_thd1~0_In-1091824847 ~a$r_buff0_thd1~0_Out-1091824847)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1091824847, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1091824847} OutVars{P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1091824847|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1091824847, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out-1091824847} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 20:54:51,021 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L756-->L756-2: Formula: (let ((.cse2 (= 0 (mod ~a$r_buff0_thd1~0_In-1777698150 256))) (.cse3 (= 0 (mod ~a$w_buff0_used~0_In-1777698150 256))) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In-1777698150 256))) (.cse0 (= (mod ~a$r_buff1_thd1~0_In-1777698150 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out-1777698150| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P0Thread1of1ForFork0_#t~ite8_Out-1777698150| ~a$r_buff1_thd1~0_In-1777698150) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1777698150, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1777698150, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1777698150, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1777698150} OutVars{~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1777698150, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1777698150|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1777698150, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1777698150, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1777698150} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 20:54:51,021 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L756-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#t~ite8_8| v_~a$r_buff1_thd1~0_13) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_13, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, ~a$r_buff1_thd1~0, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 20:54:51,022 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L787-->L791: Formula: (and (not (= 0 (mod v_~a$flush_delayed~0_8 256))) (= v_~a~0_18 v_~a$mem_tmp~0_5) (= v_~a$flush_delayed~0_7 0)) 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_18, ~a$mem_tmp~0=v_~a$mem_tmp~0_5, ~a$flush_delayed~0=v_~a$flush_delayed~0_7, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|} AuxVars[] AssignedVars[~a~0, ~a$flush_delayed~0, P1Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-27 20:54:51,023 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [725] [725] L791-2-->L791-5: Formula: (let ((.cse0 (= |P1Thread1of1ForFork1_#t~ite32_Out1567603432| |P1Thread1of1ForFork1_#t~ite33_Out1567603432|)) (.cse1 (= 0 (mod ~a$r_buff1_thd2~0_In1567603432 256))) (.cse2 (= 0 (mod ~a$w_buff1_used~0_In1567603432 256)))) (or (and .cse0 (= ~a$w_buff1~0_In1567603432 |P1Thread1of1ForFork1_#t~ite32_Out1567603432|) (not .cse1) (not .cse2)) (and .cse0 (or .cse1 .cse2) (= ~a~0_In1567603432 |P1Thread1of1ForFork1_#t~ite32_Out1567603432|)))) InVars {~a~0=~a~0_In1567603432, ~a$w_buff1~0=~a$w_buff1~0_In1567603432, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1567603432, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1567603432} OutVars{~a~0=~a~0_In1567603432, ~a$w_buff1~0=~a$w_buff1~0_In1567603432, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1567603432, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out1567603432|, P1Thread1of1ForFork1_#t~ite33=|P1Thread1of1ForFork1_#t~ite33_Out1567603432|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1567603432} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-12-27 20:54:51,023 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L792-->L792-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd2~0_In-1769881937 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-1769881937 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite34_Out-1769881937|)) (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In-1769881937 |P1Thread1of1ForFork1_#t~ite34_Out-1769881937|)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1769881937, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1769881937} OutVars{P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-1769881937|, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1769881937, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1769881937} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 20:54:51,024 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L793-->L793-2: Formula: (let ((.cse3 (= 0 (mod ~a$r_buff0_thd2~0_In2020149661 256))) (.cse2 (= (mod ~a$w_buff0_used~0_In2020149661 256) 0)) (.cse0 (= (mod ~a$w_buff1_used~0_In2020149661 256) 0)) (.cse1 (= (mod ~a$r_buff1_thd2~0_In2020149661 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~a$w_buff1_used~0_In2020149661 |P1Thread1of1ForFork1_#t~ite35_Out2020149661|)) (and (= 0 |P1Thread1of1ForFork1_#t~ite35_Out2020149661|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In2020149661, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In2020149661, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2020149661, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2020149661} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In2020149661, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In2020149661, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2020149661, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out2020149661|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2020149661} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 20:54:51,025 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L794-->L794-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In-957071120 256))) (.cse0 (= (mod ~a$r_buff0_thd2~0_In-957071120 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite36_Out-957071120| ~a$r_buff0_thd2~0_In-957071120) (or .cse0 .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite36_Out-957071120| 0) (not .cse1) (not .cse0)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-957071120, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-957071120} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-957071120, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-957071120, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-957071120|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 20:54:51,026 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L795-->L795-2: Formula: (let ((.cse2 (= (mod ~a$w_buff0_used~0_In2102164253 256) 0)) (.cse3 (= 0 (mod ~a$r_buff0_thd2~0_In2102164253 256))) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In2102164253 256))) (.cse1 (= (mod ~a$r_buff1_thd2~0_In2102164253 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite37_Out2102164253| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P1Thread1of1ForFork1_#t~ite37_Out2102164253| ~a$r_buff1_thd2~0_In2102164253) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In2102164253, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In2102164253, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2102164253, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2102164253} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In2102164253, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In2102164253, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2102164253, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2102164253, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out2102164253|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 20:54:51,026 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L795-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= v_~a$r_buff1_thd2~0_42 |v_P1Thread1of1ForFork1_#t~ite37_8|) (= v_~__unbuffered_cnt~0_9 (+ v_~__unbuffered_cnt~0_10 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_8|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_42, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~a$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 20:54:51,027 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L816-1-->L822: Formula: (and (= v_~main$tmp_guard0~0_5 1) (= v_~__unbuffered_cnt~0_7 2)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_7} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_7, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_3|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-27 20:54:51,027 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L822-2-->L822-4: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff1_used~0_In326828837 256))) (.cse0 (= (mod ~a$r_buff1_thd0~0_In326828837 256) 0))) (or (and (or .cse0 .cse1) (= ~a~0_In326828837 |ULTIMATE.start_main_#t~ite40_Out326828837|)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite40_Out326828837| ~a$w_buff1~0_In326828837) (not .cse0)))) InVars {~a~0=~a~0_In326828837, ~a$w_buff1~0=~a$w_buff1~0_In326828837, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In326828837, ~a$w_buff1_used~0=~a$w_buff1_used~0_In326828837} OutVars{~a~0=~a~0_In326828837, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out326828837|, ~a$w_buff1~0=~a$w_buff1~0_In326828837, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In326828837, ~a$w_buff1_used~0=~a$w_buff1_used~0_In326828837} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 20:54:51,028 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L822-4-->L823: Formula: (= v_~a~0_16 |v_ULTIMATE.start_main_#t~ite40_7|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_7|} OutVars{~a~0=v_~a~0_16, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_6|} AuxVars[] AssignedVars[~a~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 20:54:51,028 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L823-->L823-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd0~0_In-801772772 256))) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-801772772 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite42_Out-801772772|)) (and (= ~a$w_buff0_used~0_In-801772772 |ULTIMATE.start_main_#t~ite42_Out-801772772|) (or .cse0 .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-801772772, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-801772772} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-801772772, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-801772772, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-801772772|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 20:54:51,029 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L824-->L824-2: Formula: (let ((.cse3 (= 0 (mod ~a$r_buff1_thd0~0_In336082166 256))) (.cse2 (= 0 (mod ~a$w_buff1_used~0_In336082166 256))) (.cse0 (= (mod ~a$w_buff0_used~0_In336082166 256) 0)) (.cse1 (= 0 (mod ~a$r_buff0_thd0~0_In336082166 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite43_Out336082166| ~a$w_buff1_used~0_In336082166) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite43_Out336082166| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In336082166, ~a$w_buff0_used~0=~a$w_buff0_used~0_In336082166, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In336082166, ~a$w_buff1_used~0=~a$w_buff1_used~0_In336082166} OutVars{~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In336082166, ~a$w_buff0_used~0=~a$w_buff0_used~0_In336082166, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In336082166, ~a$w_buff1_used~0=~a$w_buff1_used~0_In336082166, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out336082166|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 20:54:51,030 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L825-->L825-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In2009434278 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd0~0_In2009434278 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite44_Out2009434278| 0)) (and (or .cse0 .cse1) (= ~a$r_buff0_thd0~0_In2009434278 |ULTIMATE.start_main_#t~ite44_Out2009434278|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In2009434278, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In2009434278} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In2009434278, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In2009434278, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out2009434278|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 20:54:51,030 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L826-->L826-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In367924958 256) 0)) (.cse0 (= (mod ~a$r_buff0_thd0~0_In367924958 256) 0)) (.cse2 (= 0 (mod ~a$w_buff1_used~0_In367924958 256))) (.cse3 (= (mod ~a$r_buff1_thd0~0_In367924958 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite45_Out367924958| ~a$r_buff1_thd0~0_In367924958) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite45_Out367924958|)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In367924958, ~a$w_buff0_used~0=~a$w_buff0_used~0_In367924958, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In367924958, ~a$w_buff1_used~0=~a$w_buff1_used~0_In367924958} OutVars{~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In367924958, ~a$w_buff0_used~0=~a$w_buff0_used~0_In367924958, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In367924958, ~a$w_buff1_used~0=~a$w_buff1_used~0_In367924958, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out367924958|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 20:54:51,031 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L826-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= 1 v_~__unbuffered_p1_EAX~0_8) (= v_~main$tmp_guard1~0_10 0) (= |v_ULTIMATE.start_main_#t~ite45_11| v_~a$r_buff1_thd0~0_13) (= v_~__unbuffered_p0_EBX~0_6 0) (= v_~__unbuffered_p0_EAX~0_8 1) (= 0 v_~__unbuffered_p1_EBX~0_9)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_6, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_11|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_6, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_13, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_10|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~a$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 20:54:51,103 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 08:54:51 BasicIcfg [2019-12-27 20:54:51,103 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 20:54:51,108 INFO L168 Benchmark]: Toolchain (without parser) took 17157.83 ms. Allocated memory was 138.4 MB in the beginning and 523.8 MB in the end (delta: 385.4 MB). Free memory was 102.4 MB in the beginning and 98.7 MB in the end (delta: 3.7 MB). Peak memory consumption was 389.0 MB. Max. memory is 7.1 GB. [2019-12-27 20:54:51,108 INFO L168 Benchmark]: CDTParser took 0.63 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-27 20:54:51,109 INFO L168 Benchmark]: CACSL2BoogieTranslator took 781.25 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 101.9 MB in the beginning and 155.4 MB in the end (delta: -53.5 MB). Peak memory consumption was 24.9 MB. Max. memory is 7.1 GB. [2019-12-27 20:54:51,110 INFO L168 Benchmark]: Boogie Procedure Inliner took 84.75 ms. Allocated memory is still 202.9 MB. Free memory was 155.4 MB in the beginning and 152.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 20:54:51,110 INFO L168 Benchmark]: Boogie Preprocessor took 40.19 ms. Allocated memory is still 202.9 MB. Free memory was 152.7 MB in the beginning and 150.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-27 20:54:51,110 INFO L168 Benchmark]: RCFGBuilder took 785.76 ms. Allocated memory is still 202.9 MB. Free memory was 150.6 MB in the beginning and 105.9 MB in the end (delta: 44.7 MB). Peak memory consumption was 44.7 MB. Max. memory is 7.1 GB. [2019-12-27 20:54:51,111 INFO L168 Benchmark]: TraceAbstraction took 15454.30 ms. Allocated memory was 202.9 MB in the beginning and 523.8 MB in the end (delta: 320.9 MB). Free memory was 105.3 MB in the beginning and 98.7 MB in the end (delta: 6.6 MB). Peak memory consumption was 327.4 MB. Max. memory is 7.1 GB. [2019-12-27 20:54:51,118 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.63 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 781.25 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 101.9 MB in the beginning and 155.4 MB in the end (delta: -53.5 MB). Peak memory consumption was 24.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 84.75 ms. Allocated memory is still 202.9 MB. Free memory was 155.4 MB in the beginning and 152.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.19 ms. Allocated memory is still 202.9 MB. Free memory was 152.7 MB in the beginning and 150.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 785.76 ms. Allocated memory is still 202.9 MB. Free memory was 150.6 MB in the beginning and 105.9 MB in the end (delta: 44.7 MB). Peak memory consumption was 44.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 15454.30 ms. Allocated memory was 202.9 MB in the beginning and 523.8 MB in the end (delta: 320.9 MB). Free memory was 105.3 MB in the beginning and 98.7 MB in the end (delta: 6.6 MB). Peak memory consumption was 327.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.2s, 151 ProgramPointsBefore, 78 ProgramPointsAfterwards, 185 TransitionsBefore, 90 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 8 FixpointIterations, 33 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 25 ChoiceCompositions, 5025 VarBasedMoverChecksPositive, 194 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 56825 CheckedPairsTotal, 105 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L814] FCALL, FORK 0 pthread_create(&t833, ((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, 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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=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] [L816] FCALL, FORK 0 pthread_create(&t834, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L737] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L738] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L739] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L740] 1 a$r_buff0_thd1 = (_Bool)1 [L743] 1 x = 1 [L746] 1 __unbuffered_p0_EAX = x [L749] 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, 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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=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] [L766] 2 y = 1 [L769] 2 z = 1 [L772] 2 __unbuffered_p1_EAX = z [L775] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L776] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L777] 2 a$flush_delayed = weak$$choice2 [L778] 2 a$mem_tmp = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=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=5, weak$$choice2=1, x=1, y=1, z=1] [L779] EXPR 2 !a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff1) VAL [!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=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=5, weak$$choice2=1, x=1, y=1, z=1] [L779] 2 a = !a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff1) [L780] EXPR 2 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=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=5, weak$$choice2=1, weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0))=1, x=1, y=1, z=1] [L780] 2 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0)) [L752] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=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=5, weak$$choice2=1, x=1, y=1, z=1] [L781] EXPR 2 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff1 : a$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=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=5, weak$$choice2=1, weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff1 : a$w_buff1))=0, x=1, y=1, z=1] [L781] 2 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff1 : a$w_buff1)) [L782] EXPR 2 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=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=5, weak$$choice2=1, weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used))=1, x=1, y=1, z=1] [L782] 2 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used)) [L783] 2 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L785] EXPR 2 weak$$choice2 ? a$r_buff1_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff1_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=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=5, weak$$choice2=1, weak$$choice2 ? a$r_buff1_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff1_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L785] 2 a$r_buff1_thd2 = weak$$choice2 ? a$r_buff1_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff1_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L786] 2 __unbuffered_p1_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=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=5, weak$$choice2=1, x=1, y=1, z=1] [L752] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L753] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L754] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L791] 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=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L791] 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) [L792] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L793] 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 [L794] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L822] 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}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=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}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L823] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L824] 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 [L825] 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 3 procedures, 145 locations, 2 error locations. Result: UNSAFE, OverallTime: 15.1s, OverallIterations: 20, TraceHistogramMax: 1, AutomataDifference: 6.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2415 SDtfs, 2507 SDslu, 4475 SDs, 0 SdLazy, 3053 SolverSat, 181 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 169 GetRequests, 50 SyntacticMatches, 19 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8850occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 19 MinimizatonAttempts, 7855 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 682 NumberOfCodeBlocks, 682 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 610 ConstructedInterpolants, 0 QuantifiedInterpolants, 63653 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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...