/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/mix012_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 20:02:51,698 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 20:02:51,700 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 20:02:51,718 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 20:02:51,718 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 20:02:51,719 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 20:02:51,721 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 20:02:51,722 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 20:02:51,724 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 20:02:51,725 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 20:02:51,726 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 20:02:51,727 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 20:02:51,727 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 20:02:51,728 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 20:02:51,729 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 20:02:51,730 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 20:02:51,731 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 20:02:51,732 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 20:02:51,733 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 20:02:51,735 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 20:02:51,737 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 20:02:51,738 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 20:02:51,739 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 20:02:51,740 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 20:02:51,742 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 20:02:51,742 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 20:02:51,742 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 20:02:51,743 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 20:02:51,744 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 20:02:51,745 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 20:02:51,745 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 20:02:51,745 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 20:02:51,746 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 20:02:51,747 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 20:02:51,748 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 20:02:51,748 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 20:02:51,749 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 20:02:51,749 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 20:02:51,749 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 20:02:51,750 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 20:02:51,751 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 20:02:51,751 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:02:51,765 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 20:02:51,766 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 20:02:51,767 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 20:02:51,767 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 20:02:51,767 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 20:02:51,768 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 20:02:51,768 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 20:02:51,768 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 20:02:51,768 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 20:02:51,768 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 20:02:51,769 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 20:02:51,769 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 20:02:51,769 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 20:02:51,769 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 20:02:51,769 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 20:02:51,769 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 20:02:51,770 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 20:02:51,770 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 20:02:51,770 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 20:02:51,770 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 20:02:51,770 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 20:02:51,771 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 20:02:51,771 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 20:02:51,771 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 20:02:51,771 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 20:02:51,771 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 20:02:51,772 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 20:02:51,772 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 20:02:51,772 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 20:02:51,772 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 20:02:51,772 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 20:02:51,773 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 20:02:52,072 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 20:02:52,096 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 20:02:52,099 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 20:02:52,101 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 20:02:52,102 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 20:02:52,103 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix012_pso.oepc.i [2019-12-27 20:02:52,174 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c8276870/3f16e65d98a3404f9144aeb19e2812a3/FLAG7043c919c [2019-12-27 20:02:52,730 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 20:02:52,731 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix012_pso.oepc.i [2019-12-27 20:02:52,754 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c8276870/3f16e65d98a3404f9144aeb19e2812a3/FLAG7043c919c [2019-12-27 20:02:52,995 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c8276870/3f16e65d98a3404f9144aeb19e2812a3 [2019-12-27 20:02:53,006 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 20:02:53,008 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 20:02:53,010 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 20:02:53,010 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 20:02:53,014 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 20:02:53,015 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:02:52" (1/1) ... [2019-12-27 20:02:53,019 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e400b9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:02:53, skipping insertion in model container [2019-12-27 20:02:53,020 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:02:52" (1/1) ... [2019-12-27 20:02:53,028 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 20:02:53,097 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 20:02:53,568 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 20:02:53,584 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 20:02:53,692 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 20:02:53,765 INFO L208 MainTranslator]: Completed translation [2019-12-27 20:02:53,766 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:02:53 WrapperNode [2019-12-27 20:02:53,766 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 20:02:53,767 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 20:02:53,767 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 20:02:53,767 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 20:02:53,776 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:02:53" (1/1) ... [2019-12-27 20:02:53,800 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:02:53" (1/1) ... [2019-12-27 20:02:53,830 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 20:02:53,831 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 20:02:53,831 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 20:02:53,831 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 20:02:53,841 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:02:53" (1/1) ... [2019-12-27 20:02:53,841 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:02:53" (1/1) ... [2019-12-27 20:02:53,846 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:02:53" (1/1) ... [2019-12-27 20:02:53,846 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:02:53" (1/1) ... [2019-12-27 20:02:53,856 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:02:53" (1/1) ... [2019-12-27 20:02:53,860 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:02:53" (1/1) ... [2019-12-27 20:02:53,863 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:02:53" (1/1) ... [2019-12-27 20:02:53,868 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 20:02:53,869 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 20:02:53,869 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 20:02:53,869 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 20:02:53,870 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:02:53" (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:02:53,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 20:02:53,944 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 20:02:53,945 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 20:02:53,945 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 20:02:53,945 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 20:02:53,946 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 20:02:53,947 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 20:02:53,947 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 20:02:53,948 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 20:02:53,948 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 20:02:53,948 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 20:02:53,950 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:02:54,711 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 20:02:54,711 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 20:02:54,713 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:02:54 BoogieIcfgContainer [2019-12-27 20:02:54,713 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 20:02:54,714 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 20:02:54,714 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 20:02:54,717 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 20:02:54,717 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 08:02:52" (1/3) ... [2019-12-27 20:02:54,718 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77bdc93c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:02:54, skipping insertion in model container [2019-12-27 20:02:54,719 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:02:53" (2/3) ... [2019-12-27 20:02:54,719 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77bdc93c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:02:54, skipping insertion in model container [2019-12-27 20:02:54,719 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:02:54" (3/3) ... [2019-12-27 20:02:54,721 INFO L109 eAbstractionObserver]: Analyzing ICFG mix012_pso.oepc.i [2019-12-27 20:02:54,729 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 20:02:54,730 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 20:02:54,737 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 20:02:54,738 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 20:02:54,775 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,775 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,775 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,776 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,776 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,776 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,777 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,777 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,778 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,778 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,778 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,778 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,779 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,779 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,779 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,780 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,780 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,780 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,781 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,781 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,781 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,781 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,782 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,782 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,782 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,783 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,783 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,783 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,783 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,784 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,784 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,784 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,784 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,785 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,786 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,786 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,786 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,786 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,787 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,787 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,787 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,787 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,788 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,788 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,788 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,788 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,789 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,789 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,789 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,790 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,790 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,790 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,790 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,791 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,791 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,791 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,791 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,792 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,792 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,792 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,792 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,793 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,793 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,793 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,793 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,794 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,794 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,794 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,795 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,795 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,795 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,795 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,796 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,796 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,796 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,796 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,797 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,797 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,797 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,797 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,798 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,798 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,798 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,798 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,799 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,799 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,799 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,799 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,800 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,800 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,800 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,800 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,801 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,801 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,801 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,801 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,802 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,802 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,802 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,802 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,802 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,803 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,803 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,803 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,804 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,804 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,804 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,804 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,805 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,805 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,805 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,805 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,806 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,806 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,806 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,806 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,807 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,807 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,807 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,807 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,808 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,808 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,808 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,808 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,809 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,809 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,809 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,809 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,810 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,810 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,810 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,810 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,811 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,811 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,811 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,811 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,812 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,812 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,812 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,812 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,813 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,813 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,813 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,813 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,813 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,814 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,814 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,814 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,814 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,815 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,815 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,815 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,834 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,835 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,835 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,835 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,835 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,835 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,836 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,836 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,836 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,836 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,836 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,836 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,839 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,840 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,840 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,840 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,840 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,840 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,841 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,841 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,841 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,841 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,841 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,842 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,842 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,842 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,842 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,842 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,845 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:54,861 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 20:02:54,877 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 20:02:54,878 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 20:02:54,878 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 20:02:54,878 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 20:02:54,878 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 20:02:54,878 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 20:02:54,878 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 20:02:54,879 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 20:02:54,895 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 182 transitions [2019-12-27 20:02:54,897 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-12-27 20:02:54,985 INFO L132 PetriNetUnfolder]: 41/180 cut-off events. [2019-12-27 20:02:54,986 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 20:02:55,000 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 180 events. 41/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 338 event pairs. 0/137 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 20:02:55,020 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-12-27 20:02:55,066 INFO L132 PetriNetUnfolder]: 41/180 cut-off events. [2019-12-27 20:02:55,067 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 20:02:55,073 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 180 events. 41/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 338 event pairs. 0/137 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 20:02:55,087 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-27 20:02:55,089 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 20:02:58,329 WARN L192 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-27 20:02:58,433 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-27 20:02:58,458 INFO L206 etLargeBlockEncoding]: Checked pairs total: 49139 [2019-12-27 20:02:58,458 INFO L214 etLargeBlockEncoding]: Total number of compositions: 103 [2019-12-27 20:02:58,462 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 74 places, 82 transitions [2019-12-27 20:02:58,880 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8357 states. [2019-12-27 20:02:58,882 INFO L276 IsEmpty]: Start isEmpty. Operand 8357 states. [2019-12-27 20:02:58,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 20:02:58,893 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:02:58,894 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 20:02:58,895 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:02:58,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:02:58,902 INFO L82 PathProgramCache]: Analyzing trace with hash 795178, now seen corresponding path program 1 times [2019-12-27 20:02:58,914 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:02:58,915 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096162318] [2019-12-27 20:02:58,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:02:59,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:02:59,159 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:02:59,159 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096162318] [2019-12-27 20:02:59,160 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:02:59,160 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 20:02:59,161 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [20086491] [2019-12-27 20:02:59,162 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:02:59,167 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:02:59,179 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 20:02:59,179 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:02:59,183 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:02:59,183 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:02:59,184 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:02:59,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:02:59,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:02:59,201 INFO L87 Difference]: Start difference. First operand 8357 states. Second operand 3 states. [2019-12-27 20:02:59,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:02:59,444 INFO L93 Difference]: Finished difference Result 8205 states and 26514 transitions. [2019-12-27 20:02:59,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:02:59,446 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 20:02:59,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:02:59,538 INFO L225 Difference]: With dead ends: 8205 [2019-12-27 20:02:59,538 INFO L226 Difference]: Without dead ends: 7724 [2019-12-27 20:02:59,540 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:02:59,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7724 states. [2019-12-27 20:02:59,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7724 to 7724. [2019-12-27 20:02:59,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7724 states. [2019-12-27 20:03:00,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7724 states to 7724 states and 24917 transitions. [2019-12-27 20:03:00,031 INFO L78 Accepts]: Start accepts. Automaton has 7724 states and 24917 transitions. Word has length 3 [2019-12-27 20:03:00,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:03:00,031 INFO L462 AbstractCegarLoop]: Abstraction has 7724 states and 24917 transitions. [2019-12-27 20:03:00,031 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:03:00,032 INFO L276 IsEmpty]: Start isEmpty. Operand 7724 states and 24917 transitions. [2019-12-27 20:03:00,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 20:03:00,035 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:03:00,035 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:03:00,036 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:03:00,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:03:00,036 INFO L82 PathProgramCache]: Analyzing trace with hash 1406163788, now seen corresponding path program 1 times [2019-12-27 20:03:00,036 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:03:00,037 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517522461] [2019-12-27 20:03:00,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:03:00,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:03:00,097 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:03:00,097 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517522461] [2019-12-27 20:03:00,097 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:03:00,098 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:03:00,098 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [42145506] [2019-12-27 20:03:00,098 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:03:00,099 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:03:00,102 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 20:03:00,102 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:03:00,104 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:03:00,106 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:03:00,106 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:03:00,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:03:00,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:03:00,107 INFO L87 Difference]: Start difference. First operand 7724 states and 24917 transitions. Second operand 3 states. [2019-12-27 20:03:00,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:03:00,146 INFO L93 Difference]: Finished difference Result 1230 states and 2764 transitions. [2019-12-27 20:03:00,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:03:00,146 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-27 20:03:00,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:03:00,153 INFO L225 Difference]: With dead ends: 1230 [2019-12-27 20:03:00,153 INFO L226 Difference]: Without dead ends: 1230 [2019-12-27 20:03:00,154 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:03:00,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1230 states. [2019-12-27 20:03:00,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1230 to 1230. [2019-12-27 20:03:00,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1230 states. [2019-12-27 20:03:00,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1230 states to 1230 states and 2764 transitions. [2019-12-27 20:03:00,208 INFO L78 Accepts]: Start accepts. Automaton has 1230 states and 2764 transitions. Word has length 11 [2019-12-27 20:03:00,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:03:00,208 INFO L462 AbstractCegarLoop]: Abstraction has 1230 states and 2764 transitions. [2019-12-27 20:03:00,208 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:03:00,209 INFO L276 IsEmpty]: Start isEmpty. Operand 1230 states and 2764 transitions. [2019-12-27 20:03:00,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 20:03:00,215 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:03:00,215 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:03:00,216 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:03:00,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:03:00,216 INFO L82 PathProgramCache]: Analyzing trace with hash 540130104, now seen corresponding path program 1 times [2019-12-27 20:03:00,217 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:03:00,217 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105475307] [2019-12-27 20:03:00,217 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:03:00,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:03:00,391 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:03:00,391 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105475307] [2019-12-27 20:03:00,391 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:03:00,392 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:03:00,394 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [831775601] [2019-12-27 20:03:00,394 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:03:00,397 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:03:00,401 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 15 states and 14 transitions. [2019-12-27 20:03:00,401 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:03:00,402 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:03:00,402 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:03:00,402 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:03:00,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:03:00,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:03:00,403 INFO L87 Difference]: Start difference. First operand 1230 states and 2764 transitions. Second operand 5 states. [2019-12-27 20:03:00,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:03:00,703 INFO L93 Difference]: Finished difference Result 1827 states and 4035 transitions. [2019-12-27 20:03:00,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 20:03:00,704 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 20:03:00,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:03:00,714 INFO L225 Difference]: With dead ends: 1827 [2019-12-27 20:03:00,714 INFO L226 Difference]: Without dead ends: 1827 [2019-12-27 20:03:00,714 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 20:03:00,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1827 states. [2019-12-27 20:03:00,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1827 to 1570. [2019-12-27 20:03:00,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2019-12-27 20:03:00,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 3505 transitions. [2019-12-27 20:03:00,764 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 3505 transitions. Word has length 14 [2019-12-27 20:03:00,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:03:00,765 INFO L462 AbstractCegarLoop]: Abstraction has 1570 states and 3505 transitions. [2019-12-27 20:03:00,765 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:03:00,765 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 3505 transitions. [2019-12-27 20:03:00,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 20:03:00,768 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:03:00,768 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:03:00,768 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:03:00,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:03:00,768 INFO L82 PathProgramCache]: Analyzing trace with hash -2113363587, now seen corresponding path program 1 times [2019-12-27 20:03:00,769 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:03:00,772 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137946988] [2019-12-27 20:03:00,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:03:00,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:03:00,954 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:03:00,956 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137946988] [2019-12-27 20:03:00,956 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:03:00,956 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 20:03:00,957 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [65619978] [2019-12-27 20:03:00,959 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:03:00,966 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:03:00,975 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 20:03:00,976 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:03:00,976 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:03:00,976 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 20:03:00,977 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:03:00,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 20:03:00,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 20:03:00,978 INFO L87 Difference]: Start difference. First operand 1570 states and 3505 transitions. Second operand 6 states. [2019-12-27 20:03:01,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:03:01,466 INFO L93 Difference]: Finished difference Result 2335 states and 5008 transitions. [2019-12-27 20:03:01,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 20:03:01,466 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-27 20:03:01,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:03:01,478 INFO L225 Difference]: With dead ends: 2335 [2019-12-27 20:03:01,478 INFO L226 Difference]: Without dead ends: 2335 [2019-12-27 20:03:01,479 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 20:03:01,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2335 states. [2019-12-27 20:03:01,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2335 to 1703. [2019-12-27 20:03:01,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1703 states. [2019-12-27 20:03:01,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1703 states to 1703 states and 3769 transitions. [2019-12-27 20:03:01,522 INFO L78 Accepts]: Start accepts. Automaton has 1703 states and 3769 transitions. Word has length 25 [2019-12-27 20:03:01,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:03:01,522 INFO L462 AbstractCegarLoop]: Abstraction has 1703 states and 3769 transitions. [2019-12-27 20:03:01,523 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 20:03:01,523 INFO L276 IsEmpty]: Start isEmpty. Operand 1703 states and 3769 transitions. [2019-12-27 20:03:01,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 20:03:01,525 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:03:01,525 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:03:01,525 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:03:01,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:03:01,525 INFO L82 PathProgramCache]: Analyzing trace with hash 461887986, now seen corresponding path program 1 times [2019-12-27 20:03:01,526 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:03:01,526 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486275929] [2019-12-27 20:03:01,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:03:01,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:03:01,580 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:03:01,580 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486275929] [2019-12-27 20:03:01,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:03:01,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 20:03:01,581 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [867947202] [2019-12-27 20:03:01,581 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:03:01,585 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:03:01,594 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 49 states and 70 transitions. [2019-12-27 20:03:01,594 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:03:01,595 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:03:01,596 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:03:01,596 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:03:01,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:03:01,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:03:01,597 INFO L87 Difference]: Start difference. First operand 1703 states and 3769 transitions. Second operand 3 states. [2019-12-27 20:03:01,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:03:01,616 INFO L93 Difference]: Finished difference Result 1702 states and 3767 transitions. [2019-12-27 20:03:01,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:03:01,616 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-12-27 20:03:01,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:03:01,625 INFO L225 Difference]: With dead ends: 1702 [2019-12-27 20:03:01,626 INFO L226 Difference]: Without dead ends: 1702 [2019-12-27 20:03:01,626 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:03:01,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1702 states. [2019-12-27 20:03:01,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1702 to 1702. [2019-12-27 20:03:01,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1702 states. [2019-12-27 20:03:01,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1702 states to 1702 states and 3767 transitions. [2019-12-27 20:03:01,669 INFO L78 Accepts]: Start accepts. Automaton has 1702 states and 3767 transitions. Word has length 26 [2019-12-27 20:03:01,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:03:01,669 INFO L462 AbstractCegarLoop]: Abstraction has 1702 states and 3767 transitions. [2019-12-27 20:03:01,670 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:03:01,670 INFO L276 IsEmpty]: Start isEmpty. Operand 1702 states and 3767 transitions. [2019-12-27 20:03:01,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 20:03:01,672 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:03:01,672 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:03:01,673 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:03:01,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:03:01,673 INFO L82 PathProgramCache]: Analyzing trace with hash -691470702, now seen corresponding path program 1 times [2019-12-27 20:03:01,673 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:03:01,674 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960794405] [2019-12-27 20:03:01,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:03:01,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:03:01,730 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:03:01,731 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960794405] [2019-12-27 20:03:01,731 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:03:01,731 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:03:01,731 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1641818364] [2019-12-27 20:03:01,732 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:03:01,739 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:03:01,748 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 31 states and 33 transitions. [2019-12-27 20:03:01,748 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:03:01,754 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 20:03:01,754 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:03:01,754 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:03:01,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:03:01,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:03:01,755 INFO L87 Difference]: Start difference. First operand 1702 states and 3767 transitions. Second operand 4 states. [2019-12-27 20:03:01,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:03:01,796 INFO L93 Difference]: Finished difference Result 2698 states and 6019 transitions. [2019-12-27 20:03:01,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 20:03:01,796 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-12-27 20:03:01,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:03:01,815 INFO L225 Difference]: With dead ends: 2698 [2019-12-27 20:03:01,815 INFO L226 Difference]: Without dead ends: 1248 [2019-12-27 20:03:01,815 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:03:01,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1248 states. [2019-12-27 20:03:01,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1248 to 1231. [2019-12-27 20:03:01,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1231 states. [2019-12-27 20:03:01,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1231 states to 1231 states and 2688 transitions. [2019-12-27 20:03:01,854 INFO L78 Accepts]: Start accepts. Automaton has 1231 states and 2688 transitions. Word has length 27 [2019-12-27 20:03:01,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:03:01,854 INFO L462 AbstractCegarLoop]: Abstraction has 1231 states and 2688 transitions. [2019-12-27 20:03:01,854 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:03:01,854 INFO L276 IsEmpty]: Start isEmpty. Operand 1231 states and 2688 transitions. [2019-12-27 20:03:01,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 20:03:01,857 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:03:01,857 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:03:01,857 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:03:01,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:03:01,857 INFO L82 PathProgramCache]: Analyzing trace with hash -250638352, now seen corresponding path program 2 times [2019-12-27 20:03:01,859 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:03:01,860 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655824581] [2019-12-27 20:03:01,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:03:01,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:03:01,965 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:03:01,966 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655824581] [2019-12-27 20:03:01,966 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:03:01,966 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 20:03:01,966 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2082338850] [2019-12-27 20:03:01,967 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:03:01,972 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:03:01,984 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 59 states and 89 transitions. [2019-12-27 20:03:01,984 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:03:02,089 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 20:03:02,089 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 20:03:02,089 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:03:02,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 20:03:02,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 20:03:02,090 INFO L87 Difference]: Start difference. First operand 1231 states and 2688 transitions. Second operand 8 states. [2019-12-27 20:03:02,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:03:02,889 INFO L93 Difference]: Finished difference Result 1897 states and 4072 transitions. [2019-12-27 20:03:02,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 20:03:02,890 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2019-12-27 20:03:02,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:03:02,897 INFO L225 Difference]: With dead ends: 1897 [2019-12-27 20:03:02,897 INFO L226 Difference]: Without dead ends: 1897 [2019-12-27 20:03:02,899 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-27 20:03:02,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1897 states. [2019-12-27 20:03:02,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1897 to 1702. [2019-12-27 20:03:02,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1702 states. [2019-12-27 20:03:02,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1702 states to 1702 states and 3698 transitions. [2019-12-27 20:03:02,937 INFO L78 Accepts]: Start accepts. Automaton has 1702 states and 3698 transitions. Word has length 27 [2019-12-27 20:03:02,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:03:02,938 INFO L462 AbstractCegarLoop]: Abstraction has 1702 states and 3698 transitions. [2019-12-27 20:03:02,938 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 20:03:02,938 INFO L276 IsEmpty]: Start isEmpty. Operand 1702 states and 3698 transitions. [2019-12-27 20:03:02,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 20:03:02,941 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:03:02,941 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:03:02,941 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:03:02,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:03:02,941 INFO L82 PathProgramCache]: Analyzing trace with hash 1889347286, now seen corresponding path program 1 times [2019-12-27 20:03:02,942 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:03:02,942 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519173124] [2019-12-27 20:03:02,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:03:02,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:03:02,981 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:03:02,981 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519173124] [2019-12-27 20:03:02,981 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:03:02,981 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:03:02,982 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [119285568] [2019-12-27 20:03:02,982 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:03:02,987 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:03:02,999 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 61 states and 92 transitions. [2019-12-27 20:03:02,999 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:03:03,016 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 20:03:03,016 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:03:03,016 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:03:03,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:03:03,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:03:03,017 INFO L87 Difference]: Start difference. First operand 1702 states and 3698 transitions. Second operand 5 states. [2019-12-27 20:03:03,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:03:03,034 INFO L93 Difference]: Finished difference Result 921 states and 1892 transitions. [2019-12-27 20:03:03,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 20:03:03,037 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-27 20:03:03,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:03:03,040 INFO L225 Difference]: With dead ends: 921 [2019-12-27 20:03:03,040 INFO L226 Difference]: Without dead ends: 824 [2019-12-27 20:03:03,041 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:03:03,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 824 states. [2019-12-27 20:03:03,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 824 to 782. [2019-12-27 20:03:03,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2019-12-27 20:03:03,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 1664 transitions. [2019-12-27 20:03:03,058 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 1664 transitions. Word has length 28 [2019-12-27 20:03:03,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:03:03,059 INFO L462 AbstractCegarLoop]: Abstraction has 782 states and 1664 transitions. [2019-12-27 20:03:03,059 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:03:03,059 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 1664 transitions. [2019-12-27 20:03:03,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 20:03:03,061 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:03:03,062 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:03:03,062 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:03:03,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:03:03,062 INFO L82 PathProgramCache]: Analyzing trace with hash -1472734739, now seen corresponding path program 1 times [2019-12-27 20:03:03,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:03:03,063 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479934286] [2019-12-27 20:03:03,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:03:03,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:03:03,153 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:03:03,153 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479934286] [2019-12-27 20:03:03,153 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:03:03,154 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 20:03:03,154 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [891944042] [2019-12-27 20:03:03,154 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:03:03,171 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:03:03,615 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 110 states and 167 transitions. [2019-12-27 20:03:03,616 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:03:03,690 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 20:03:03,691 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 20:03:03,691 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:03:03,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 20:03:03,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 20:03:03,692 INFO L87 Difference]: Start difference. First operand 782 states and 1664 transitions. Second operand 9 states. [2019-12-27 20:03:03,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:03:03,975 INFO L93 Difference]: Finished difference Result 1342 states and 2781 transitions. [2019-12-27 20:03:03,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 20:03:03,976 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 51 [2019-12-27 20:03:03,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:03:03,980 INFO L225 Difference]: With dead ends: 1342 [2019-12-27 20:03:03,981 INFO L226 Difference]: Without dead ends: 903 [2019-12-27 20:03:03,981 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-12-27 20:03:03,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2019-12-27 20:03:03,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 773. [2019-12-27 20:03:03,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2019-12-27 20:03:03,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 1630 transitions. [2019-12-27 20:03:03,998 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 1630 transitions. Word has length 51 [2019-12-27 20:03:03,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:03:03,999 INFO L462 AbstractCegarLoop]: Abstraction has 773 states and 1630 transitions. [2019-12-27 20:03:03,999 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 20:03:03,999 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 1630 transitions. [2019-12-27 20:03:04,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 20:03:04,001 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:03:04,001 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:03:04,002 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:03:04,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:03:04,002 INFO L82 PathProgramCache]: Analyzing trace with hash -1162443569, now seen corresponding path program 2 times [2019-12-27 20:03:04,003 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:03:04,003 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792049952] [2019-12-27 20:03:04,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:03:04,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:03:04,112 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:03:04,112 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792049952] [2019-12-27 20:03:04,113 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:03:04,113 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 20:03:04,113 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [725990713] [2019-12-27 20:03:04,113 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:03:04,133 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:03:04,212 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 111 states and 166 transitions. [2019-12-27 20:03:04,212 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:03:04,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:03:04,369 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 13 times. [2019-12-27 20:03:04,370 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 20:03:04,370 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:03:04,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 20:03:04,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-12-27 20:03:04,371 INFO L87 Difference]: Start difference. First operand 773 states and 1630 transitions. Second operand 10 states. [2019-12-27 20:03:05,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:03:05,361 INFO L93 Difference]: Finished difference Result 1157 states and 2371 transitions. [2019-12-27 20:03:05,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 20:03:05,362 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 51 [2019-12-27 20:03:05,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:03:05,365 INFO L225 Difference]: With dead ends: 1157 [2019-12-27 20:03:05,365 INFO L226 Difference]: Without dead ends: 1157 [2019-12-27 20:03:05,366 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 9 SyntacticMatches, 7 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2019-12-27 20:03:05,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1157 states. [2019-12-27 20:03:05,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1157 to 845. [2019-12-27 20:03:05,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 845 states. [2019-12-27 20:03:05,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 1761 transitions. [2019-12-27 20:03:05,386 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 1761 transitions. Word has length 51 [2019-12-27 20:03:05,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:03:05,386 INFO L462 AbstractCegarLoop]: Abstraction has 845 states and 1761 transitions. [2019-12-27 20:03:05,386 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 20:03:05,387 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1761 transitions. [2019-12-27 20:03:05,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 20:03:05,388 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:03:05,389 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:03:05,389 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:03:05,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:03:05,389 INFO L82 PathProgramCache]: Analyzing trace with hash -1548839163, now seen corresponding path program 3 times [2019-12-27 20:03:05,390 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:03:05,390 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987736959] [2019-12-27 20:03:05,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:03:05,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:03:05,475 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:03:05,478 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987736959] [2019-12-27 20:03:05,478 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:03:05,478 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:03:05,478 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1892399034] [2019-12-27 20:03:05,478 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:03:05,493 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:03:05,560 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 99 states and 129 transitions. [2019-12-27 20:03:05,560 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:03:05,563 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 20:03:05,564 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:03:05,564 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:03:05,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:03:05,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:03:05,565 INFO L87 Difference]: Start difference. First operand 845 states and 1761 transitions. Second operand 3 states. [2019-12-27 20:03:05,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:03:05,613 INFO L93 Difference]: Finished difference Result 1118 states and 2337 transitions. [2019-12-27 20:03:05,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:03:05,613 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-27 20:03:05,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:03:05,616 INFO L225 Difference]: With dead ends: 1118 [2019-12-27 20:03:05,617 INFO L226 Difference]: Without dead ends: 1118 [2019-12-27 20:03:05,617 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:03:05,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1118 states. [2019-12-27 20:03:05,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1118 to 902. [2019-12-27 20:03:05,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 902 states. [2019-12-27 20:03:05,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 902 states and 1897 transitions. [2019-12-27 20:03:05,637 INFO L78 Accepts]: Start accepts. Automaton has 902 states and 1897 transitions. Word has length 51 [2019-12-27 20:03:05,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:03:05,638 INFO L462 AbstractCegarLoop]: Abstraction has 902 states and 1897 transitions. [2019-12-27 20:03:05,638 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:03:05,639 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 1897 transitions. [2019-12-27 20:03:05,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 20:03:05,641 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:03:05,641 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:03:05,641 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:03:05,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:03:05,642 INFO L82 PathProgramCache]: Analyzing trace with hash -2127061277, now seen corresponding path program 1 times [2019-12-27 20:03:05,642 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:03:05,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492463457] [2019-12-27 20:03:05,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:03:05,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:03:05,872 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:03:05,873 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492463457] [2019-12-27 20:03:05,873 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:03:05,873 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 20:03:05,873 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1772237559] [2019-12-27 20:03:05,873 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:03:05,884 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:03:05,976 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 113 states and 169 transitions. [2019-12-27 20:03:05,976 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:03:06,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:03:06,162 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 14 times. [2019-12-27 20:03:06,163 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 20:03:06,163 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:03:06,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 20:03:06,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-12-27 20:03:06,164 INFO L87 Difference]: Start difference. First operand 902 states and 1897 transitions. Second operand 13 states. [2019-12-27 20:03:07,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:03:07,587 INFO L93 Difference]: Finished difference Result 1447 states and 2956 transitions. [2019-12-27 20:03:07,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 20:03:07,588 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 52 [2019-12-27 20:03:07,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:03:07,593 INFO L225 Difference]: With dead ends: 1447 [2019-12-27 20:03:07,593 INFO L226 Difference]: Without dead ends: 1447 [2019-12-27 20:03:07,594 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 9 SyntacticMatches, 9 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380 [2019-12-27 20:03:07,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1447 states. [2019-12-27 20:03:07,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1447 to 974. [2019-12-27 20:03:07,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 974 states. [2019-12-27 20:03:07,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 974 states to 974 states and 2046 transitions. [2019-12-27 20:03:07,617 INFO L78 Accepts]: Start accepts. Automaton has 974 states and 2046 transitions. Word has length 52 [2019-12-27 20:03:07,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:03:07,618 INFO L462 AbstractCegarLoop]: Abstraction has 974 states and 2046 transitions. [2019-12-27 20:03:07,618 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 20:03:07,618 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states and 2046 transitions. [2019-12-27 20:03:07,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 20:03:07,621 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:03:07,621 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:03:07,621 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:03:07,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:03:07,622 INFO L82 PathProgramCache]: Analyzing trace with hash 313439079, now seen corresponding path program 1 times [2019-12-27 20:03:07,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:03:07,623 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545698546] [2019-12-27 20:03:07,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:03:07,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:03:07,675 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:03:07,676 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545698546] [2019-12-27 20:03:07,676 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:03:07,676 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:03:07,676 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1409225412] [2019-12-27 20:03:07,677 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:03:07,692 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:03:07,790 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 102 states and 133 transitions. [2019-12-27 20:03:07,790 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:03:07,796 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 20:03:07,796 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:03:07,797 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:03:07,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:03:07,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:03:07,797 INFO L87 Difference]: Start difference. First operand 974 states and 2046 transitions. Second operand 3 states. [2019-12-27 20:03:07,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:03:07,836 INFO L93 Difference]: Finished difference Result 1347 states and 2721 transitions. [2019-12-27 20:03:07,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:03:07,836 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 20:03:07,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:03:07,842 INFO L225 Difference]: With dead ends: 1347 [2019-12-27 20:03:07,842 INFO L226 Difference]: Without dead ends: 1347 [2019-12-27 20:03:07,848 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:03:07,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1347 states. [2019-12-27 20:03:07,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1347 to 1048. [2019-12-27 20:03:07,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1048 states. [2019-12-27 20:03:07,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1048 states to 1048 states and 2176 transitions. [2019-12-27 20:03:07,871 INFO L78 Accepts]: Start accepts. Automaton has 1048 states and 2176 transitions. Word has length 52 [2019-12-27 20:03:07,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:03:07,871 INFO L462 AbstractCegarLoop]: Abstraction has 1048 states and 2176 transitions. [2019-12-27 20:03:07,871 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:03:07,871 INFO L276 IsEmpty]: Start isEmpty. Operand 1048 states and 2176 transitions. [2019-12-27 20:03:07,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 20:03:07,874 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:03:07,874 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:03:07,874 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:03:07,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:03:07,875 INFO L82 PathProgramCache]: Analyzing trace with hash -1220422803, now seen corresponding path program 2 times [2019-12-27 20:03:07,875 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:03:07,875 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797101644] [2019-12-27 20:03:07,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:03:07,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:03:07,972 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:03:07,972 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797101644] [2019-12-27 20:03:07,972 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:03:07,972 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:03:07,973 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2146499801] [2019-12-27 20:03:07,973 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:03:08,001 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:03:08,059 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 102 states and 133 transitions. [2019-12-27 20:03:08,059 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:03:08,060 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:03:08,060 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:03:08,060 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:03:08,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:03:08,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:03:08,060 INFO L87 Difference]: Start difference. First operand 1048 states and 2176 transitions. Second operand 3 states. [2019-12-27 20:03:08,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:03:08,073 INFO L93 Difference]: Finished difference Result 1047 states and 2174 transitions. [2019-12-27 20:03:08,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:03:08,074 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 20:03:08,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:03:08,076 INFO L225 Difference]: With dead ends: 1047 [2019-12-27 20:03:08,076 INFO L226 Difference]: Without dead ends: 1047 [2019-12-27 20:03:08,076 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:03:08,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1047 states. [2019-12-27 20:03:08,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1047 to 823. [2019-12-27 20:03:08,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 823 states. [2019-12-27 20:03:08,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1747 transitions. [2019-12-27 20:03:08,094 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1747 transitions. Word has length 52 [2019-12-27 20:03:08,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:03:08,094 INFO L462 AbstractCegarLoop]: Abstraction has 823 states and 1747 transitions. [2019-12-27 20:03:08,094 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:03:08,094 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1747 transitions. [2019-12-27 20:03:08,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 20:03:08,096 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:03:08,096 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:03:08,096 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:03:08,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:03:08,097 INFO L82 PathProgramCache]: Analyzing trace with hash -445188541, now seen corresponding path program 1 times [2019-12-27 20:03:08,097 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:03:08,098 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696549700] [2019-12-27 20:03:08,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:03:08,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 20:03:08,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 20:03:08,245 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 20:03:08,245 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 20:03:08,249 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] ULTIMATE.startENTRY-->L799: Formula: (let ((.cse0 (store |v_#valid_51| 0 0))) (and (= |v_ULTIMATE.start_main_~#t309~0.offset_17| 0) (= v_~main$tmp_guard1~0_17 0) (= v_~x~0_11 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t309~0.base_22| 1) |v_#valid_49|) (= 0 v_~__unbuffered_p1_EAX~0_14) (= 0 v_~y$w_buff1~0_24) (= v_~main$tmp_guard0~0_9 0) (= |v_#NULL.offset_6| 0) (= v_~__unbuffered_p1_EBX~0_15 0) (= v_~y$read_delayed~0_7 0) (= 0 v_~y$mem_tmp~0_7) (= 0 v_~y$r_buff1_thd2~0_56) (= 0 v_~__unbuffered_cnt~0_17) (= 0 v_~y$read_delayed_var~0.base_5) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t309~0.base_22| 4) |v_#length_17|) (= 0 v_~weak$$choice2~0_34) (= v_~y~0_24 0) (< 0 |v_#StackHeapBarrier_15|) (= 0 v_~y$r_buff1_thd0~0_24) (= 0 v_~y$flush_delayed~0_13) (= 0 v_~y$read_delayed_var~0.offset_5) (= v_~y$r_buff0_thd1~0_29 0) (= 0 |v_#NULL.base_6|) (= 0 v_~y$r_buff1_thd1~0_18) (= v_~y$r_buff0_thd0~0_21 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t309~0.base_22|) 0) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t309~0.base_22|) (= v_~y$w_buff0_used~0_105 0) (= v_~y$r_buff0_thd2~0_81 0) (= 0 v_~y$w_buff0~0_25) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t309~0.base_22| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t309~0.base_22|) |v_ULTIMATE.start_main_~#t309~0.offset_17| 0)) |v_#memory_int_11|) (= 0 v_~__unbuffered_p0_EAX~0_16) (= v_~y$w_buff1_used~0_64 0) (= 0 v_~weak$$choice0~0_6))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_51|, #memory_int=|v_#memory_int_12|, #length=|v_#length_18|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_5, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_105, ULTIMATE.start_main_~#t310~0.base=|v_ULTIMATE.start_main_~#t310~0.base_24|, #NULL.offset=|v_#NULL.offset_6|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_10|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_10|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_21|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_10|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_18, ~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_16, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, ~y$w_buff0~0=v_~y$w_buff0~0_25, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_29, ~y$flush_delayed~0=v_~y$flush_delayed~0_13, #length=|v_#length_17|, ~y~0=v_~y~0_24, ULTIMATE.start_main_~#t309~0.offset=|v_ULTIMATE.start_main_~#t309~0.offset_17|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9, ULTIMATE.start_main_~#t310~0.offset=|v_ULTIMATE.start_main_~#t310~0.offset_18|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_~#t309~0.base=|v_ULTIMATE.start_main_~#t309~0.base_22|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_56, ~weak$$choice0~0=v_~weak$$choice0~0_6, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_12|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_12|, ~y$w_buff1~0=v_~y$w_buff1~0_24, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_5, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_21, #valid=|v_#valid_49|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_81, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~weak$$choice2~0=v_~weak$$choice2~0_34, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_24, ~x~0=v_~x~0_11, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_64} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_~#t310~0.base, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ULTIMATE.start_main_~#t309~0.offset, ~__unbuffered_p1_EBX~0, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t310~0.offset, #NULL.base, ULTIMATE.start_main_~#t309~0.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 20:03:08,251 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L799-1-->L801: Formula: (and (= 0 (select |v_#valid_20| |v_ULTIMATE.start_main_~#t310~0.base_10|)) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t310~0.base_10| 4)) (not (= |v_ULTIMATE.start_main_~#t310~0.base_10| 0)) (= |v_ULTIMATE.start_main_~#t310~0.offset_9| 0) (= (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t310~0.base_10| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t310~0.base_10|) |v_ULTIMATE.start_main_~#t310~0.offset_9| 1)) |v_#memory_int_5|) (= (store |v_#valid_20| |v_ULTIMATE.start_main_~#t310~0.base_10| 1) |v_#valid_19|) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t310~0.base_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_7|, ULTIMATE.start_main_~#t310~0.base=|v_ULTIMATE.start_main_~#t310~0.base_10|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_9|, ULTIMATE.start_main_~#t310~0.offset=|v_ULTIMATE.start_main_~#t310~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t310~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t310~0.offset] because there is no mapped edge [2019-12-27 20:03:08,252 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L4-->L740: Formula: (and (not (= 0 P0Thread1of1ForFork0___VERIFIER_assert_~expression_In2004967973)) (= ~y$r_buff1_thd0~0_Out2004967973 ~y$r_buff0_thd0~0_In2004967973) (= 1 ~y$r_buff0_thd1~0_Out2004967973) (= ~y$r_buff1_thd1~0_Out2004967973 ~y$r_buff0_thd1~0_In2004967973) (= ~x~0_In2004967973 ~__unbuffered_p0_EAX~0_Out2004967973) (= ~y$r_buff1_thd2~0_Out2004967973 ~y$r_buff0_thd2~0_In2004967973)) InVars {~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2004967973, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2004967973, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2004967973, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In2004967973, ~x~0=~x~0_In2004967973} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out2004967973, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out2004967973, ~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out2004967973, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2004967973, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out2004967973, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2004967973, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In2004967973, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out2004967973, ~x~0=~x~0_In2004967973} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p0_EAX~0, ~y$r_buff0_thd1~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 20:03:08,255 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L741-->L741-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-802945745 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-802945745 256) 0))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-802945745|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out-802945745| ~y$w_buff0_used~0_In-802945745)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-802945745, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-802945745} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-802945745|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-802945745, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-802945745} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 20:03:08,256 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L742-->L742-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1872519145 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd1~0_In-1872519145 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In-1872519145 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd1~0_In-1872519145 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite6_Out-1872519145| 0)) (and (= |P0Thread1of1ForFork0_#t~ite6_Out-1872519145| ~y$w_buff1_used~0_In-1872519145) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1872519145, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1872519145, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1872519145, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1872519145} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1872519145|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1872519145, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1872519145, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1872519145, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1872519145} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 20:03:08,257 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L743-->L744: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In2023604100 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In2023604100 256)))) (or (and (not .cse0) (not .cse1) (= ~y$r_buff0_thd1~0_Out2023604100 0)) (and (or .cse0 .cse1) (= ~y$r_buff0_thd1~0_Out2023604100 ~y$r_buff0_thd1~0_In2023604100)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2023604100, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2023604100} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2023604100, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out2023604100|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out2023604100} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 20:03:08,258 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L744-->L744-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff1_thd1~0_In-709988257 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-709988257 256))) (.cse0 (= (mod ~y$r_buff0_thd1~0_In-709988257 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-709988257 256)))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out-709988257|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~y$r_buff1_thd1~0_In-709988257 |P0Thread1of1ForFork0_#t~ite8_Out-709988257|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-709988257, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-709988257, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-709988257, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-709988257} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-709988257, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-709988257, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-709988257|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-709988257, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-709988257} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 20:03:08,258 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L744-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#t~ite8_8| v_~y$r_buff1_thd1~0_13) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_9 (+ v_~__unbuffered_cnt~0_10 1))) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_13, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 20:03:08,260 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L766-->L766-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-794187612 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite17_Out-794187612| ~y$w_buff1~0_In-794187612) (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-794187612 256)))) (or (and (= (mod ~y$r_buff1_thd2~0_In-794187612 256) 0) .cse0) (and (= (mod ~y$w_buff1_used~0_In-794187612 256) 0) .cse0) (= 0 (mod ~y$w_buff0_used~0_In-794187612 256)))) .cse1 (= |P1Thread1of1ForFork1_#t~ite17_Out-794187612| |P1Thread1of1ForFork1_#t~ite18_Out-794187612|)) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite18_Out-794187612| ~y$w_buff1~0_In-794187612) (= |P1Thread1of1ForFork1_#t~ite17_In-794187612| |P1Thread1of1ForFork1_#t~ite17_Out-794187612|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-794187612, ~y$w_buff1~0=~y$w_buff1~0_In-794187612, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-794187612, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-794187612, ~weak$$choice2~0=~weak$$choice2~0_In-794187612, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_In-794187612|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-794187612} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-794187612, P1Thread1of1ForFork1_#t~ite18=|P1Thread1of1ForFork1_#t~ite18_Out-794187612|, ~y$w_buff1~0=~y$w_buff1~0_In-794187612, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-794187612, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-794187612, ~weak$$choice2~0=~weak$$choice2~0_In-794187612, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_Out-794187612|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-794187612} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite18, P1Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-12-27 20:03:08,261 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L767-->L767-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In687325166 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite20_Out687325166| ~y$w_buff0_used~0_In687325166) (= |P1Thread1of1ForFork1_#t~ite21_Out687325166| |P1Thread1of1ForFork1_#t~ite20_Out687325166|) .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In687325166 256)))) (or (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In687325166 256))) (and .cse1 (= (mod ~y$w_buff1_used~0_In687325166 256) 0)) (= 0 (mod ~y$w_buff0_used~0_In687325166 256))))) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite20_In687325166| |P1Thread1of1ForFork1_#t~ite20_Out687325166|) (= |P1Thread1of1ForFork1_#t~ite21_Out687325166| ~y$w_buff0_used~0_In687325166)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In687325166, ~y$w_buff0_used~0=~y$w_buff0_used~0_In687325166, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In687325166|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In687325166, ~weak$$choice2~0=~weak$$choice2~0_In687325166, ~y$w_buff1_used~0=~y$w_buff1_used~0_In687325166} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In687325166, ~y$w_buff0_used~0=~y$w_buff0_used~0_In687325166, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out687325166|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In687325166, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out687325166|, ~weak$$choice2~0=~weak$$choice2~0_In687325166, ~y$w_buff1_used~0=~y$w_buff1_used~0_In687325166} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-27 20:03:08,262 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L768-->L768-8: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In-1176770051 256))) (.cse6 (= 0 (mod ~y$r_buff0_thd2~0_In-1176770051 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1176770051 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In-1176770051 256) 0)) (.cse5 (= |P1Thread1of1ForFork1_#t~ite24_Out-1176770051| |P1Thread1of1ForFork1_#t~ite23_Out-1176770051|)) (.cse4 (= (mod ~weak$$choice2~0_In-1176770051 256) 0))) (or (let ((.cse1 (not .cse6))) (and (or (not .cse0) .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite22_Out-1176770051|) (or .cse1 (not .cse2)) (not .cse3) .cse4 .cse5 (= |P1Thread1of1ForFork1_#t~ite23_Out-1176770051| |P1Thread1of1ForFork1_#t~ite22_Out-1176770051|))) (and (or (and (or (and .cse6 .cse2) (and .cse6 .cse0) .cse3) (= ~y$w_buff1_used~0_In-1176770051 |P1Thread1of1ForFork1_#t~ite23_Out-1176770051|) .cse4 .cse5) (and (= ~y$w_buff1_used~0_In-1176770051 |P1Thread1of1ForFork1_#t~ite24_Out-1176770051|) (= |P1Thread1of1ForFork1_#t~ite23_Out-1176770051| |P1Thread1of1ForFork1_#t~ite23_In-1176770051|) (not .cse4))) (= |P1Thread1of1ForFork1_#t~ite22_In-1176770051| |P1Thread1of1ForFork1_#t~ite22_Out-1176770051|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1176770051, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1176770051, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1176770051, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In-1176770051|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_In-1176770051|, ~weak$$choice2~0=~weak$$choice2~0_In-1176770051, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1176770051} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1176770051, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1176770051, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1176770051, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out-1176770051|, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out-1176770051|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_Out-1176770051|, ~weak$$choice2~0=~weak$$choice2~0_In-1176770051, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1176770051} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22] because there is no mapped edge [2019-12-27 20:03:08,262 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [665] [665] L769-->L770: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_15 256))) (= v_~y$r_buff0_thd2~0_49 v_~y$r_buff0_thd2~0_50)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_50, ~weak$$choice2~0=v_~weak$$choice2~0_15} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_49, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_9|, ~weak$$choice2~0=v_~weak$$choice2~0_15, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_8|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_9|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-27 20:03:08,263 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L770-->L770-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1701830127 256) 0))) (or (let ((.cse1 (not (= 0 (mod ~y$r_buff0_thd2~0_In1701830127 256))))) (and .cse0 (or (not (= 0 (mod ~y$r_buff1_thd2~0_In1701830127 256))) .cse1) (or (not (= (mod ~y$w_buff1_used~0_In1701830127 256) 0)) .cse1) (= |P1Thread1of1ForFork1_#t~ite28_Out1701830127| |P1Thread1of1ForFork1_#t~ite29_Out1701830127|) (= |P1Thread1of1ForFork1_#t~ite30_Out1701830127| |P1Thread1of1ForFork1_#t~ite29_Out1701830127|) (= |P1Thread1of1ForFork1_#t~ite28_Out1701830127| 0) (not (= 0 (mod ~y$w_buff0_used~0_In1701830127 256))))) (and (= ~y$r_buff1_thd2~0_In1701830127 |P1Thread1of1ForFork1_#t~ite30_Out1701830127|) (= |P1Thread1of1ForFork1_#t~ite28_In1701830127| |P1Thread1of1ForFork1_#t~ite28_Out1701830127|) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite29_In1701830127| |P1Thread1of1ForFork1_#t~ite29_Out1701830127|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1701830127, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In1701830127|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1701830127, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1701830127, ~weak$$choice2~0=~weak$$choice2~0_In1701830127, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_In1701830127|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1701830127} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1701830127, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out1701830127|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out1701830127|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1701830127, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1701830127, ~weak$$choice2~0=~weak$$choice2~0_In1701830127, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out1701830127|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1701830127} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30, P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-27 20:03:08,263 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [696] [696] L772-->L776: Formula: (and (not (= 0 (mod v_~y$flush_delayed~0_8 256))) (= v_~y~0_18 v_~y$mem_tmp~0_4) (= 0 v_~y$flush_delayed~0_7)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_8} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_4, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~y$flush_delayed~0=v_~y$flush_delayed~0_7, ~y~0=v_~y~0_18} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-27 20:03:08,264 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L776-2-->L776-5: Formula: (let ((.cse1 (= |P1Thread1of1ForFork1_#t~ite33_Out1351819740| |P1Thread1of1ForFork1_#t~ite32_Out1351819740|)) (.cse2 (= (mod ~y$w_buff1_used~0_In1351819740 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In1351819740 256)))) (or (and (not .cse0) (= ~y$w_buff1~0_In1351819740 |P1Thread1of1ForFork1_#t~ite32_Out1351819740|) .cse1 (not .cse2)) (and .cse1 (= ~y~0_In1351819740 |P1Thread1of1ForFork1_#t~ite32_Out1351819740|) (or .cse2 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1351819740, ~y$w_buff1~0=~y$w_buff1~0_In1351819740, ~y~0=~y~0_In1351819740, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1351819740} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1351819740, ~y$w_buff1~0=~y$w_buff1~0_In1351819740, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out1351819740|, P1Thread1of1ForFork1_#t~ite33=|P1Thread1of1ForFork1_#t~ite33_Out1351819740|, ~y~0=~y~0_In1351819740, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1351819740} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-12-27 20:03:08,265 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L777-->L777-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1751328619 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd2~0_In-1751328619 256) 0))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite34_Out-1751328619| 0)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-1751328619 |P1Thread1of1ForFork1_#t~ite34_Out-1751328619|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1751328619, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1751328619} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1751328619, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1751328619, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-1751328619|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 20:03:08,266 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L778-->L778-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1474735723 256))) (.cse1 (= (mod ~y$r_buff0_thd2~0_In1474735723 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In1474735723 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In1474735723 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In1474735723 |P1Thread1of1ForFork1_#t~ite35_Out1474735723|) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |P1Thread1of1ForFork1_#t~ite35_Out1474735723|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1474735723, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1474735723, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1474735723, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1474735723} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1474735723, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1474735723, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1474735723, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out1474735723|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1474735723} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 20:03:08,267 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L779-->L779-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In672052208 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In672052208 256)))) (or (and (= ~y$r_buff0_thd2~0_In672052208 |P1Thread1of1ForFork1_#t~ite36_Out672052208|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite36_Out672052208| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In672052208, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In672052208} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In672052208, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In672052208, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out672052208|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 20:03:08,268 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L780-->L780-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff0_used~0_In331226688 256))) (.cse3 (= (mod ~y$r_buff0_thd2~0_In331226688 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd2~0_In331226688 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In331226688 256) 0))) (or (and (= ~y$r_buff1_thd2~0_In331226688 |P1Thread1of1ForFork1_#t~ite37_Out331226688|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |P1Thread1of1ForFork1_#t~ite37_Out331226688|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In331226688, ~y$w_buff0_used~0=~y$w_buff0_used~0_In331226688, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In331226688, ~y$w_buff1_used~0=~y$w_buff1_used~0_In331226688} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In331226688, ~y$w_buff0_used~0=~y$w_buff0_used~0_In331226688, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In331226688, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out331226688|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In331226688} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 20:03:08,268 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L780-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~y$r_buff1_thd2~0_50 |v_P1Thread1of1ForFork1_#t~ite37_8|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_8|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_50, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_7|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 20:03:08,268 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L801-1-->L807: Formula: (and (= v_~__unbuffered_cnt~0_8 2) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_4|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-27 20:03:08,269 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L807-2-->L807-4: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In-648549935 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-648549935 256)))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out-648549935| ~y$w_buff1~0_In-648549935) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite40_Out-648549935| ~y~0_In-648549935)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-648549935, ~y~0=~y~0_In-648549935, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-648549935, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-648549935} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-648549935|, ~y$w_buff1~0=~y$w_buff1~0_In-648549935, ~y~0=~y~0_In-648549935, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-648549935, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-648549935} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 20:03:08,269 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L807-4-->L808: Formula: (= v_~y~0_17 |v_ULTIMATE.start_main_#t~ite40_8|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_8|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_7|, ~y~0=v_~y~0_17} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-12-27 20:03:08,270 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L808-->L808-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In733436584 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In733436584 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite42_Out733436584| 0)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In733436584 |ULTIMATE.start_main_#t~ite42_Out733436584|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In733436584, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In733436584} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In733436584, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In733436584, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out733436584|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 20:03:08,270 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L809-->L809-2: Formula: (let ((.cse2 (= (mod ~y$w_buff0_used~0_In-84438136 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In-84438136 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-84438136 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-84438136 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite43_Out-84438136|)) (and (or .cse2 .cse3) (= ~y$w_buff1_used~0_In-84438136 |ULTIMATE.start_main_#t~ite43_Out-84438136|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-84438136, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-84438136, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-84438136, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-84438136} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-84438136, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-84438136, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-84438136|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-84438136, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-84438136} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 20:03:08,271 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L810-->L810-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-1804706474 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-1804706474 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite44_Out-1804706474| 0)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite44_Out-1804706474| ~y$r_buff0_thd0~0_In-1804706474)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1804706474, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1804706474} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1804706474, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1804706474, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1804706474|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 20:03:08,272 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L811-->L811-2: Formula: (let ((.cse2 (= (mod ~y$r_buff0_thd0~0_In-395408441 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In-395408441 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-395408441 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-395408441 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite45_Out-395408441|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite45_Out-395408441| ~y$r_buff1_thd0~0_In-395408441) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-395408441, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-395408441, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-395408441, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-395408441} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-395408441, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-395408441, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-395408441, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-395408441|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-395408441} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 20:03:08,272 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L811-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6| (mod v_~main$tmp_guard1~0_10 256)) (= 1 v_~__unbuffered_p1_EAX~0_8) (= v_~main$tmp_guard1~0_10 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= 0 v_~__unbuffered_p0_EAX~0_10) (= |v_ULTIMATE.start_main_#t~ite45_12| v_~y$r_buff1_thd0~0_18) (= 0 v_~__unbuffered_p1_EBX~0_9)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_10, ~__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_12|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_10, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_18, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_11|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 20:03:08,355 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 08:03:08 BasicIcfg [2019-12-27 20:03:08,356 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 20:03:08,357 INFO L168 Benchmark]: Toolchain (without parser) took 15349.87 ms. Allocated memory was 145.2 MB in the beginning and 619.2 MB in the end (delta: 474.0 MB). Free memory was 101.7 MB in the beginning and 261.1 MB in the end (delta: -159.4 MB). Peak memory consumption was 314.5 MB. Max. memory is 7.1 GB. [2019-12-27 20:03:08,358 INFO L168 Benchmark]: CDTParser took 0.55 ms. Allocated memory is still 145.2 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 20:03:08,361 INFO L168 Benchmark]: CACSL2BoogieTranslator took 756.48 ms. Allocated memory was 145.2 MB in the beginning and 203.4 MB in the end (delta: 58.2 MB). Free memory was 101.3 MB in the beginning and 157.6 MB in the end (delta: -56.3 MB). Peak memory consumption was 22.3 MB. Max. memory is 7.1 GB. [2019-12-27 20:03:08,361 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.61 ms. Allocated memory is still 203.4 MB. Free memory was 157.6 MB in the beginning and 155.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 20:03:08,362 INFO L168 Benchmark]: Boogie Preprocessor took 37.62 ms. Allocated memory is still 203.4 MB. Free memory was 155.6 MB in the beginning and 152.9 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:03:08,363 INFO L168 Benchmark]: RCFGBuilder took 844.35 ms. Allocated memory is still 203.4 MB. Free memory was 152.9 MB in the beginning and 108.7 MB in the end (delta: 44.2 MB). Peak memory consumption was 44.2 MB. Max. memory is 7.1 GB. [2019-12-27 20:03:08,363 INFO L168 Benchmark]: TraceAbstraction took 13641.56 ms. Allocated memory was 203.4 MB in the beginning and 619.2 MB in the end (delta: 415.8 MB). Free memory was 108.0 MB in the beginning and 261.1 MB in the end (delta: -153.1 MB). Peak memory consumption was 262.7 MB. Max. memory is 7.1 GB. [2019-12-27 20:03:08,374 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.55 ms. Allocated memory is still 145.2 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 756.48 ms. Allocated memory was 145.2 MB in the beginning and 203.4 MB in the end (delta: 58.2 MB). Free memory was 101.3 MB in the beginning and 157.6 MB in the end (delta: -56.3 MB). Peak memory consumption was 22.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 63.61 ms. Allocated memory is still 203.4 MB. Free memory was 157.6 MB in the beginning and 155.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.62 ms. Allocated memory is still 203.4 MB. Free memory was 155.6 MB in the beginning and 152.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 844.35 ms. Allocated memory is still 203.4 MB. Free memory was 152.9 MB in the beginning and 108.7 MB in the end (delta: 44.2 MB). Peak memory consumption was 44.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13641.56 ms. Allocated memory was 203.4 MB in the beginning and 619.2 MB in the end (delta: 415.8 MB). Free memory was 108.0 MB in the beginning and 261.1 MB in the end (delta: -153.1 MB). Peak memory consumption was 262.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.5s, 148 ProgramPointsBefore, 74 ProgramPointsAfterwards, 182 TransitionsBefore, 82 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 29 ChoiceCompositions, 4737 VarBasedMoverChecksPositive, 159 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 49139 CheckedPairsTotal, 103 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L799] FCALL, FORK 0 pthread_create(&t309, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L726] 1 y$w_buff1 = y$w_buff0 [L727] 1 y$w_buff0 = 1 [L728] 1 y$w_buff1_used = y$w_buff0_used [L729] 1 y$w_buff0_used = (_Bool)1 [L801] FCALL, FORK 0 pthread_create(&t310, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L740] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L754] 2 x = 1 [L757] 2 __unbuffered_p1_EAX = x [L760] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L761] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L762] 2 y$flush_delayed = weak$$choice2 [L763] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L764] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L740] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L741] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L742] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L764] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L765] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L765] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L766] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L767] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L768] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L770] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L771] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L776] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L776] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L777] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L778] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L779] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L807] 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L808] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L809] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L810] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 142 locations, 2 error locations. Result: UNSAFE, OverallTime: 13.3s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 4.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1676 SDtfs, 1771 SDslu, 4123 SDs, 0 SdLazy, 3278 SolverSat, 94 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 149 GetRequests, 51 SyntacticMatches, 24 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8357occurred 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: 0.8s AutomataMinimizationTime, 14 MinimizatonAttempts, 2797 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 523 NumberOfCodeBlocks, 523 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 456 ConstructedInterpolants, 0 QuantifiedInterpolants, 65248 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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...