/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/rfi007_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 21:59:44,663 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 21:59:44,666 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 21:59:44,684 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 21:59:44,685 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 21:59:44,687 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 21:59:44,689 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 21:59:44,698 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 21:59:44,702 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 21:59:44,705 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 21:59:44,707 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 21:59:44,708 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 21:59:44,709 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 21:59:44,711 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 21:59:44,713 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 21:59:44,714 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 21:59:44,716 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 21:59:44,717 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 21:59:44,718 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 21:59:44,723 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 21:59:44,727 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 21:59:44,732 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 21:59:44,733 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 21:59:44,734 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 21:59:44,736 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 21:59:44,736 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 21:59:44,736 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 21:59:44,738 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 21:59:44,739 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 21:59:44,740 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 21:59:44,740 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 21:59:44,742 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 21:59:44,743 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 21:59:44,744 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 21:59:44,745 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 21:59:44,745 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 21:59:44,746 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 21:59:44,746 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 21:59:44,746 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 21:59:44,747 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 21:59:44,748 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 21:59:44,749 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 21:59:44,779 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 21:59:44,780 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 21:59:44,781 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 21:59:44,781 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 21:59:44,781 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 21:59:44,784 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 21:59:44,784 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 21:59:44,784 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 21:59:44,784 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 21:59:44,785 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 21:59:44,787 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 21:59:44,787 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 21:59:44,787 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 21:59:44,787 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 21:59:44,787 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 21:59:44,788 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 21:59:44,788 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 21:59:44,788 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 21:59:44,788 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 21:59:44,788 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 21:59:44,788 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 21:59:44,790 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 21:59:44,790 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 21:59:44,790 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 21:59:44,791 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 21:59:44,791 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 21:59:44,791 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 21:59:44,791 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 21:59:44,791 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 21:59:44,791 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 21:59:44,792 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 21:59:44,793 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 21:59:45,086 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 21:59:45,108 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 21:59:45,112 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 21:59:45,114 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 21:59:45,115 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 21:59:45,115 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi007_rmo.opt.i [2019-12-27 21:59:45,193 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e7cf7e7f/9f3eff4b4bcb4b0993d7ae187cc96e41/FLAG9ec94fdc3 [2019-12-27 21:59:45,775 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 21:59:45,776 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi007_rmo.opt.i [2019-12-27 21:59:45,802 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e7cf7e7f/9f3eff4b4bcb4b0993d7ae187cc96e41/FLAG9ec94fdc3 [2019-12-27 21:59:46,039 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e7cf7e7f/9f3eff4b4bcb4b0993d7ae187cc96e41 [2019-12-27 21:59:46,050 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 21:59:46,052 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 21:59:46,053 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 21:59:46,053 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 21:59:46,057 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 21:59:46,058 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:59:46" (1/1) ... [2019-12-27 21:59:46,061 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ad32b5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:59:46, skipping insertion in model container [2019-12-27 21:59:46,061 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:59:46" (1/1) ... [2019-12-27 21:59:46,069 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 21:59:46,134 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 21:59:46,701 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:59:46,716 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 21:59:46,795 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:59:46,883 INFO L208 MainTranslator]: Completed translation [2019-12-27 21:59:46,883 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:59:46 WrapperNode [2019-12-27 21:59:46,883 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 21:59:46,884 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 21:59:46,884 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 21:59:46,886 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 21:59:46,895 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:59:46" (1/1) ... [2019-12-27 21:59:46,915 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:59:46" (1/1) ... [2019-12-27 21:59:46,944 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 21:59:46,945 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 21:59:46,945 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 21:59:46,945 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 21:59:46,956 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:59:46" (1/1) ... [2019-12-27 21:59:46,956 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:59:46" (1/1) ... [2019-12-27 21:59:46,961 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:59:46" (1/1) ... [2019-12-27 21:59:46,961 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:59:46" (1/1) ... [2019-12-27 21:59:46,973 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:59:46" (1/1) ... [2019-12-27 21:59:46,978 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:59:46" (1/1) ... [2019-12-27 21:59:46,984 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:59:46" (1/1) ... [2019-12-27 21:59:46,991 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 21:59:46,992 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 21:59:46,992 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 21:59:46,992 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 21:59:46,993 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:59:46" (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 21:59:47,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 21:59:47,068 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 21:59:47,068 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 21:59:47,068 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 21:59:47,069 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 21:59:47,069 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 21:59:47,069 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 21:59:47,069 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 21:59:47,069 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 21:59:47,069 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 21:59:47,070 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 21:59:47,071 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 21:59:47,775 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 21:59:47,776 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 21:59:47,777 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:59:47 BoogieIcfgContainer [2019-12-27 21:59:47,778 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 21:59:47,779 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 21:59:47,779 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 21:59:47,782 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 21:59:47,783 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 09:59:46" (1/3) ... [2019-12-27 21:59:47,784 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cad2388 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:59:47, skipping insertion in model container [2019-12-27 21:59:47,784 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:59:46" (2/3) ... [2019-12-27 21:59:47,784 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cad2388 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:59:47, skipping insertion in model container [2019-12-27 21:59:47,785 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:59:47" (3/3) ... [2019-12-27 21:59:47,786 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi007_rmo.opt.i [2019-12-27 21:59:47,797 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 21:59:47,797 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 21:59:47,805 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 21:59:47,806 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 21:59:47,847 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,847 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,848 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,848 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,848 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,848 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,851 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,851 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,851 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,853 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,853 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,853 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,854 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,854 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,854 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,854 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,855 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,855 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,855 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,855 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,856 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,856 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,857 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,857 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,857 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,857 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,858 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,858 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,858 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,859 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,859 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,859 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,860 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,860 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,863 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,863 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,864 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,864 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,864 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,865 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,866 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,866 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,867 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,872 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,872 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,873 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,873 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,873 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,873 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,874 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,874 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,874 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,874 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,874 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,875 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,875 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,875 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,876 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,876 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,876 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,876 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,877 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,877 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,877 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,877 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,877 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,878 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,878 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,878 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,879 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,879 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,879 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,879 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,880 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,880 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,880 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,880 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,880 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,881 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,881 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,881 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,882 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,882 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,882 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,882 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,883 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,883 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,883 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,883 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,883 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,884 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,884 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,884 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,885 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,885 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,885 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,885 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,886 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,886 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,886 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,886 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,886 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,887 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,887 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,887 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,888 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,888 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,888 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,888 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,889 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,889 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,889 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,889 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,889 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,890 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,890 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,890 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,891 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,891 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,891 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,891 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,891 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,892 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,892 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,892 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,892 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,892 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,893 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,893 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,893 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,893 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,894 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,894 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,894 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,894 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,895 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,895 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,895 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,895 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,896 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,896 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,896 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,896 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,897 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,897 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,897 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,897 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,897 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,898 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,898 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,914 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,915 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,918 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,918 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,919 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,919 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,919 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,919 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,919 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,920 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,920 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,920 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,920 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,920 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,928 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,931 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:47,948 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 21:59:47,969 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 21:59:47,969 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 21:59:47,969 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 21:59:47,970 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 21:59:47,970 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 21:59:47,970 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 21:59:47,970 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 21:59:47,970 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 21:59:47,987 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 181 transitions [2019-12-27 21:59:47,989 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-27 21:59:48,102 INFO L132 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-27 21:59:48,103 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:59:48,116 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 341 event pairs. 0/136 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 21:59:48,134 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-27 21:59:48,177 INFO L132 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-27 21:59:48,178 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:59:48,185 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 341 event pairs. 0/136 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 21:59:48,201 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-27 21:59:48,202 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 21:59:51,544 WARN L192 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-27 21:59:51,647 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-27 21:59:51,730 INFO L206 etLargeBlockEncoding]: Checked pairs total: 50908 [2019-12-27 21:59:51,731 INFO L214 etLargeBlockEncoding]: Total number of compositions: 100 [2019-12-27 21:59:51,735 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 80 places, 90 transitions [2019-12-27 21:59:52,335 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 9707 states. [2019-12-27 21:59:52,338 INFO L276 IsEmpty]: Start isEmpty. Operand 9707 states. [2019-12-27 21:59:52,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 21:59:52,347 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:59:52,348 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 21:59:52,349 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:59:52,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:59:52,357 INFO L82 PathProgramCache]: Analyzing trace with hash 787412, now seen corresponding path program 1 times [2019-12-27 21:59:52,373 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:59:52,375 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410327587] [2019-12-27 21:59:52,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:59:52,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:59:52,663 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 21:59:52,664 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410327587] [2019-12-27 21:59:52,665 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:59:52,665 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 21:59:52,666 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [299746956] [2019-12-27 21:59:52,669 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:59:52,673 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:59:52,686 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 21:59:52,687 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:59:52,691 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:59:52,692 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:59:52,692 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:59:52,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:59:52,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:59:52,709 INFO L87 Difference]: Start difference. First operand 9707 states. Second operand 3 states. [2019-12-27 21:59:53,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:59:53,014 INFO L93 Difference]: Finished difference Result 9421 states and 30351 transitions. [2019-12-27 21:59:53,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:59:53,016 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 21:59:53,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:59:53,112 INFO L225 Difference]: With dead ends: 9421 [2019-12-27 21:59:53,113 INFO L226 Difference]: Without dead ends: 8862 [2019-12-27 21:59:53,114 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 21:59:53,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8862 states. [2019-12-27 21:59:53,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8862 to 8862. [2019-12-27 21:59:53,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8862 states. [2019-12-27 21:59:53,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8862 states to 8862 states and 28501 transitions. [2019-12-27 21:59:53,733 INFO L78 Accepts]: Start accepts. Automaton has 8862 states and 28501 transitions. Word has length 3 [2019-12-27 21:59:53,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:59:53,733 INFO L462 AbstractCegarLoop]: Abstraction has 8862 states and 28501 transitions. [2019-12-27 21:59:53,734 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:59:53,734 INFO L276 IsEmpty]: Start isEmpty. Operand 8862 states and 28501 transitions. [2019-12-27 21:59:53,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 21:59:53,737 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:59:53,737 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:59:53,737 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:59:53,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:59:53,738 INFO L82 PathProgramCache]: Analyzing trace with hash -1755658876, now seen corresponding path program 1 times [2019-12-27 21:59:53,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:59:53,739 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133776817] [2019-12-27 21:59:53,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:59:53,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:59:53,845 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 21:59:53,846 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133776817] [2019-12-27 21:59:53,846 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:59:53,846 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:59:53,846 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [747186681] [2019-12-27 21:59:53,846 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:59:53,849 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:59:53,853 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 21:59:53,853 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:59:53,854 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:59:53,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:59:53,855 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:59:53,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:59:53,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:59:53,856 INFO L87 Difference]: Start difference. First operand 8862 states and 28501 transitions. Second operand 4 states. [2019-12-27 21:59:54,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:59:54,303 INFO L93 Difference]: Finished difference Result 13396 states and 41079 transitions. [2019-12-27 21:59:54,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:59:54,304 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 21:59:54,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:59:54,374 INFO L225 Difference]: With dead ends: 13396 [2019-12-27 21:59:54,374 INFO L226 Difference]: Without dead ends: 13389 [2019-12-27 21:59:54,375 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:59:54,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13389 states. [2019-12-27 21:59:55,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13389 to 12015. [2019-12-27 21:59:55,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12015 states. [2019-12-27 21:59:55,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12015 states to 12015 states and 37536 transitions. [2019-12-27 21:59:55,377 INFO L78 Accepts]: Start accepts. Automaton has 12015 states and 37536 transitions. Word has length 11 [2019-12-27 21:59:55,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:59:55,378 INFO L462 AbstractCegarLoop]: Abstraction has 12015 states and 37536 transitions. [2019-12-27 21:59:55,378 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:59:55,378 INFO L276 IsEmpty]: Start isEmpty. Operand 12015 states and 37536 transitions. [2019-12-27 21:59:55,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 21:59:55,384 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:59:55,384 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:59:55,384 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:59:55,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:59:55,385 INFO L82 PathProgramCache]: Analyzing trace with hash 1550555126, now seen corresponding path program 1 times [2019-12-27 21:59:55,385 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:59:55,385 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724955765] [2019-12-27 21:59:55,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:59:55,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:59:55,500 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 21:59:55,501 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724955765] [2019-12-27 21:59:55,501 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:59:55,501 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:59:55,501 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [447967678] [2019-12-27 21:59:55,502 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:59:55,504 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:59:55,506 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 15 states and 14 transitions. [2019-12-27 21:59:55,506 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:59:55,507 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:59:55,507 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:59:55,507 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:59:55,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:59:55,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:59:55,508 INFO L87 Difference]: Start difference. First operand 12015 states and 37536 transitions. Second operand 4 states. [2019-12-27 21:59:55,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:59:55,755 INFO L93 Difference]: Finished difference Result 14164 states and 44146 transitions. [2019-12-27 21:59:55,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:59:55,756 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 21:59:55,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:59:55,807 INFO L225 Difference]: With dead ends: 14164 [2019-12-27 21:59:55,807 INFO L226 Difference]: Without dead ends: 14164 [2019-12-27 21:59:55,808 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:59:55,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14164 states. [2019-12-27 21:59:56,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14164 to 12676. [2019-12-27 21:59:56,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12676 states. [2019-12-27 21:59:56,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12676 states to 12676 states and 39720 transitions. [2019-12-27 21:59:56,426 INFO L78 Accepts]: Start accepts. Automaton has 12676 states and 39720 transitions. Word has length 14 [2019-12-27 21:59:56,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:59:56,427 INFO L462 AbstractCegarLoop]: Abstraction has 12676 states and 39720 transitions. [2019-12-27 21:59:56,427 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:59:56,427 INFO L276 IsEmpty]: Start isEmpty. Operand 12676 states and 39720 transitions. [2019-12-27 21:59:56,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 21:59:56,431 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:59:56,431 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:59:56,431 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:59:56,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:59:56,432 INFO L82 PathProgramCache]: Analyzing trace with hash 1838903681, now seen corresponding path program 1 times [2019-12-27 21:59:56,432 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:59:56,432 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140469392] [2019-12-27 21:59:56,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:59:56,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:59:56,477 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 21:59:56,477 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140469392] [2019-12-27 21:59:56,477 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:59:56,478 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 21:59:56,478 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [867348080] [2019-12-27 21:59:56,478 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:59:56,483 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:59:56,486 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 20 states and 22 transitions. [2019-12-27 21:59:56,486 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:59:56,487 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:59:56,488 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:59:56,488 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:59:56,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:59:56,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:59:56,489 INFO L87 Difference]: Start difference. First operand 12676 states and 39720 transitions. Second operand 3 states. [2019-12-27 21:59:56,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:59:56,553 INFO L93 Difference]: Finished difference Result 12673 states and 39711 transitions. [2019-12-27 21:59:56,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:59:56,553 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-27 21:59:56,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:59:56,586 INFO L225 Difference]: With dead ends: 12673 [2019-12-27 21:59:56,586 INFO L226 Difference]: Without dead ends: 12673 [2019-12-27 21:59:56,587 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 21:59:56,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12673 states. [2019-12-27 21:59:57,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12673 to 12673. [2019-12-27 21:59:57,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12673 states. [2019-12-27 21:59:57,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12673 states to 12673 states and 39711 transitions. [2019-12-27 21:59:57,148 INFO L78 Accepts]: Start accepts. Automaton has 12673 states and 39711 transitions. Word has length 16 [2019-12-27 21:59:57,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:59:57,149 INFO L462 AbstractCegarLoop]: Abstraction has 12673 states and 39711 transitions. [2019-12-27 21:59:57,149 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:59:57,149 INFO L276 IsEmpty]: Start isEmpty. Operand 12673 states and 39711 transitions. [2019-12-27 21:59:57,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 21:59:57,154 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:59:57,154 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:59:57,154 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:59:57,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:59:57,154 INFO L82 PathProgramCache]: Analyzing trace with hash -601685409, now seen corresponding path program 1 times [2019-12-27 21:59:57,155 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:59:57,155 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502750051] [2019-12-27 21:59:57,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:59:57,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:59:57,235 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 21:59:57,236 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502750051] [2019-12-27 21:59:57,236 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:59:57,236 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:59:57,236 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1274671036] [2019-12-27 21:59:57,237 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:59:57,239 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:59:57,242 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 37 transitions. [2019-12-27 21:59:57,242 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:59:57,243 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:59:57,244 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:59:57,244 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:59:57,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:59:57,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:59:57,245 INFO L87 Difference]: Start difference. First operand 12673 states and 39711 transitions. Second operand 3 states. [2019-12-27 21:59:57,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:59:57,357 INFO L93 Difference]: Finished difference Result 21543 states and 67050 transitions. [2019-12-27 21:59:57,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:59:57,358 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-27 21:59:57,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:59:57,387 INFO L225 Difference]: With dead ends: 21543 [2019-12-27 21:59:57,388 INFO L226 Difference]: Without dead ends: 12171 [2019-12-27 21:59:57,388 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 21:59:57,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12171 states. [2019-12-27 21:59:57,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12171 to 11475. [2019-12-27 21:59:57,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11475 states. [2019-12-27 21:59:57,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11475 states to 11475 states and 34983 transitions. [2019-12-27 21:59:57,762 INFO L78 Accepts]: Start accepts. Automaton has 11475 states and 34983 transitions. Word has length 17 [2019-12-27 21:59:57,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:59:57,763 INFO L462 AbstractCegarLoop]: Abstraction has 11475 states and 34983 transitions. [2019-12-27 21:59:57,763 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:59:57,763 INFO L276 IsEmpty]: Start isEmpty. Operand 11475 states and 34983 transitions. [2019-12-27 21:59:57,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 21:59:57,769 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:59:57,769 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:59:57,770 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:59:57,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:59:57,770 INFO L82 PathProgramCache]: Analyzing trace with hash 1176802527, now seen corresponding path program 1 times [2019-12-27 21:59:57,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:59:57,771 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423476795] [2019-12-27 21:59:57,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:59:57,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:59:57,857 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 21:59:57,858 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423476795] [2019-12-27 21:59:57,858 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:59:57,858 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:59:57,859 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [954000591] [2019-12-27 21:59:57,859 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:59:57,862 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:59:57,866 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 37 transitions. [2019-12-27 21:59:57,866 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:59:57,871 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 21:59:57,872 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:59:57,872 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:59:57,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:59:57,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:59:57,873 INFO L87 Difference]: Start difference. First operand 11475 states and 34983 transitions. Second operand 4 states. [2019-12-27 21:59:58,059 WARN L192 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-12-27 21:59:58,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:59:58,091 INFO L93 Difference]: Finished difference Result 1920 states and 4675 transitions. [2019-12-27 21:59:58,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 21:59:58,092 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-27 21:59:58,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:59:58,096 INFO L225 Difference]: With dead ends: 1920 [2019-12-27 21:59:58,096 INFO L226 Difference]: Without dead ends: 1382 [2019-12-27 21:59:58,098 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:59:58,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1382 states. [2019-12-27 21:59:58,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1382 to 1378. [2019-12-27 21:59:58,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1378 states. [2019-12-27 21:59:58,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1378 states to 1378 states and 3017 transitions. [2019-12-27 21:59:58,124 INFO L78 Accepts]: Start accepts. Automaton has 1378 states and 3017 transitions. Word has length 17 [2019-12-27 21:59:58,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:59:58,124 INFO L462 AbstractCegarLoop]: Abstraction has 1378 states and 3017 transitions. [2019-12-27 21:59:58,124 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:59:58,124 INFO L276 IsEmpty]: Start isEmpty. Operand 1378 states and 3017 transitions. [2019-12-27 21:59:58,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 21:59:58,127 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:59:58,127 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:59:58,127 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:59:58,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:59:58,127 INFO L82 PathProgramCache]: Analyzing trace with hash -2091906228, now seen corresponding path program 1 times [2019-12-27 21:59:58,128 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:59:58,128 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371379185] [2019-12-27 21:59:58,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:59:58,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:59:58,282 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 21:59:58,282 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371379185] [2019-12-27 21:59:58,282 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:59:58,283 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:59:58,283 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [36707421] [2019-12-27 21:59:58,283 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:59:58,291 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:59:58,299 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 21:59:58,299 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:59:58,299 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:59:58,300 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 21:59:58,300 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:59:58,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 21:59:58,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:59:58,301 INFO L87 Difference]: Start difference. First operand 1378 states and 3017 transitions. Second operand 6 states. [2019-12-27 21:59:58,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:59:58,804 INFO L93 Difference]: Finished difference Result 3860 states and 8328 transitions. [2019-12-27 21:59:58,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 21:59:58,805 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-27 21:59:58,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:59:58,813 INFO L225 Difference]: With dead ends: 3860 [2019-12-27 21:59:58,813 INFO L226 Difference]: Without dead ends: 3825 [2019-12-27 21:59:58,814 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-27 21:59:58,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3825 states. [2019-12-27 21:59:58,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3825 to 2035. [2019-12-27 21:59:58,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2035 states. [2019-12-27 21:59:58,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2035 states to 2035 states and 4502 transitions. [2019-12-27 21:59:58,862 INFO L78 Accepts]: Start accepts. Automaton has 2035 states and 4502 transitions. Word has length 25 [2019-12-27 21:59:58,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:59:58,863 INFO L462 AbstractCegarLoop]: Abstraction has 2035 states and 4502 transitions. [2019-12-27 21:59:58,863 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 21:59:58,863 INFO L276 IsEmpty]: Start isEmpty. Operand 2035 states and 4502 transitions. [2019-12-27 21:59:58,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 21:59:58,866 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:59:58,866 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 21:59:58,866 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:59:58,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:59:58,867 INFO L82 PathProgramCache]: Analyzing trace with hash -1541096581, now seen corresponding path program 1 times [2019-12-27 21:59:58,867 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:59:58,867 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833442327] [2019-12-27 21:59:58,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:59:58,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:59:58,983 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 21:59:58,983 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833442327] [2019-12-27 21:59:58,984 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:59:58,984 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:59:58,984 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1636001211] [2019-12-27 21:59:58,984 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:59:58,991 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:59:58,997 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 27 states and 26 transitions. [2019-12-27 21:59:58,997 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:59:58,998 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:59:58,998 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 21:59:58,998 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:59:58,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 21:59:58,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:59:58,999 INFO L87 Difference]: Start difference. First operand 2035 states and 4502 transitions. Second operand 6 states. [2019-12-27 21:59:59,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:59:59,424 INFO L93 Difference]: Finished difference Result 3781 states and 8072 transitions. [2019-12-27 21:59:59,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 21:59:59,424 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-12-27 21:59:59,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:59:59,433 INFO L225 Difference]: With dead ends: 3781 [2019-12-27 21:59:59,433 INFO L226 Difference]: Without dead ends: 3752 [2019-12-27 21:59:59,433 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-27 21:59:59,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3752 states. [2019-12-27 21:59:59,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3752 to 2007. [2019-12-27 21:59:59,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2007 states. [2019-12-27 21:59:59,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2007 states to 2007 states and 4455 transitions. [2019-12-27 21:59:59,478 INFO L78 Accepts]: Start accepts. Automaton has 2007 states and 4455 transitions. Word has length 26 [2019-12-27 21:59:59,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:59:59,479 INFO L462 AbstractCegarLoop]: Abstraction has 2007 states and 4455 transitions. [2019-12-27 21:59:59,479 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 21:59:59,479 INFO L276 IsEmpty]: Start isEmpty. Operand 2007 states and 4455 transitions. [2019-12-27 21:59:59,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 21:59:59,481 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:59:59,482 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 21:59:59,482 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:59:59,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:59:59,482 INFO L82 PathProgramCache]: Analyzing trace with hash 1268776575, now seen corresponding path program 1 times [2019-12-27 21:59:59,483 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:59:59,483 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484419420] [2019-12-27 21:59:59,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:59:59,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:59:59,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:59:59,549 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484419420] [2019-12-27 21:59:59,549 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:59:59,550 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:59:59,550 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1757449892] [2019-12-27 21:59:59,550 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:59:59,554 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:59:59,565 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 59 states and 89 transitions. [2019-12-27 21:59:59,565 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:59:59,624 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 21:59:59,625 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 21:59:59,625 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:59:59,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 21:59:59,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:59:59,626 INFO L87 Difference]: Start difference. First operand 2007 states and 4455 transitions. Second operand 6 states. [2019-12-27 21:59:59,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:59:59,682 INFO L93 Difference]: Finished difference Result 1067 states and 2242 transitions. [2019-12-27 21:59:59,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:59:59,683 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 21:59:59,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:59:59,686 INFO L225 Difference]: With dead ends: 1067 [2019-12-27 21:59:59,686 INFO L226 Difference]: Without dead ends: 862 [2019-12-27 21:59:59,687 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-12-27 21:59:59,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 862 states. [2019-12-27 21:59:59,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 862 to 828. [2019-12-27 21:59:59,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 828 states. [2019-12-27 21:59:59,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 1806 transitions. [2019-12-27 21:59:59,700 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 1806 transitions. Word has length 27 [2019-12-27 21:59:59,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:59:59,701 INFO L462 AbstractCegarLoop]: Abstraction has 828 states and 1806 transitions. [2019-12-27 21:59:59,701 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 21:59:59,701 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1806 transitions. [2019-12-27 21:59:59,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 21:59:59,705 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:59:59,706 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 21:59:59,706 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:59:59,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:59:59,706 INFO L82 PathProgramCache]: Analyzing trace with hash 1725794524, now seen corresponding path program 1 times [2019-12-27 21:59:59,707 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:59:59,707 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29124481] [2019-12-27 21:59:59,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:59:59,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:59:59,832 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 21:59:59,832 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29124481] [2019-12-27 21:59:59,833 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:59:59,833 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:59:59,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1264603040] [2019-12-27 21:59:59,834 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:59:59,858 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:00:00,069 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 103 states and 152 transitions. [2019-12-27 22:00:00,070 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:00:00,177 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 22:00:00,178 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 22:00:00,178 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:00:00,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 22:00:00,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 22:00:00,179 INFO L87 Difference]: Start difference. First operand 828 states and 1806 transitions. Second operand 8 states. [2019-12-27 22:00:00,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:00:00,457 INFO L93 Difference]: Finished difference Result 1705 states and 3607 transitions. [2019-12-27 22:00:00,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 22:00:00,457 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2019-12-27 22:00:00,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:00:00,460 INFO L225 Difference]: With dead ends: 1705 [2019-12-27 22:00:00,460 INFO L226 Difference]: Without dead ends: 1136 [2019-12-27 22:00:00,461 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-12-27 22:00:00,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1136 states. [2019-12-27 22:00:00,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1136 to 903. [2019-12-27 22:00:00,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 903 states. [2019-12-27 22:00:00,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 903 states to 903 states and 1931 transitions. [2019-12-27 22:00:00,476 INFO L78 Accepts]: Start accepts. Automaton has 903 states and 1931 transitions. Word has length 51 [2019-12-27 22:00:00,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:00:00,476 INFO L462 AbstractCegarLoop]: Abstraction has 903 states and 1931 transitions. [2019-12-27 22:00:00,476 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 22:00:00,476 INFO L276 IsEmpty]: Start isEmpty. Operand 903 states and 1931 transitions. [2019-12-27 22:00:00,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 22:00:00,479 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:00:00,479 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 22:00:00,480 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:00:00,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:00:00,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1701166622, now seen corresponding path program 2 times [2019-12-27 22:00:00,481 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:00:00,481 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051297091] [2019-12-27 22:00:00,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:00:00,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:00:00,598 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 22:00:00,598 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051297091] [2019-12-27 22:00:00,599 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:00:00,599 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:00:00,599 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1651150644] [2019-12-27 22:00:00,599 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:00:00,613 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:00:00,681 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 109 states and 157 transitions. [2019-12-27 22:00:00,681 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:00:00,688 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 22:00:00,688 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:00:00,688 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:00:00,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:00:00,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:00:00,689 INFO L87 Difference]: Start difference. First operand 903 states and 1931 transitions. Second operand 3 states. [2019-12-27 22:00:00,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:00:00,750 INFO L93 Difference]: Finished difference Result 1183 states and 2500 transitions. [2019-12-27 22:00:00,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:00:00,751 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-27 22:00:00,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:00:00,754 INFO L225 Difference]: With dead ends: 1183 [2019-12-27 22:00:00,754 INFO L226 Difference]: Without dead ends: 1183 [2019-12-27 22:00:00,755 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:00:00,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states. [2019-12-27 22:00:00,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 993. [2019-12-27 22:00:00,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 993 states. [2019-12-27 22:00:00,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 993 states to 993 states and 2127 transitions. [2019-12-27 22:00:00,773 INFO L78 Accepts]: Start accepts. Automaton has 993 states and 2127 transitions. Word has length 51 [2019-12-27 22:00:00,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:00:00,773 INFO L462 AbstractCegarLoop]: Abstraction has 993 states and 2127 transitions. [2019-12-27 22:00:00,773 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:00:00,773 INFO L276 IsEmpty]: Start isEmpty. Operand 993 states and 2127 transitions. [2019-12-27 22:00:00,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 22:00:00,776 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:00:00,776 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 22:00:00,776 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:00:00,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:00:00,777 INFO L82 PathProgramCache]: Analyzing trace with hash 1213233403, now seen corresponding path program 1 times [2019-12-27 22:00:00,777 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:00:00,777 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947281501] [2019-12-27 22:00:00,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:00:00,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:00:00,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:00:00,821 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947281501] [2019-12-27 22:00:00,821 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:00:00,821 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:00:00,822 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2124184764] [2019-12-27 22:00:00,822 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:00:00,842 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:00:01,240 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 111 states and 160 transitions. [2019-12-27 22:00:01,240 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:00:01,243 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:00:01,243 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:00:01,243 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:00:01,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:00:01,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:00:01,245 INFO L87 Difference]: Start difference. First operand 993 states and 2127 transitions. Second operand 3 states. [2019-12-27 22:00:01,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:00:01,284 INFO L93 Difference]: Finished difference Result 1082 states and 2252 transitions. [2019-12-27 22:00:01,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:00:01,285 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 22:00:01,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:00:01,288 INFO L225 Difference]: With dead ends: 1082 [2019-12-27 22:00:01,288 INFO L226 Difference]: Without dead ends: 1082 [2019-12-27 22:00:01,288 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:00:01,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1082 states. [2019-12-27 22:00:01,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1082 to 930. [2019-12-27 22:00:01,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 930 states. [2019-12-27 22:00:01,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 930 states and 1974 transitions. [2019-12-27 22:00:01,306 INFO L78 Accepts]: Start accepts. Automaton has 930 states and 1974 transitions. Word has length 52 [2019-12-27 22:00:01,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:00:01,307 INFO L462 AbstractCegarLoop]: Abstraction has 930 states and 1974 transitions. [2019-12-27 22:00:01,307 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:00:01,307 INFO L276 IsEmpty]: Start isEmpty. Operand 930 states and 1974 transitions. [2019-12-27 22:00:01,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 22:00:01,311 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:00:01,311 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 22:00:01,312 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:00:01,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:00:01,313 INFO L82 PathProgramCache]: Analyzing trace with hash 105545405, now seen corresponding path program 1 times [2019-12-27 22:00:01,314 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:00:01,314 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868191559] [2019-12-27 22:00:01,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:00:01,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:00:01,503 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 22:00:01,504 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868191559] [2019-12-27 22:00:01,504 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:00:01,504 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 22:00:01,505 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [186916086] [2019-12-27 22:00:01,505 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:00:01,520 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:00:01,600 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 113 states and 164 transitions. [2019-12-27 22:00:01,600 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:00:01,643 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 22:00:01,643 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 22:00:01,644 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:00:01,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 22:00:01,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 22:00:01,644 INFO L87 Difference]: Start difference. First operand 930 states and 1974 transitions. Second operand 8 states. [2019-12-27 22:00:02,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:00:02,693 INFO L93 Difference]: Finished difference Result 1907 states and 3937 transitions. [2019-12-27 22:00:02,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 22:00:02,693 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2019-12-27 22:00:02,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:00:02,697 INFO L225 Difference]: With dead ends: 1907 [2019-12-27 22:00:02,697 INFO L226 Difference]: Without dead ends: 1883 [2019-12-27 22:00:02,697 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-12-27 22:00:02,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1883 states. [2019-12-27 22:00:02,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1883 to 1278. [2019-12-27 22:00:02,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1278 states. [2019-12-27 22:00:02,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1278 states to 1278 states and 2714 transitions. [2019-12-27 22:00:02,721 INFO L78 Accepts]: Start accepts. Automaton has 1278 states and 2714 transitions. Word has length 52 [2019-12-27 22:00:02,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:00:02,721 INFO L462 AbstractCegarLoop]: Abstraction has 1278 states and 2714 transitions. [2019-12-27 22:00:02,722 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 22:00:02,722 INFO L276 IsEmpty]: Start isEmpty. Operand 1278 states and 2714 transitions. [2019-12-27 22:00:02,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 22:00:02,725 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:00:02,725 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 22:00:02,725 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:00:02,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:00:02,725 INFO L82 PathProgramCache]: Analyzing trace with hash 926927619, now seen corresponding path program 2 times [2019-12-27 22:00:02,726 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:00:02,726 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002443341] [2019-12-27 22:00:02,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:00:02,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:00:02,787 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 22:00:02,787 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002443341] [2019-12-27 22:00:02,788 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:00:02,788 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:00:02,788 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [4567177] [2019-12-27 22:00:02,788 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:00:02,806 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:00:02,881 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 96 states and 120 transitions. [2019-12-27 22:00:02,882 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:00:02,882 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:00:02,883 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:00:02,883 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:00:02,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:00:02,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:00:02,884 INFO L87 Difference]: Start difference. First operand 1278 states and 2714 transitions. Second operand 3 states. [2019-12-27 22:00:02,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:00:02,901 INFO L93 Difference]: Finished difference Result 1277 states and 2712 transitions. [2019-12-27 22:00:02,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:00:02,902 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 22:00:02,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:00:02,903 INFO L225 Difference]: With dead ends: 1277 [2019-12-27 22:00:02,904 INFO L226 Difference]: Without dead ends: 1277 [2019-12-27 22:00:02,904 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 22:00:02,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1277 states. [2019-12-27 22:00:02,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1277 to 848. [2019-12-27 22:00:02,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 848 states. [2019-12-27 22:00:02,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 848 states to 848 states and 1812 transitions. [2019-12-27 22:00:02,921 INFO L78 Accepts]: Start accepts. Automaton has 848 states and 1812 transitions. Word has length 52 [2019-12-27 22:00:02,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:00:02,921 INFO L462 AbstractCegarLoop]: Abstraction has 848 states and 1812 transitions. [2019-12-27 22:00:02,921 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:00:02,921 INFO L276 IsEmpty]: Start isEmpty. Operand 848 states and 1812 transitions. [2019-12-27 22:00:02,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 22:00:02,924 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:00:02,924 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 22:00:02,924 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:00:02,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:00:02,924 INFO L82 PathProgramCache]: Analyzing trace with hash -616115185, now seen corresponding path program 1 times [2019-12-27 22:00:02,925 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:00:02,925 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725926216] [2019-12-27 22:00:02,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:00:02,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 22:00:02,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 22:00:03,026 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 22:00:03,026 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 22:00:03,030 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] ULTIMATE.startENTRY-->L797: Formula: (let ((.cse0 (store |v_#valid_45| 0 0))) (and (= 0 v_~weak$$choice0~0_8) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1715~0.base_22|)) (= v_~main$tmp_guard1~0_16 0) (= 0 v_~__unbuffered_cnt~0_15) (= v_~main$tmp_guard0~0_9 0) (= 0 v_~x$w_buff1~0_25) (= 0 v_~__unbuffered_p1_EAX~0_12) (= |v_#NULL.offset_6| 0) (= 0 v_~x$r_buff0_thd1~0_28) (= 0 v_~x$r_buff0_thd0~0_22) (= 0 v_~x$r_buff0_thd2~0_76) (= v_~x~0_24 0) (= v_~x$flush_delayed~0_13 0) (= v_~x$w_buff1_used~0_67 0) (= 0 v_~x$read_delayed_var~0.base_7) (= v_~x$r_buff1_thd1~0_18 0) (= |v_#valid_43| (store .cse0 |v_ULTIMATE.start_main_~#t1715~0.base_22| 1)) (= 0 v_~x$w_buff0~0_25) (= 0 |v_ULTIMATE.start_main_~#t1715~0.offset_17|) (= v_~y~0_15 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1715~0.base_22|) (= 0 |v_#NULL.base_6|) (= 0 v_~weak$$choice2~0_33) (= v_~x$r_buff1_thd2~0_51 0) (= 0 v_~x$read_delayed~0_7) (= v_~x$mem_tmp~0_10 0) (= 0 v_~x$w_buff0_used~0_102) (= 0 v_~x$read_delayed_var~0.offset_7) (= v_~__unbuffered_p1_EBX~0_13 0) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t1715~0.base_22| 4) |v_#length_13|) (= v_~x$r_buff1_thd0~0_19 0) (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1715~0.base_22| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1715~0.base_22|) |v_ULTIMATE.start_main_~#t1715~0.offset_17| 0))) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_14|, #length=|v_#length_14|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_25, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_28, ~x$flush_delayed~0=v_~x$flush_delayed~0_13, #NULL.offset=|v_#NULL.offset_6|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_18, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~x$mem_tmp~0=v_~x$mem_tmp~0_10, 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_17|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_10|, ULTIMATE.start_main_~#t1715~0.offset=|v_ULTIMATE.start_main_~#t1715~0.offset_17|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_12, #length=|v_#length_13|, ~y~0=v_~y~0_15, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_22, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_13, ULTIMATE.start_main_~#t1716~0.offset=|v_ULTIMATE.start_main_~#t1716~0.offset_14|, ~x$w_buff1~0=v_~x$w_buff1~0_25, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_67, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_51, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_19, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_76, ULTIMATE.start_main_~#t1716~0.base=|v_ULTIMATE.start_main_~#t1716~0.base_16|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, #NULL.base=|v_#NULL.base_6|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_102, ~weak$$choice0~0=v_~weak$$choice0~0_8, ULTIMATE.start_main_~#t1715~0.base=|v_ULTIMATE.start_main_~#t1715~0.base_22|, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_12|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_7|, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~x~0=v_~x~0_24, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t1715~0.offset, ~__unbuffered_p1_EAX~0, #length, ~y~0, ~x$r_buff0_thd0~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_~#t1716~0.offset, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_~#t1716~0.base, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_~#t1715~0.base, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 22:00:03,032 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L4-->L738: Formula: (and (= v_~x$r_buff1_thd2~0_33 v_~x$r_buff0_thd2~0_56) (= v_~x$r_buff1_thd1~0_11 v_~x$r_buff0_thd1~0_17) (= v_~x$r_buff1_thd0~0_11 v_~x$r_buff0_thd0~0_14) (= 1 v_~y~0_5) (not (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_6 0)) (= 1 v_~x$r_buff0_thd1~0_16)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_14, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_17, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_6, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_56} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_14, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_16, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_6, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_33, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_11, ~y~0=v_~y~0_5, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_56, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_11} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 22:00:03,033 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L797-1-->L799: Formula: (and (not (= |v_ULTIMATE.start_main_~#t1716~0.base_12| 0)) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1716~0.base_12|)) (= 0 |v_ULTIMATE.start_main_~#t1716~0.offset_10|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1716~0.base_12|) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t1716~0.base_12| 4)) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1716~0.base_12| 1)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1716~0.base_12| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1716~0.base_12|) |v_ULTIMATE.start_main_~#t1716~0.offset_10| 1)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t1716~0.offset=|v_ULTIMATE.start_main_~#t1716~0.offset_10|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, #length=|v_#length_9|, ULTIMATE.start_main_~#t1716~0.base=|v_ULTIMATE.start_main_~#t1716~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1716~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t1716~0.base] because there is no mapped edge [2019-12-27 22:00:03,035 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L739-->L739-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In-1531950247 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1531950247 256)))) (or (and (= ~x$w_buff0_used~0_In-1531950247 |P0Thread1of1ForFork0_#t~ite5_Out-1531950247|) (or .cse0 .cse1)) (and (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-1531950247|) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1531950247, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1531950247} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1531950247|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1531950247, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1531950247} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 22:00:03,036 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L763-->L763-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1889264711 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite14_Out-1889264711| ~x$w_buff0~0_In-1889264711) .cse0 (= |P1Thread1of1ForFork1_#t~ite15_Out-1889264711| |P1Thread1of1ForFork1_#t~ite14_Out-1889264711|) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-1889264711 256)))) (or (and (= 0 (mod ~x$r_buff1_thd2~0_In-1889264711 256)) .cse1) (= 0 (mod ~x$w_buff0_used~0_In-1889264711 256)) (and (= (mod ~x$w_buff1_used~0_In-1889264711 256) 0) .cse1)))) (and (= |P1Thread1of1ForFork1_#t~ite15_Out-1889264711| ~x$w_buff0~0_In-1889264711) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite14_In-1889264711| |P1Thread1of1ForFork1_#t~ite14_Out-1889264711|)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-1889264711, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1889264711, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1889264711, ~weak$$choice2~0=~weak$$choice2~0_In-1889264711, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1889264711, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In-1889264711|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1889264711} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-1889264711, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1889264711, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1889264711, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out-1889264711|, ~weak$$choice2~0=~weak$$choice2~0_In-1889264711, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1889264711, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-1889264711|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1889264711} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 22:00:03,037 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L764-->L764-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-257883489 256)))) (or (and (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-257883489 256)))) (or (= (mod ~x$w_buff0_used~0_In-257883489 256) 0) (and .cse0 (= 0 (mod ~x$r_buff1_thd2~0_In-257883489 256))) (and .cse0 (= (mod ~x$w_buff1_used~0_In-257883489 256) 0)))) (= ~x$w_buff1~0_In-257883489 |P1Thread1of1ForFork1_#t~ite17_Out-257883489|) (= |P1Thread1of1ForFork1_#t~ite17_Out-257883489| |P1Thread1of1ForFork1_#t~ite18_Out-257883489|) .cse1) (and (not .cse1) (= ~x$w_buff1~0_In-257883489 |P1Thread1of1ForFork1_#t~ite18_Out-257883489|) (= |P1Thread1of1ForFork1_#t~ite17_In-257883489| |P1Thread1of1ForFork1_#t~ite17_Out-257883489|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-257883489, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-257883489, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-257883489, ~weak$$choice2~0=~weak$$choice2~0_In-257883489, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-257883489, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_In-257883489|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-257883489} OutVars{P1Thread1of1ForFork1_#t~ite18=|P1Thread1of1ForFork1_#t~ite18_Out-257883489|, ~x$w_buff1~0=~x$w_buff1~0_In-257883489, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-257883489, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-257883489, ~weak$$choice2~0=~weak$$choice2~0_In-257883489, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-257883489, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_Out-257883489|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-257883489} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite18, P1Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-12-27 22:00:03,038 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L765-->L765-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1081887766 256) 0))) (or (and (= ~x$w_buff0_used~0_In-1081887766 |P1Thread1of1ForFork1_#t~ite20_Out-1081887766|) (= |P1Thread1of1ForFork1_#t~ite21_Out-1081887766| |P1Thread1of1ForFork1_#t~ite20_Out-1081887766|) .cse0 (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In-1081887766 256) 0))) (or (= (mod ~x$w_buff0_used~0_In-1081887766 256) 0) (and (= (mod ~x$r_buff1_thd2~0_In-1081887766 256) 0) .cse1) (and .cse1 (= (mod ~x$w_buff1_used~0_In-1081887766 256) 0))))) (and (not .cse0) (= ~x$w_buff0_used~0_In-1081887766 |P1Thread1of1ForFork1_#t~ite21_Out-1081887766|) (= |P1Thread1of1ForFork1_#t~ite20_In-1081887766| |P1Thread1of1ForFork1_#t~ite20_Out-1081887766|)))) InVars {P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In-1081887766|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1081887766, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1081887766, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1081887766, ~weak$$choice2~0=~weak$$choice2~0_In-1081887766, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1081887766} OutVars{P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out-1081887766|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1081887766, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1081887766, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out-1081887766|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1081887766, ~weak$$choice2~0=~weak$$choice2~0_In-1081887766, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1081887766} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-27 22:00:03,040 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L740-->L740-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd1~0_In-83915088 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-83915088 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd1~0_In-83915088 256))) (.cse3 (= (mod ~x$w_buff0_used~0_In-83915088 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-83915088|)) (and (= ~x$w_buff1_used~0_In-83915088 |P0Thread1of1ForFork0_#t~ite6_Out-83915088|) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-83915088, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-83915088, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-83915088, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-83915088} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-83915088|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-83915088, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-83915088, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-83915088, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-83915088} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 22:00:03,041 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L741-->L742: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-1992061363 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd1~0_In-1992061363 256) 0))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd1~0_In-1992061363 ~x$r_buff0_thd1~0_Out-1992061363)) (and (not .cse0) (= 0 ~x$r_buff0_thd1~0_Out-1992061363) (not .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1992061363, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1992061363} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_Out-1992061363, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1992061363|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1992061363} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-27 22:00:03,041 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L742-->L742-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In983477462 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd1~0_In983477462 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In983477462 256) 0)) (.cse3 (= 0 (mod ~x$r_buff0_thd1~0_In983477462 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$r_buff1_thd1~0_In983477462 |P0Thread1of1ForFork0_#t~ite8_Out983477462|)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out983477462|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In983477462, ~x$w_buff1_used~0=~x$w_buff1_used~0_In983477462, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In983477462, ~x$w_buff0_used~0=~x$w_buff0_used~0_In983477462} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In983477462, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out983477462|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In983477462, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In983477462, ~x$w_buff0_used~0=~x$w_buff0_used~0_In983477462} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 22:00:03,042 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [737] [737] L742-2-->P0EXIT: Formula: (and (= v_~x$r_buff1_thd1~0_15 |v_P0Thread1of1ForFork0_#t~ite8_8|) (= v_~__unbuffered_cnt~0_7 (+ v_~__unbuffered_cnt~0_8 1)) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8} OutVars{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_7, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_15} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-12-27 22:00:03,042 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L767-->L768: Formula: (and (not (= (mod v_~weak$$choice2~0_19 256) 0)) (= v_~x$r_buff0_thd2~0_60 v_~x$r_buff0_thd2~0_59)) InVars {~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_60, ~weak$$choice2~0=v_~weak$$choice2~0_19} OutVars{P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_9|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_59, ~weak$$choice2~0=v_~weak$$choice2~0_19, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_8|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_9|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite27, ~x$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-27 22:00:03,042 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L768-->L768-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-288936215 256)))) (or (and (= ~x$r_buff1_thd2~0_In-288936215 |P1Thread1of1ForFork1_#t~ite29_Out-288936215|) (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-288936215 256)))) (or (and .cse0 (= (mod ~x$r_buff1_thd2~0_In-288936215 256) 0)) (and .cse0 (= (mod ~x$w_buff1_used~0_In-288936215 256) 0)) (= 0 (mod ~x$w_buff0_used~0_In-288936215 256)))) .cse1 (= |P1Thread1of1ForFork1_#t~ite30_Out-288936215| |P1Thread1of1ForFork1_#t~ite29_Out-288936215|)) (and (= ~x$r_buff1_thd2~0_In-288936215 |P1Thread1of1ForFork1_#t~ite30_Out-288936215|) (= |P1Thread1of1ForFork1_#t~ite29_In-288936215| |P1Thread1of1ForFork1_#t~ite29_Out-288936215|) (not .cse1)))) InVars {P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In-288936215|, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-288936215, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-288936215, ~weak$$choice2~0=~weak$$choice2~0_In-288936215, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-288936215, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-288936215} OutVars{P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-288936215|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-288936215|, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-288936215, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-288936215, ~weak$$choice2~0=~weak$$choice2~0_In-288936215, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-288936215, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-288936215} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-27 22:00:03,043 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [651] [651] L770-->L774: Formula: (and (= 0 v_~x$flush_delayed~0_7) (not (= 0 (mod v_~x$flush_delayed~0_8 256))) (= v_~x$mem_tmp~0_5 v_~x~0_14)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_8, ~x$mem_tmp~0=v_~x$mem_tmp~0_5} OutVars{~x$flush_delayed~0=v_~x$flush_delayed~0_7, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~x$mem_tmp~0=v_~x$mem_tmp~0_5, ~x~0=v_~x~0_14} AuxVars[] AssignedVars[~x$flush_delayed~0, P1Thread1of1ForFork1_#t~ite31, ~x~0] because there is no mapped edge [2019-12-27 22:00:03,043 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L774-2-->L774-4: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In-1727660151 256))) (.cse1 (= (mod ~x$r_buff1_thd2~0_In-1727660151 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite32_Out-1727660151| ~x~0_In-1727660151) (or .cse0 .cse1)) (and (= ~x$w_buff1~0_In-1727660151 |P1Thread1of1ForFork1_#t~ite32_Out-1727660151|) (not .cse0) (not .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1727660151, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1727660151, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1727660151, ~x~0=~x~0_In-1727660151} OutVars{~x$w_buff1~0=~x$w_buff1~0_In-1727660151, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1727660151, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1727660151, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-1727660151|, ~x~0=~x~0_In-1727660151} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-27 22:00:03,044 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L774-4-->L775: Formula: (= v_~x~0_16 |v_P1Thread1of1ForFork1_#t~ite32_8|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_8|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_7|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_7|, ~x~0=v_~x~0_16} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-27 22:00:03,044 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L775-->L775-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-692462134 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-692462134 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-692462134 |P1Thread1of1ForFork1_#t~ite34_Out-692462134|)) (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite34_Out-692462134| 0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-692462134, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-692462134} OutVars{P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-692462134|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-692462134, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-692462134} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 22:00:03,045 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L776-->L776-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In1591954590 256))) (.cse3 (= (mod ~x$w_buff0_used~0_In1591954590 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In1591954590 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In1591954590 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite35_Out1591954590|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~x$w_buff1_used~0_In1591954590 |P1Thread1of1ForFork1_#t~ite35_Out1591954590|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1591954590, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1591954590, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1591954590, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1591954590} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1591954590, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1591954590, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out1591954590|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1591954590, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1591954590} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 22:00:03,045 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L777-->L777-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1610782569 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-1610782569 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite36_Out-1610782569| ~x$r_buff0_thd2~0_In-1610782569) (or .cse0 .cse1)) (and (= 0 |P1Thread1of1ForFork1_#t~ite36_Out-1610782569|) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1610782569, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1610782569} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1610782569, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-1610782569|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1610782569} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 22:00:03,046 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L778-->L778-2: Formula: (let ((.cse3 (= (mod ~x$r_buff1_thd2~0_In565125335 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In565125335 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In565125335 256))) (.cse0 (= (mod ~x$r_buff0_thd2~0_In565125335 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite37_Out565125335|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~x$r_buff1_thd2~0_In565125335 |P1Thread1of1ForFork1_#t~ite37_Out565125335|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In565125335, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In565125335, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In565125335, ~x$w_buff0_used~0=~x$w_buff0_used~0_In565125335} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In565125335, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In565125335, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In565125335, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out565125335|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In565125335} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 22:00:03,046 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L778-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~x$r_buff1_thd2~0_44 |v_P1Thread1of1ForFork1_#t~ite37_8|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_11 1) v_~__unbuffered_cnt~0_10)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_8|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_44, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 22:00:03,047 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L803-->L805-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (or (= (mod v_~x$w_buff0_used~0_83 256) 0) (= 0 (mod v_~x$r_buff0_thd0~0_17 256)))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_17, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_83} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_17, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_83} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 22:00:03,047 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L805-2-->L805-4: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd0~0_In1714968535 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In1714968535 256)))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out1714968535| ~x~0_In1714968535) (or .cse0 .cse1)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite40_Out1714968535| ~x$w_buff1~0_In1714968535) (not .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1714968535, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1714968535, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1714968535, ~x~0=~x~0_In1714968535} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1714968535|, ~x$w_buff1~0=~x$w_buff1~0_In1714968535, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1714968535, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1714968535, ~x~0=~x~0_In1714968535} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 22:00:03,047 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L805-4-->L806: Formula: (= v_~x~0_17 |v_ULTIMATE.start_main_#t~ite40_7|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_7|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_6|, ~x~0=v_~x~0_17} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~x~0] because there is no mapped edge [2019-12-27 22:00:03,048 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L806-->L806-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In2003104796 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In2003104796 256)))) (or (and (= |ULTIMATE.start_main_#t~ite42_Out2003104796| 0) (not .cse0) (not .cse1)) (and (= ~x$w_buff0_used~0_In2003104796 |ULTIMATE.start_main_#t~ite42_Out2003104796|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2003104796, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2003104796} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2003104796, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out2003104796|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2003104796} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 22:00:03,048 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L807-->L807-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-2004607668 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-2004607668 256))) (.cse3 (= 0 (mod ~x$r_buff1_thd0~0_In-2004607668 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-2004607668 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In-2004607668 |ULTIMATE.start_main_#t~ite43_Out-2004607668|)) (and (= 0 |ULTIMATE.start_main_#t~ite43_Out-2004607668|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2004607668, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2004607668, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2004607668, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2004607668} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2004607668, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2004607668, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-2004607668|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2004607668, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2004607668} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 22:00:03,049 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L808-->L808-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In970775526 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In970775526 256)))) (or (and (= |ULTIMATE.start_main_#t~ite44_Out970775526| 0) (not .cse0) (not .cse1)) (and (= ~x$r_buff0_thd0~0_In970775526 |ULTIMATE.start_main_#t~ite44_Out970775526|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In970775526, ~x$w_buff0_used~0=~x$w_buff0_used~0_In970775526} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In970775526, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out970775526|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In970775526} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 22:00:03,050 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L809-->L809-2: Formula: (let ((.cse2 (= (mod ~x$w_buff1_used~0_In-1218368053 256) 0)) (.cse3 (= (mod ~x$r_buff1_thd0~0_In-1218368053 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd0~0_In-1218368053 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1218368053 256)))) (or (and (= ~x$r_buff1_thd0~0_In-1218368053 |ULTIMATE.start_main_#t~ite45_Out-1218368053|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |ULTIMATE.start_main_#t~ite45_Out-1218368053|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1218368053, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1218368053, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1218368053, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1218368053} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1218368053, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1218368053, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1218368053, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1218368053|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1218368053} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 22:00:03,050 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L809-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 2 v_~__unbuffered_p1_EAX~0_9) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 0) (= v_~x$r_buff1_thd0~0_15 |v_ULTIMATE.start_main_#t~ite45_14|) (= v_~main$tmp_guard1~0_12 0) (= v_~__unbuffered_p1_EBX~0_10 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= v_~y~0_13 2)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_10, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_9, ~y~0=v_~y~0_13, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_14|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_10, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_9, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ~y~0=v_~y~0_13, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_15, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_13|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 22:00:03,121 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 10:00:03 BasicIcfg [2019-12-27 22:00:03,122 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 22:00:03,124 INFO L168 Benchmark]: Toolchain (without parser) took 17073.11 ms. Allocated memory was 138.4 MB in the beginning and 815.3 MB in the end (delta: 676.9 MB). Free memory was 100.6 MB in the beginning and 249.2 MB in the end (delta: -148.6 MB). Peak memory consumption was 528.2 MB. Max. memory is 7.1 GB. [2019-12-27 22:00:03,125 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 138.4 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 22:00:03,126 INFO L168 Benchmark]: CACSL2BoogieTranslator took 830.82 ms. Allocated memory was 138.4 MB in the beginning and 202.4 MB in the end (delta: 64.0 MB). Free memory was 100.1 MB in the beginning and 155.5 MB in the end (delta: -55.4 MB). Peak memory consumption was 24.3 MB. Max. memory is 7.1 GB. [2019-12-27 22:00:03,127 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.69 ms. Allocated memory is still 202.4 MB. Free memory was 155.5 MB in the beginning and 152.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 22:00:03,127 INFO L168 Benchmark]: Boogie Preprocessor took 46.42 ms. Allocated memory is still 202.4 MB. Free memory was 152.9 MB in the beginning and 150.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 22:00:03,128 INFO L168 Benchmark]: RCFGBuilder took 786.02 ms. Allocated memory is still 202.4 MB. Free memory was 150.9 MB in the beginning and 106.4 MB in the end (delta: 44.5 MB). Peak memory consumption was 44.5 MB. Max. memory is 7.1 GB. [2019-12-27 22:00:03,129 INFO L168 Benchmark]: TraceAbstraction took 15343.51 ms. Allocated memory was 202.4 MB in the beginning and 815.3 MB in the end (delta: 612.9 MB). Free memory was 106.4 MB in the beginning and 249.2 MB in the end (delta: -142.8 MB). Peak memory consumption was 470.1 MB. Max. memory is 7.1 GB. [2019-12-27 22:00:03,132 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.22 ms. Allocated memory is still 138.4 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 830.82 ms. Allocated memory was 138.4 MB in the beginning and 202.4 MB in the end (delta: 64.0 MB). Free memory was 100.1 MB in the beginning and 155.5 MB in the end (delta: -55.4 MB). Peak memory consumption was 24.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 60.69 ms. Allocated memory is still 202.4 MB. Free memory was 155.5 MB in the beginning and 152.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 46.42 ms. Allocated memory is still 202.4 MB. Free memory was 152.9 MB in the beginning and 150.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 786.02 ms. Allocated memory is still 202.4 MB. Free memory was 150.9 MB in the beginning and 106.4 MB in the end (delta: 44.5 MB). Peak memory consumption was 44.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 15343.51 ms. Allocated memory was 202.4 MB in the beginning and 815.3 MB in the end (delta: 612.9 MB). Free memory was 106.4 MB in the beginning and 249.2 MB in the end (delta: -142.8 MB). Peak memory consumption was 470.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.7s, 147 ProgramPointsBefore, 80 ProgramPointsAfterwards, 181 TransitionsBefore, 90 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 7 FixpointIterations, 29 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 27 ChoiceCompositions, 4527 VarBasedMoverChecksPositive, 162 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 50908 CheckedPairsTotal, 100 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L797] FCALL, FORK 0 pthread_create(&t1715, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L724] 1 x$w_buff1 = x$w_buff0 [L725] 1 x$w_buff0 = 1 [L726] 1 x$w_buff1_used = x$w_buff0_used [L727] 1 x$w_buff0_used = (_Bool)1 [L738] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L799] FCALL, FORK 0 pthread_create(&t1716, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L752] 2 y = 2 [L755] 2 __unbuffered_p1_EAX = y [L758] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L759] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L760] 2 x$flush_delayed = weak$$choice2 [L761] 2 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L762] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L738] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L762] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L763] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L764] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L765] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L766] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L766] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L739] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L740] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L768] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L769] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L774] 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L775] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L776] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L777] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L801] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L806] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L807] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L808] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 141 locations, 2 error locations. Result: UNSAFE, OverallTime: 15.0s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1781 SDtfs, 1919 SDslu, 3008 SDs, 0 SdLazy, 1915 SolverSat, 142 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 106 GetRequests, 32 SyntacticMatches, 12 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12676occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.3s AutomataMinimizationTime, 14 MinimizatonAttempts, 8740 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 467 NumberOfCodeBlocks, 467 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 400 ConstructedInterpolants, 0 QuantifiedInterpolants, 50868 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...