/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.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix056_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 06:58:06,714 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 06:58:06,717 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 06:58:06,729 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 06:58:06,729 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 06:58:06,730 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 06:58:06,732 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 06:58:06,733 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 06:58:06,735 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 06:58:06,736 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 06:58:06,737 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 06:58:06,738 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 06:58:06,738 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 06:58:06,739 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 06:58:06,743 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 06:58:06,744 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 06:58:06,745 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 06:58:06,746 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 06:58:06,749 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 06:58:06,752 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 06:58:06,755 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 06:58:06,757 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 06:58:06,758 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 06:58:06,759 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 06:58:06,765 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 06:58:06,765 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 06:58:06,765 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 06:58:06,767 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 06:58:06,768 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 06:58:06,770 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 06:58:06,770 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 06:58:06,771 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 06:58:06,771 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 06:58:06,773 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 06:58:06,775 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 06:58:06,776 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 06:58:06,776 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 06:58:06,777 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 06:58:06,777 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 06:58:06,779 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 06:58:06,781 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 06:58:06,781 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.epf [2019-12-27 06:58:06,809 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 06:58:06,809 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 06:58:06,811 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 06:58:06,812 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 06:58:06,812 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 06:58:06,812 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 06:58:06,812 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 06:58:06,813 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 06:58:06,813 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 06:58:06,813 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 06:58:06,814 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 06:58:06,814 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 06:58:06,814 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 06:58:06,815 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 06:58:06,815 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 06:58:06,815 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 06:58:06,815 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 06:58:06,815 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 06:58:06,816 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 06:58:06,816 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 06:58:06,816 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 06:58:06,816 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 06:58:06,816 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 06:58:06,816 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 06:58:06,817 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 06:58:06,817 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 06:58:06,817 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 06:58:06,817 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 06:58:06,817 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 06:58:06,818 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 06:58:07,086 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 06:58:07,105 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 06:58:07,110 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 06:58:07,111 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 06:58:07,112 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 06:58:07,113 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix056_tso.oepc.i [2019-12-27 06:58:07,179 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5c19d3d2/463f96e641dc4203ae1b7df2b778dfe9/FLAGab4c8a972 [2019-12-27 06:58:07,780 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 06:58:07,781 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix056_tso.oepc.i [2019-12-27 06:58:07,796 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5c19d3d2/463f96e641dc4203ae1b7df2b778dfe9/FLAGab4c8a972 [2019-12-27 06:58:08,000 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5c19d3d2/463f96e641dc4203ae1b7df2b778dfe9 [2019-12-27 06:58:08,009 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 06:58:08,011 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 06:58:08,012 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 06:58:08,012 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 06:58:08,016 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 06:58:08,017 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:58:08" (1/1) ... [2019-12-27 06:58:08,020 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40cfcebb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:58:08, skipping insertion in model container [2019-12-27 06:58:08,020 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:58:08" (1/1) ... [2019-12-27 06:58:08,027 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 06:58:08,070 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 06:58:08,665 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 06:58:08,678 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 06:58:08,743 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 06:58:08,815 INFO L208 MainTranslator]: Completed translation [2019-12-27 06:58:08,816 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:58:08 WrapperNode [2019-12-27 06:58:08,816 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 06:58:08,817 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 06:58:08,817 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 06:58:08,817 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 06:58:08,827 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:58:08" (1/1) ... [2019-12-27 06:58:08,847 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:58:08" (1/1) ... [2019-12-27 06:58:08,889 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 06:58:08,889 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 06:58:08,890 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 06:58:08,890 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 06:58:08,902 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:58:08" (1/1) ... [2019-12-27 06:58:08,902 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:58:08" (1/1) ... [2019-12-27 06:58:08,908 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:58:08" (1/1) ... [2019-12-27 06:58:08,909 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:58:08" (1/1) ... [2019-12-27 06:58:08,926 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:58:08" (1/1) ... [2019-12-27 06:58:08,932 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:58:08" (1/1) ... [2019-12-27 06:58:08,938 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:58:08" (1/1) ... [2019-12-27 06:58:08,943 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 06:58:08,950 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 06:58:08,950 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 06:58:08,950 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 06:58:08,951 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:58:08" (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 06:58:09,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 06:58:09,011 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 06:58:09,011 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 06:58:09,012 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 06:58:09,012 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 06:58:09,013 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 06:58:09,013 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 06:58:09,014 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 06:58:09,014 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 06:58:09,015 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 06:58:09,015 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 06:58:09,015 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 06:58:09,015 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 06:58:09,017 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 06:58:09,826 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 06:58:09,826 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 06:58:09,828 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:58:09 BoogieIcfgContainer [2019-12-27 06:58:09,828 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 06:58:09,829 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 06:58:09,830 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 06:58:09,833 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 06:58:09,833 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 06:58:08" (1/3) ... [2019-12-27 06:58:09,834 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e462f87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:58:09, skipping insertion in model container [2019-12-27 06:58:09,834 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:58:08" (2/3) ... [2019-12-27 06:58:09,835 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e462f87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:58:09, skipping insertion in model container [2019-12-27 06:58:09,835 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:58:09" (3/3) ... [2019-12-27 06:58:09,837 INFO L109 eAbstractionObserver]: Analyzing ICFG mix056_tso.oepc.i [2019-12-27 06:58:09,848 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 06:58:09,848 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 06:58:09,857 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 06:58:09,858 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 06:58:09,894 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:58:09,895 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:58:09,895 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:58:09,896 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:58:09,896 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:58:09,896 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:58:09,897 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:58:09,897 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:58:09,897 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:58:09,898 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:58:09,898 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:58:09,898 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:58:09,898 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:58:09,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:58:09,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:58:09,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:58:09,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:58:09,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:58:09,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:58:09,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:58:09,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:58:09,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:58:09,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:58:09,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:58:09,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:58:09,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:58:09,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:58:09,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:58:09,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:58:09,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:58:09,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:58:09,908 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:58:09,909 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:58:09,909 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:58:09,909 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:58:09,910 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:58:09,911 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:58:09,912 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:58:09,912 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:58:09,913 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:58:09,913 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:58:09,914 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:58:09,914 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:58:09,914 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:58:09,915 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:58:09,915 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:58:09,915 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:58:09,915 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:58:09,916 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:58:09,917 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:58:09,917 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:58:09,917 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:58:09,918 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:58:09,918 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:58:09,918 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:58:09,918 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:58:09,919 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:58:09,919 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:58:09,919 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:58:09,919 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:58:09,919 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:58:09,920 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:58:09,920 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:58:09,920 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:58:09,920 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:58:09,921 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:58:09,921 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:58:09,921 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:58:09,922 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:58:09,922 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:58:09,926 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:58:09,927 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:58:09,927 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:58:09,927 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:58:09,927 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:58:09,928 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:58:09,928 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:58:09,928 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:58:09,928 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:58:09,929 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:58:09,930 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:58:09,930 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:58:09,933 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:58:09,933 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:58:09,934 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:58:09,934 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:58:09,937 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:58:09,937 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:58:09,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:58:09,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:58:09,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:58:09,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:58:09,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:58:09,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:58:09,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:58:09,939 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:58:09,968 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 06:58:09,987 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 06:58:09,987 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 06:58:09,987 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 06:58:09,987 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 06:58:09,987 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 06:58:09,988 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 06:58:09,988 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 06:58:09,988 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 06:58:10,005 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 162 places, 193 transitions [2019-12-27 06:58:10,007 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 162 places, 193 transitions [2019-12-27 06:58:10,123 INFO L132 PetriNetUnfolder]: 41/190 cut-off events. [2019-12-27 06:58:10,123 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 06:58:10,136 INFO L76 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 190 events. 41/190 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 261 event pairs. 0/147 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 06:58:10,155 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 162 places, 193 transitions [2019-12-27 06:58:10,202 INFO L132 PetriNetUnfolder]: 41/190 cut-off events. [2019-12-27 06:58:10,203 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 06:58:10,209 INFO L76 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 190 events. 41/190 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 261 event pairs. 0/147 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 06:58:10,223 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11490 [2019-12-27 06:58:10,224 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 06:58:13,474 WARN L192 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-27 06:58:13,587 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-27 06:58:13,611 INFO L206 etLargeBlockEncoding]: Checked pairs total: 51676 [2019-12-27 06:58:13,611 INFO L214 etLargeBlockEncoding]: Total number of compositions: 106 [2019-12-27 06:58:13,614 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 86 places, 97 transitions [2019-12-27 06:58:14,747 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 18542 states. [2019-12-27 06:58:14,749 INFO L276 IsEmpty]: Start isEmpty. Operand 18542 states. [2019-12-27 06:58:14,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-27 06:58:14,756 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:58:14,757 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:58:14,757 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:58:14,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:58:14,762 INFO L82 PathProgramCache]: Analyzing trace with hash 1984617832, now seen corresponding path program 1 times [2019-12-27 06:58:14,770 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:58:14,770 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749826748] [2019-12-27 06:58:14,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:58:14,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:58:15,055 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 06:58:15,056 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749826748] [2019-12-27 06:58:15,057 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:58:15,058 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 06:58:15,060 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349610854] [2019-12-27 06:58:15,066 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:58:15,066 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:58:15,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:58:15,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:58:15,085 INFO L87 Difference]: Start difference. First operand 18542 states. Second operand 3 states. [2019-12-27 06:58:15,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:58:15,547 INFO L93 Difference]: Finished difference Result 18414 states and 69758 transitions. [2019-12-27 06:58:15,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:58:15,549 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-27 06:58:15,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:58:15,776 INFO L225 Difference]: With dead ends: 18414 [2019-12-27 06:58:15,776 INFO L226 Difference]: Without dead ends: 18050 [2019-12-27 06:58:15,778 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 06:58:15,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18050 states. [2019-12-27 06:58:17,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18050 to 18050. [2019-12-27 06:58:17,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18050 states. [2019-12-27 06:58:17,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18050 states to 18050 states and 68456 transitions. [2019-12-27 06:58:17,302 INFO L78 Accepts]: Start accepts. Automaton has 18050 states and 68456 transitions. Word has length 7 [2019-12-27 06:58:17,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:58:17,303 INFO L462 AbstractCegarLoop]: Abstraction has 18050 states and 68456 transitions. [2019-12-27 06:58:17,304 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:58:17,304 INFO L276 IsEmpty]: Start isEmpty. Operand 18050 states and 68456 transitions. [2019-12-27 06:58:17,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 06:58:17,316 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:58:17,316 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:58:17,316 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:58:17,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:58:17,317 INFO L82 PathProgramCache]: Analyzing trace with hash -975860123, now seen corresponding path program 1 times [2019-12-27 06:58:17,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:58:17,317 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655275274] [2019-12-27 06:58:17,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:58:17,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:58:17,463 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 06:58:17,464 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655275274] [2019-12-27 06:58:17,464 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:58:17,464 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:58:17,465 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984262129] [2019-12-27 06:58:17,466 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:58:17,466 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:58:17,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:58:17,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:58:17,467 INFO L87 Difference]: Start difference. First operand 18050 states and 68456 transitions. Second operand 4 states. [2019-12-27 06:58:18,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:58:18,078 INFO L93 Difference]: Finished difference Result 28066 states and 102408 transitions. [2019-12-27 06:58:18,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:58:18,079 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 06:58:18,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:58:18,211 INFO L225 Difference]: With dead ends: 28066 [2019-12-27 06:58:18,211 INFO L226 Difference]: Without dead ends: 28052 [2019-12-27 06:58:18,212 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 06:58:18,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28052 states. [2019-12-27 06:58:19,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28052 to 25418. [2019-12-27 06:58:19,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25418 states. [2019-12-27 06:58:20,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25418 states to 25418 states and 94124 transitions. [2019-12-27 06:58:20,742 INFO L78 Accepts]: Start accepts. Automaton has 25418 states and 94124 transitions. Word has length 13 [2019-12-27 06:58:20,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:58:20,742 INFO L462 AbstractCegarLoop]: Abstraction has 25418 states and 94124 transitions. [2019-12-27 06:58:20,743 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:58:20,743 INFO L276 IsEmpty]: Start isEmpty. Operand 25418 states and 94124 transitions. [2019-12-27 06:58:20,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 06:58:20,746 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:58:20,746 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:58:20,746 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:58:20,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:58:20,747 INFO L82 PathProgramCache]: Analyzing trace with hash -595379205, now seen corresponding path program 1 times [2019-12-27 06:58:20,747 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:58:20,747 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349977900] [2019-12-27 06:58:20,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:58:20,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:58:20,827 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 06:58:20,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349977900] [2019-12-27 06:58:20,827 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:58:20,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:58:20,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441649674] [2019-12-27 06:58:20,828 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:58:20,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:58:20,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:58:20,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:58:20,829 INFO L87 Difference]: Start difference. First operand 25418 states and 94124 transitions. Second operand 3 states. [2019-12-27 06:58:20,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:58:20,899 INFO L93 Difference]: Finished difference Result 14452 states and 46370 transitions. [2019-12-27 06:58:20,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:58:20,900 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 06:58:20,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:58:20,965 INFO L225 Difference]: With dead ends: 14452 [2019-12-27 06:58:20,966 INFO L226 Difference]: Without dead ends: 14452 [2019-12-27 06:58:20,966 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 06:58:21,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14452 states. [2019-12-27 06:58:21,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14452 to 14452. [2019-12-27 06:58:21,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14452 states. [2019-12-27 06:58:21,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14452 states to 14452 states and 46370 transitions. [2019-12-27 06:58:21,354 INFO L78 Accepts]: Start accepts. Automaton has 14452 states and 46370 transitions. Word has length 13 [2019-12-27 06:58:21,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:58:21,355 INFO L462 AbstractCegarLoop]: Abstraction has 14452 states and 46370 transitions. [2019-12-27 06:58:21,355 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:58:21,355 INFO L276 IsEmpty]: Start isEmpty. Operand 14452 states and 46370 transitions. [2019-12-27 06:58:21,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 06:58:21,357 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:58:21,357 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:58:21,357 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:58:21,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:58:21,358 INFO L82 PathProgramCache]: Analyzing trace with hash 1512112924, now seen corresponding path program 1 times [2019-12-27 06:58:21,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:58:21,358 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084284072] [2019-12-27 06:58:21,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:58:21,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:58:21,398 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 06:58:21,398 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084284072] [2019-12-27 06:58:21,399 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:58:21,399 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:58:21,399 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638534034] [2019-12-27 06:58:21,399 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:58:21,400 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:58:21,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:58:21,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:58:21,400 INFO L87 Difference]: Start difference. First operand 14452 states and 46370 transitions. Second operand 4 states. [2019-12-27 06:58:21,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:58:21,425 INFO L93 Difference]: Finished difference Result 2114 states and 4969 transitions. [2019-12-27 06:58:21,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 06:58:21,425 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 06:58:21,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:58:21,431 INFO L225 Difference]: With dead ends: 2114 [2019-12-27 06:58:21,431 INFO L226 Difference]: Without dead ends: 2114 [2019-12-27 06:58:21,432 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:58:21,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2114 states. [2019-12-27 06:58:21,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2114 to 2114. [2019-12-27 06:58:21,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2114 states. [2019-12-27 06:58:21,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2114 states to 2114 states and 4969 transitions. [2019-12-27 06:58:21,680 INFO L78 Accepts]: Start accepts. Automaton has 2114 states and 4969 transitions. Word has length 14 [2019-12-27 06:58:21,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:58:21,680 INFO L462 AbstractCegarLoop]: Abstraction has 2114 states and 4969 transitions. [2019-12-27 06:58:21,680 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:58:21,680 INFO L276 IsEmpty]: Start isEmpty. Operand 2114 states and 4969 transitions. [2019-12-27 06:58:21,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 06:58:21,683 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:58:21,683 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 06:58:21,683 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:58:21,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:58:21,684 INFO L82 PathProgramCache]: Analyzing trace with hash 107168072, now seen corresponding path program 1 times [2019-12-27 06:58:21,684 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:58:21,684 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079861600] [2019-12-27 06:58:21,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:58:21,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:58:21,805 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 06:58:21,805 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079861600] [2019-12-27 06:58:21,805 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:58:21,805 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:58:21,806 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120367401] [2019-12-27 06:58:21,807 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:58:21,807 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:58:21,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:58:21,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:58:21,808 INFO L87 Difference]: Start difference. First operand 2114 states and 4969 transitions. Second operand 5 states. [2019-12-27 06:58:21,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:58:21,860 INFO L93 Difference]: Finished difference Result 699 states and 1627 transitions. [2019-12-27 06:58:21,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:58:21,860 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-27 06:58:21,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:58:21,862 INFO L225 Difference]: With dead ends: 699 [2019-12-27 06:58:21,863 INFO L226 Difference]: Without dead ends: 655 [2019-12-27 06:58:21,863 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:58:21,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2019-12-27 06:58:21,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 599. [2019-12-27 06:58:21,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599 states. [2019-12-27 06:58:21,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 1405 transitions. [2019-12-27 06:58:21,881 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 1405 transitions. Word has length 26 [2019-12-27 06:58:21,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:58:21,882 INFO L462 AbstractCegarLoop]: Abstraction has 599 states and 1405 transitions. [2019-12-27 06:58:21,882 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:58:21,882 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 1405 transitions. [2019-12-27 06:58:21,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 06:58:21,888 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:58:21,888 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:58:21,889 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:58:21,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:58:21,889 INFO L82 PathProgramCache]: Analyzing trace with hash 523730057, now seen corresponding path program 1 times [2019-12-27 06:58:21,890 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:58:21,891 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450701901] [2019-12-27 06:58:21,891 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:58:21,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:58:22,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:58:22,019 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450701901] [2019-12-27 06:58:22,020 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:58:22,021 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:58:22,021 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847315293] [2019-12-27 06:58:22,022 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:58:22,022 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:58:22,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:58:22,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:58:22,023 INFO L87 Difference]: Start difference. First operand 599 states and 1405 transitions. Second operand 3 states. [2019-12-27 06:58:22,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:58:22,076 INFO L93 Difference]: Finished difference Result 609 states and 1420 transitions. [2019-12-27 06:58:22,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:58:22,077 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-27 06:58:22,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:58:22,079 INFO L225 Difference]: With dead ends: 609 [2019-12-27 06:58:22,080 INFO L226 Difference]: Without dead ends: 609 [2019-12-27 06:58:22,080 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 06:58:22,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2019-12-27 06:58:22,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 605. [2019-12-27 06:58:22,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2019-12-27 06:58:22,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 1416 transitions. [2019-12-27 06:58:22,093 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 1416 transitions. Word has length 55 [2019-12-27 06:58:22,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:58:22,094 INFO L462 AbstractCegarLoop]: Abstraction has 605 states and 1416 transitions. [2019-12-27 06:58:22,094 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:58:22,094 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 1416 transitions. [2019-12-27 06:58:22,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 06:58:22,096 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:58:22,096 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:58:22,096 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:58:22,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:58:22,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1466894421, now seen corresponding path program 1 times [2019-12-27 06:58:22,097 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:58:22,099 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845807082] [2019-12-27 06:58:22,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:58:22,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:58:22,233 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 06:58:22,235 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845807082] [2019-12-27 06:58:22,235 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:58:22,236 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 06:58:22,237 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790065596] [2019-12-27 06:58:22,237 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:58:22,237 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:58:22,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:58:22,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:58:22,238 INFO L87 Difference]: Start difference. First operand 605 states and 1416 transitions. Second operand 5 states. [2019-12-27 06:58:22,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:58:22,465 INFO L93 Difference]: Finished difference Result 894 states and 2088 transitions. [2019-12-27 06:58:22,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 06:58:22,465 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2019-12-27 06:58:22,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:58:22,468 INFO L225 Difference]: With dead ends: 894 [2019-12-27 06:58:22,468 INFO L226 Difference]: Without dead ends: 894 [2019-12-27 06:58:22,469 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:58:22,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894 states. [2019-12-27 06:58:22,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 719. [2019-12-27 06:58:22,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 719 states. [2019-12-27 06:58:22,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 1697 transitions. [2019-12-27 06:58:22,482 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 1697 transitions. Word has length 55 [2019-12-27 06:58:22,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:58:22,483 INFO L462 AbstractCegarLoop]: Abstraction has 719 states and 1697 transitions. [2019-12-27 06:58:22,483 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:58:22,483 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 1697 transitions. [2019-12-27 06:58:22,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 06:58:22,485 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:58:22,485 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:58:22,485 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:58:22,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:58:22,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1931223363, now seen corresponding path program 2 times [2019-12-27 06:58:22,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:58:22,486 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872948972] [2019-12-27 06:58:22,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:58:22,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:58:22,625 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 06:58:22,625 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872948972] [2019-12-27 06:58:22,625 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:58:22,626 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:58:22,626 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165153985] [2019-12-27 06:58:22,626 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 06:58:22,626 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:58:22,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 06:58:22,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:58:22,627 INFO L87 Difference]: Start difference. First operand 719 states and 1697 transitions. Second operand 6 states. [2019-12-27 06:58:23,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:58:23,037 INFO L93 Difference]: Finished difference Result 1193 states and 2783 transitions. [2019-12-27 06:58:23,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 06:58:23,037 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-12-27 06:58:23,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:58:23,046 INFO L225 Difference]: With dead ends: 1193 [2019-12-27 06:58:23,047 INFO L226 Difference]: Without dead ends: 1193 [2019-12-27 06:58:23,047 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-27 06:58:23,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2019-12-27 06:58:23,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 761. [2019-12-27 06:58:23,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 761 states. [2019-12-27 06:58:23,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 1800 transitions. [2019-12-27 06:58:23,062 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 1800 transitions. Word has length 55 [2019-12-27 06:58:23,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:58:23,063 INFO L462 AbstractCegarLoop]: Abstraction has 761 states and 1800 transitions. [2019-12-27 06:58:23,063 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 06:58:23,063 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 1800 transitions. [2019-12-27 06:58:23,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 06:58:23,065 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:58:23,065 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:58:23,066 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:58:23,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:58:23,066 INFO L82 PathProgramCache]: Analyzing trace with hash 891728533, now seen corresponding path program 3 times [2019-12-27 06:58:23,066 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:58:23,067 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361690077] [2019-12-27 06:58:23,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:58:23,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:58:23,162 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 06:58:23,162 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361690077] [2019-12-27 06:58:23,163 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:58:23,163 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:58:23,163 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761454670] [2019-12-27 06:58:23,164 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:58:23,164 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:58:23,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:58:23,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:58:23,165 INFO L87 Difference]: Start difference. First operand 761 states and 1800 transitions. Second operand 3 states. [2019-12-27 06:58:23,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:58:23,225 INFO L93 Difference]: Finished difference Result 760 states and 1798 transitions. [2019-12-27 06:58:23,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:58:23,226 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-27 06:58:23,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:58:23,228 INFO L225 Difference]: With dead ends: 760 [2019-12-27 06:58:23,228 INFO L226 Difference]: Without dead ends: 760 [2019-12-27 06:58:23,228 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 06:58:23,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2019-12-27 06:58:23,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 539. [2019-12-27 06:58:23,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 539 states. [2019-12-27 06:58:23,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 1284 transitions. [2019-12-27 06:58:23,239 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 1284 transitions. Word has length 55 [2019-12-27 06:58:23,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:58:23,241 INFO L462 AbstractCegarLoop]: Abstraction has 539 states and 1284 transitions. [2019-12-27 06:58:23,241 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:58:23,241 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 1284 transitions. [2019-12-27 06:58:23,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 06:58:23,243 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:58:23,245 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:58:23,245 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:58:23,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:58:23,245 INFO L82 PathProgramCache]: Analyzing trace with hash -660404610, now seen corresponding path program 1 times [2019-12-27 06:58:23,245 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:58:23,246 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507349001] [2019-12-27 06:58:23,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:58:23,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:58:23,323 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 06:58:23,324 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507349001] [2019-12-27 06:58:23,324 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:58:23,325 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:58:23,325 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694783425] [2019-12-27 06:58:23,325 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:58:23,325 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:58:23,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:58:23,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:58:23,326 INFO L87 Difference]: Start difference. First operand 539 states and 1284 transitions. Second operand 3 states. [2019-12-27 06:58:23,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:58:23,339 INFO L93 Difference]: Finished difference Result 511 states and 1182 transitions. [2019-12-27 06:58:23,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:58:23,340 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-12-27 06:58:23,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:58:23,343 INFO L225 Difference]: With dead ends: 511 [2019-12-27 06:58:23,344 INFO L226 Difference]: Without dead ends: 511 [2019-12-27 06:58:23,344 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 06:58:23,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2019-12-27 06:58:23,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 475. [2019-12-27 06:58:23,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 475 states. [2019-12-27 06:58:23,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 1096 transitions. [2019-12-27 06:58:23,355 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 1096 transitions. Word has length 56 [2019-12-27 06:58:23,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:58:23,357 INFO L462 AbstractCegarLoop]: Abstraction has 475 states and 1096 transitions. [2019-12-27 06:58:23,358 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:58:23,358 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 1096 transitions. [2019-12-27 06:58:23,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 06:58:23,361 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:58:23,361 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:58:23,361 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:58:23,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:58:23,362 INFO L82 PathProgramCache]: Analyzing trace with hash 1825683623, now seen corresponding path program 1 times [2019-12-27 06:58:23,362 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:58:23,363 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685270627] [2019-12-27 06:58:23,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:58:23,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:58:23,560 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 06:58:23,561 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685270627] [2019-12-27 06:58:23,561 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:58:23,561 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 06:58:23,561 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606479346] [2019-12-27 06:58:23,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 06:58:23,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:58:23,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 06:58:23,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:58:23,563 INFO L87 Difference]: Start difference. First operand 475 states and 1096 transitions. Second operand 6 states. [2019-12-27 06:58:23,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:58:23,638 INFO L93 Difference]: Finished difference Result 783 states and 1701 transitions. [2019-12-27 06:58:23,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 06:58:23,638 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-12-27 06:58:23,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:58:23,640 INFO L225 Difference]: With dead ends: 783 [2019-12-27 06:58:23,640 INFO L226 Difference]: Without dead ends: 312 [2019-12-27 06:58:23,640 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-27 06:58:23,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2019-12-27 06:58:23,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 279. [2019-12-27 06:58:23,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2019-12-27 06:58:23,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 509 transitions. [2019-12-27 06:58:23,648 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 509 transitions. Word has length 57 [2019-12-27 06:58:23,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:58:23,649 INFO L462 AbstractCegarLoop]: Abstraction has 279 states and 509 transitions. [2019-12-27 06:58:23,649 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 06:58:23,649 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 509 transitions. [2019-12-27 06:58:23,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 06:58:23,650 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:58:23,650 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:58:23,650 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:58:23,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:58:23,651 INFO L82 PathProgramCache]: Analyzing trace with hash 543693155, now seen corresponding path program 2 times [2019-12-27 06:58:23,651 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:58:23,651 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856102885] [2019-12-27 06:58:23,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:58:23,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:58:24,066 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 06:58:24,067 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856102885] [2019-12-27 06:58:24,067 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:58:24,067 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 06:58:24,067 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247587009] [2019-12-27 06:58:24,068 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 06:58:24,068 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:58:24,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 06:58:24,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-12-27 06:58:24,069 INFO L87 Difference]: Start difference. First operand 279 states and 509 transitions. Second operand 13 states. [2019-12-27 06:58:24,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:58:24,627 INFO L93 Difference]: Finished difference Result 493 states and 880 transitions. [2019-12-27 06:58:24,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 06:58:24,628 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 57 [2019-12-27 06:58:24,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:58:24,629 INFO L225 Difference]: With dead ends: 493 [2019-12-27 06:58:24,629 INFO L226 Difference]: Without dead ends: 461 [2019-12-27 06:58:24,630 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=127, Invalid=523, Unknown=0, NotChecked=0, Total=650 [2019-12-27 06:58:24,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2019-12-27 06:58:24,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 379. [2019-12-27 06:58:24,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2019-12-27 06:58:24,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 680 transitions. [2019-12-27 06:58:24,636 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 680 transitions. Word has length 57 [2019-12-27 06:58:24,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:58:24,637 INFO L462 AbstractCegarLoop]: Abstraction has 379 states and 680 transitions. [2019-12-27 06:58:24,637 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 06:58:24,637 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 680 transitions. [2019-12-27 06:58:24,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 06:58:24,638 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:58:24,638 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:58:24,639 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:58:24,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:58:24,639 INFO L82 PathProgramCache]: Analyzing trace with hash -1607584303, now seen corresponding path program 3 times [2019-12-27 06:58:24,639 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:58:24,640 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304464056] [2019-12-27 06:58:24,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:58:24,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:58:25,474 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 06:58:25,474 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304464056] [2019-12-27 06:58:25,474 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:58:25,474 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-12-27 06:58:25,475 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606441022] [2019-12-27 06:58:25,475 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-27 06:58:25,475 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:58:25,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-27 06:58:25,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=395, Unknown=0, NotChecked=0, Total=462 [2019-12-27 06:58:25,476 INFO L87 Difference]: Start difference. First operand 379 states and 680 transitions. Second operand 22 states. [2019-12-27 06:58:28,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:58:28,074 INFO L93 Difference]: Finished difference Result 950 states and 1714 transitions. [2019-12-27 06:58:28,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-12-27 06:58:28,075 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 57 [2019-12-27 06:58:28,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:58:28,078 INFO L225 Difference]: With dead ends: 950 [2019-12-27 06:58:28,078 INFO L226 Difference]: Without dead ends: 918 [2019-12-27 06:58:28,080 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 777 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=506, Invalid=2800, Unknown=0, NotChecked=0, Total=3306 [2019-12-27 06:58:28,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 918 states. [2019-12-27 06:58:28,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 918 to 413. [2019-12-27 06:58:28,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2019-12-27 06:58:28,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 744 transitions. [2019-12-27 06:58:28,089 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 744 transitions. Word has length 57 [2019-12-27 06:58:28,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:58:28,089 INFO L462 AbstractCegarLoop]: Abstraction has 413 states and 744 transitions. [2019-12-27 06:58:28,089 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-27 06:58:28,089 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 744 transitions. [2019-12-27 06:58:28,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 06:58:28,091 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:58:28,091 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:58:28,091 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:58:28,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:58:28,092 INFO L82 PathProgramCache]: Analyzing trace with hash 1879148695, now seen corresponding path program 4 times [2019-12-27 06:58:28,092 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:58:28,092 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809856259] [2019-12-27 06:58:28,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:58:28,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 06:58:28,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 06:58:28,195 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 06:58:28,195 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 06:58:28,200 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] ULTIMATE.startENTRY-->L800: Formula: (let ((.cse0 (store |v_#valid_66| 0 0))) (and (= |v_#valid_64| (store .cse0 |v_ULTIMATE.start_main_~#t1507~0.base_27| 1)) (= 0 v_~weak$$choice0~0_8) (= 0 v_~y$read_delayed_var~0.offset_7) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t1507~0.base_27| 4)) (= 0 v_~y$r_buff1_thd0~0_45) (= v_~y~0_25 0) (= v_~y$r_buff0_thd1~0_8 0) (= 0 v_~y$w_buff1~0_24) (= v_~main$tmp_guard0~0_9 0) (= |v_#NULL.offset_6| 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1507~0.base_27|) 0) (= v_~y$read_delayed~0_7 0) (= v_~main$tmp_guard1~0_11 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t1507~0.base_27|) (= v_~y$r_buff0_thd2~0_19 0) (= v_~y$w_buff0_used~0_103 0) (= 0 v_~weak$$choice2~0_32) (= v_~y$r_buff1_thd1~0_8 0) (= 0 v_~y$flush_delayed~0_13) (< 0 |v_#StackHeapBarrier_18|) (= v_~y$r_buff0_thd3~0_25 0) (= 0 v_~__unbuffered_p2_EAX~0_10) (= 0 |v_#NULL.base_6|) (= 0 v_~y$read_delayed_var~0.base_7) (= 0 v_~y$w_buff0~0_25) (= 0 v_~__unbuffered_cnt~0_22) (= 0 v_~y$r_buff1_thd3~0_18) (= v_~z~0_12 0) (= v_~y$mem_tmp~0_10 0) (= 0 |v_ULTIMATE.start_main_~#t1507~0.offset_20|) (= v_~x~0_12 0) (= (store |v_#memory_int_26| |v_ULTIMATE.start_main_~#t1507~0.base_27| (store (select |v_#memory_int_26| |v_ULTIMATE.start_main_~#t1507~0.base_27|) |v_ULTIMATE.start_main_~#t1507~0.offset_20| 0)) |v_#memory_int_25|) (= v_~y$r_buff0_thd0~0_76 0) (= 0 v_~y$r_buff1_thd2~0_16) (= v_~y$w_buff1_used~0_63 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_26|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_13|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_13|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_11|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_14|, ULTIMATE.start_main_~#t1507~0.base=|v_ULTIMATE.start_main_~#t1507~0.base_27|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_11|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_13|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$mem_tmp~0=v_~y$mem_tmp~0_10, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_18, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_8, ~y$flush_delayed~0=v_~y$flush_delayed~0_13, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_10, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_13|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_13|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_9|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_16|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_14|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_14|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_13|, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_15|, ~y$w_buff1~0=v_~y$w_buff1~0_24, ULTIMATE.start_main_~#t1507~0.offset=|v_ULTIMATE.start_main_~#t1507~0.offset_20|, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ULTIMATE.start_main_~#t1508~0.base=|v_ULTIMATE.start_main_~#t1508~0.base_27|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_19, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_9|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_45, ~x~0=v_~x~0_12, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_103, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_15|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_16|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_11, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_13|, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_11|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_15|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_11|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_16|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_8, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_15|, ~y$w_buff0~0=v_~y$w_buff0~0_25, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_25, ULTIMATE.start_main_~#t1508~0.offset=|v_ULTIMATE.start_main_~#t1508~0.offset_20|, ~y~0=v_~y~0_25, ULTIMATE.start_main_~#t1509~0.base=|v_ULTIMATE.start_main_~#t1509~0.base_22|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_13|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_9|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_13|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_16|, ULTIMATE.start_main_~#t1509~0.offset=|v_ULTIMATE.start_main_~#t1509~0.offset_15|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_16|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_14|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_16, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_17|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_76, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_25|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_9|, ~z~0=v_~z~0_12, ~weak$$choice2~0=v_~weak$$choice2~0_32, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_63} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_~#t1507~0.base, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ULTIMATE.start_main_~#t1507~0.offset, ~y$read_delayed_var~0.base, ULTIMATE.start_main_~#t1508~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_#t~nondet17, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite30, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ULTIMATE.start_main_~#t1508~0.offset, ~y~0, ULTIMATE.start_main_~#t1509~0.base, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_~#t1509~0.offset, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 06:58:28,201 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L800-1-->L802: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t1508~0.base_13|)) (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t1508~0.base_13| 1)) (= 0 (select |v_#valid_41| |v_ULTIMATE.start_main_~#t1508~0.base_13|)) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1508~0.base_13| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1508~0.base_13|) |v_ULTIMATE.start_main_~#t1508~0.offset_11| 1)) |v_#memory_int_17|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1508~0.base_13|) (= 0 |v_ULTIMATE.start_main_~#t1508~0.offset_11|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1508~0.base_13| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t1508~0.base=|v_ULTIMATE.start_main_~#t1508~0.base_13|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t1508~0.offset=|v_ULTIMATE.start_main_~#t1508~0.offset_11|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1508~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t1508~0.offset, ULTIMATE.start_main_#t~nondet15, #length] because there is no mapped edge [2019-12-27 06:58:28,202 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L802-1-->L804: Formula: (and (= |v_#valid_38| (store |v_#valid_39| |v_ULTIMATE.start_main_~#t1509~0.base_12| 1)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1509~0.base_12| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1509~0.base_12|) |v_ULTIMATE.start_main_~#t1509~0.offset_10| 2)) |v_#memory_int_15|) (= 0 |v_ULTIMATE.start_main_~#t1509~0.offset_10|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1509~0.base_12|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1509~0.base_12| 4)) (= 0 (select |v_#valid_39| |v_ULTIMATE.start_main_~#t1509~0.base_12|)) (not (= |v_ULTIMATE.start_main_~#t1509~0.base_12| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_5|, ULTIMATE.start_main_~#t1509~0.offset=|v_ULTIMATE.start_main_~#t1509~0.offset_10|, #length=|v_#length_15|, ULTIMATE.start_main_~#t1509~0.base=|v_ULTIMATE.start_main_~#t1509~0.base_12|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_main_~#t1509~0.offset, #length, ULTIMATE.start_main_~#t1509~0.base] because there is no mapped edge [2019-12-27 06:58:28,203 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [641] [641] P2ENTRY-->L4-3: Formula: (and (= 1 v_~y$w_buff0_used~0_79) (= 1 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|) (= (mod v_~y$w_buff1_used~0_51 256) 0) (= v_~y$w_buff1_used~0_51 v_~y$w_buff0_used~0_80) (= |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_4| v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_8) (= v_~y$w_buff0~0_16 v_~y$w_buff1~0_16) (= 2 v_~y$w_buff0~0_15) (= v_P2Thread1of1ForFork0_~arg.offset_4 |v_P2Thread1of1ForFork0_#in~arg.offset_4|) (= v_P2Thread1of1ForFork0_~arg.base_4 |v_P2Thread1of1ForFork0_#in~arg.base_4|)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_4|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_80, ~y$w_buff0~0=v_~y$w_buff0~0_16, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_4|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_4, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_4|, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_79, ~y$w_buff1~0=v_~y$w_buff1~0_16, ~y$w_buff0~0=v_~y$w_buff0~0_15, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_4, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_4|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_8, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_51} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P2Thread1of1ForFork0_~arg.offset, P2Thread1of1ForFork0___VERIFIER_assert_~expression, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 06:58:28,205 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork1_~arg.base_5 |v_P0Thread1of1ForFork1_#in~arg.base_5|) (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= 1 v_~x~0_9) (= v_P0Thread1of1ForFork1_~arg.offset_5 |v_P0Thread1of1ForFork1_#in~arg.offset_5|) (= 1 v_~z~0_7) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|} OutVars{P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_5, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ~z~0=v_~z~0_7, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|, ~x~0=v_~x~0_9, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_5} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~z~0, ~x~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-27 06:58:28,207 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L778-->L778-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In-1314399857 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1314399857 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite11_Out-1314399857| ~y$w_buff0_used~0_In-1314399857) (or .cse0 .cse1)) (and (= |P2Thread1of1ForFork0_#t~ite11_Out-1314399857| 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1314399857, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1314399857} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1314399857, P2Thread1of1ForFork0_#t~ite11=|P2Thread1of1ForFork0_#t~ite11_Out-1314399857|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1314399857} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite11] because there is no mapped edge [2019-12-27 06:58:28,208 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [694] [694] L748-2-->L748-4: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In724509425 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In724509425 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite3_Out724509425| ~y~0_In724509425)) (and (not .cse1) (not .cse0) (= |P1Thread1of1ForFork2_#t~ite3_Out724509425| ~y$w_buff1~0_In724509425)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In724509425, ~y$w_buff1~0=~y$w_buff1~0_In724509425, ~y~0=~y~0_In724509425, ~y$w_buff1_used~0=~y$w_buff1_used~0_In724509425} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In724509425, ~y$w_buff1~0=~y$w_buff1~0_In724509425, ~y~0=~y~0_In724509425, P1Thread1of1ForFork2_#t~ite3=|P1Thread1of1ForFork2_#t~ite3_Out724509425|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In724509425} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-27 06:58:28,208 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [618] [618] L748-4-->L749: Formula: (= v_~y~0_16 |v_P1Thread1of1ForFork2_#t~ite3_8|) InVars {P1Thread1of1ForFork2_#t~ite3=|v_P1Thread1of1ForFork2_#t~ite3_8|} OutVars{P1Thread1of1ForFork2_#t~ite4=|v_P1Thread1of1ForFork2_#t~ite4_7|, ~y~0=v_~y~0_16, P1Thread1of1ForFork2_#t~ite3=|v_P1Thread1of1ForFork2_#t~ite3_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite4, ~y~0, P1Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-27 06:58:28,208 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L749-->L749-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1458314949 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1458314949 256)))) (or (and (= ~y$w_buff0_used~0_In1458314949 |P1Thread1of1ForFork2_#t~ite5_Out1458314949|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork2_#t~ite5_Out1458314949|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1458314949, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1458314949} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1458314949, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1458314949, P1Thread1of1ForFork2_#t~ite5=|P1Thread1of1ForFork2_#t~ite5_Out1458314949|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-27 06:58:28,209 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [689] [689] L750-->L750-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1594280225 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In-1594280225 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In-1594280225 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In-1594280225 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite6_Out-1594280225| ~y$w_buff1_used~0_In-1594280225) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork2_#t~ite6_Out-1594280225|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1594280225, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1594280225, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1594280225, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1594280225} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1594280225, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1594280225, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1594280225, P1Thread1of1ForFork2_#t~ite6=|P1Thread1of1ForFork2_#t~ite6_Out-1594280225|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1594280225} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-27 06:58:28,210 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L751-->L751-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-935823013 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-935823013 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite7_Out-935823013| ~y$r_buff0_thd2~0_In-935823013) (or .cse0 .cse1)) (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite7_Out-935823013| 0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-935823013, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-935823013} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-935823013, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-935823013, P1Thread1of1ForFork2_#t~ite7=|P1Thread1of1ForFork2_#t~ite7_Out-935823013|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-27 06:58:28,211 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L779-->L779-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In-2116710669 256))) (.cse3 (= (mod ~y$r_buff1_thd3~0_In-2116710669 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-2116710669 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-2116710669 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite12_Out-2116710669| 0)) (and (= |P2Thread1of1ForFork0_#t~ite12_Out-2116710669| ~y$w_buff1_used~0_In-2116710669) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-2116710669, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2116710669, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2116710669, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2116710669} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-2116710669, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2116710669, P2Thread1of1ForFork0_#t~ite12=|P2Thread1of1ForFork0_#t~ite12_Out-2116710669|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2116710669, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2116710669} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-27 06:58:28,211 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L752-->L752-2: Formula: (let ((.cse3 (= (mod ~y$w_buff1_used~0_In394297616 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In394297616 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In394297616 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In394297616 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite8_Out394297616| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= |P1Thread1of1ForFork2_#t~ite8_Out394297616| ~y$r_buff1_thd2~0_In394297616) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In394297616, ~y$w_buff0_used~0=~y$w_buff0_used~0_In394297616, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In394297616, ~y$w_buff1_used~0=~y$w_buff1_used~0_In394297616} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In394297616, ~y$w_buff0_used~0=~y$w_buff0_used~0_In394297616, P1Thread1of1ForFork2_#t~ite8=|P1Thread1of1ForFork2_#t~ite8_Out394297616|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In394297616, ~y$w_buff1_used~0=~y$w_buff1_used~0_In394297616} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-27 06:58:28,212 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L752-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= |v_P1Thread1of1ForFork2_#t~ite8_8| v_~y$r_buff1_thd2~0_12) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {P1Thread1of1ForFork2_#t~ite8=|v_P1Thread1of1ForFork2_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_12, P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, P1Thread1of1ForFork2_#t~ite8=|v_P1Thread1of1ForFork2_#t~ite8_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork2_#res.offset, P1Thread1of1ForFork2_#t~ite8, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-27 06:58:28,213 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L780-->L781: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In2133500316 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd3~0_In2133500316 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd3~0_In2133500316 ~y$r_buff0_thd3~0_Out2133500316)) (and (not .cse0) (not .cse1) (= 0 ~y$r_buff0_thd3~0_Out2133500316)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2133500316, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In2133500316} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2133500316, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out2133500316, P2Thread1of1ForFork0_#t~ite13=|P2Thread1of1ForFork0_#t~ite13_Out2133500316|} AuxVars[] AssignedVars[~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite13] because there is no mapped edge [2019-12-27 06:58:28,213 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L781-->L781-2: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd3~0_In-2022905936 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In-2022905936 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In-2022905936 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd3~0_In-2022905936 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd3~0_In-2022905936 |P2Thread1of1ForFork0_#t~ite14_Out-2022905936|) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite14_Out-2022905936| 0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-2022905936, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2022905936, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2022905936, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2022905936} OutVars{P2Thread1of1ForFork0_#t~ite14=|P2Thread1of1ForFork0_#t~ite14_Out-2022905936|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-2022905936, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2022905936, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2022905936, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2022905936} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-27 06:58:28,213 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L781-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= v_~y$r_buff1_thd3~0_14 |v_P2Thread1of1ForFork0_#t~ite14_8|) (= v_~__unbuffered_cnt~0_18 (+ v_~__unbuffered_cnt~0_19 1))) InVars {P2Thread1of1ForFork0_#t~ite14=|v_P2Thread1of1ForFork0_#t~ite14_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19} OutVars{P2Thread1of1ForFork0_#t~ite14=|v_P2Thread1of1ForFork0_#t~ite14_7|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_14, P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite14, ~y$r_buff1_thd3~0, P2Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-27 06:58:28,214 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [617] [617] L804-1-->L810: Formula: (and (= v_~__unbuffered_cnt~0_9 3) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_3|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet17, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 06:58:28,214 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L810-2-->L810-4: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd0~0_In426529592 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In426529592 256)))) (or (and (or .cse0 .cse1) (= ~y~0_In426529592 |ULTIMATE.start_main_#t~ite18_Out426529592|)) (and (not .cse0) (= ~y$w_buff1~0_In426529592 |ULTIMATE.start_main_#t~ite18_Out426529592|) (not .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In426529592, ~y~0=~y~0_In426529592, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In426529592, ~y$w_buff1_used~0=~y$w_buff1_used~0_In426529592} OutVars{~y$w_buff1~0=~y$w_buff1~0_In426529592, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out426529592|, ~y~0=~y~0_In426529592, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In426529592, ~y$w_buff1_used~0=~y$w_buff1_used~0_In426529592} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite18] because there is no mapped edge [2019-12-27 06:58:28,215 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [636] [636] L810-4-->L811: Formula: (= v_~y~0_18 |v_ULTIMATE.start_main_#t~ite18_7|) InVars {ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_7|} OutVars{ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_6|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_6|, ~y~0=v_~y~0_18} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19, ~y~0] because there is no mapped edge [2019-12-27 06:58:28,215 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L811-->L811-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1423552465 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In1423552465 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite20_Out1423552465| 0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite20_Out1423552465| ~y$w_buff0_used~0_In1423552465)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1423552465, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1423552465} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1423552465, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1423552465, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out1423552465|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-27 06:58:28,216 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L812-->L812-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1313974328 256))) (.cse3 (= (mod ~y$r_buff1_thd0~0_In-1313974328 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1313974328 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-1313974328 256)))) (or (and (= |ULTIMATE.start_main_#t~ite21_Out-1313974328| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= ~y$w_buff1_used~0_In-1313974328 |ULTIMATE.start_main_#t~ite21_Out-1313974328|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1313974328, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1313974328, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1313974328, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1313974328} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1313974328, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1313974328, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-1313974328|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1313974328, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1313974328} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-27 06:58:28,216 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L813-->L813-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1319118490 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In1319118490 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite22_Out1319118490| ~y$r_buff0_thd0~0_In1319118490)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite22_Out1319118490| 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1319118490, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1319118490} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1319118490, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1319118490, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out1319118490|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-27 06:58:28,217 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [684] [684] L814-->L814-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1371601449 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-1371601449 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In-1371601449 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd0~0_In-1371601449 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite23_Out-1371601449| ~y$r_buff1_thd0~0_In-1371601449) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite23_Out-1371601449| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1371601449, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1371601449, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1371601449, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1371601449} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1371601449, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1371601449, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1371601449, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-1371601449|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1371601449} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-27 06:58:28,219 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L822-->L822-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-679234063 256)))) (or (and (= ~y$w_buff0~0_In-679234063 |ULTIMATE.start_main_#t~ite29_Out-679234063|) (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-679234063 256) 0))) (or (and (= 0 (mod ~y$r_buff1_thd0~0_In-679234063 256)) .cse0) (= (mod ~y$w_buff0_used~0_In-679234063 256) 0) (and (= 0 (mod ~y$w_buff1_used~0_In-679234063 256)) .cse0))) (= |ULTIMATE.start_main_#t~ite30_Out-679234063| |ULTIMATE.start_main_#t~ite29_Out-679234063|) .cse1) (and (= |ULTIMATE.start_main_#t~ite29_In-679234063| |ULTIMATE.start_main_#t~ite29_Out-679234063|) (not .cse1) (= |ULTIMATE.start_main_#t~ite30_Out-679234063| ~y$w_buff0~0_In-679234063)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-679234063, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_In-679234063|, ~y$w_buff0~0=~y$w_buff0~0_In-679234063, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-679234063, ~weak$$choice2~0=~weak$$choice2~0_In-679234063, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-679234063, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-679234063} OutVars{ULTIMATE.start_main_#t~ite30=|ULTIMATE.start_main_#t~ite30_Out-679234063|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-679234063, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out-679234063|, ~y$w_buff0~0=~y$w_buff0~0_In-679234063, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-679234063, ~weak$$choice2~0=~weak$$choice2~0_In-679234063, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-679234063, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-679234063} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite30, ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-27 06:58:28,224 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L826-->L827: Formula: (and (not (= (mod v_~weak$$choice2~0_21 256) 0)) (= v_~y$r_buff0_thd0~0_54 v_~y$r_buff0_thd0~0_53)) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_54, ~weak$$choice2~0=v_~weak$$choice2~0_21} 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|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_53, ~weak$$choice2~0=v_~weak$$choice2~0_21, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 06:58:28,225 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L829-->L832-1: Formula: (and (= 0 v_~y$flush_delayed~0_10) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5| (mod v_~main$tmp_guard1~0_8 256)) (= v_~y~0_23 v_~y$mem_tmp~0_7) (not (= 0 (mod v_~y$flush_delayed~0_11 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_11, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_10, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_12|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~y~0=v_~y~0_23, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} AuxVars[] AssignedVars[~y$flush_delayed~0, ULTIMATE.start_main_#t~ite46, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 06:58:28,225 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L832-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 06:58:28,348 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 06:58:28 BasicIcfg [2019-12-27 06:58:28,348 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 06:58:28,351 INFO L168 Benchmark]: Toolchain (without parser) took 20340.17 ms. Allocated memory was 145.8 MB in the beginning and 921.2 MB in the end (delta: 775.4 MB). Free memory was 101.7 MB in the beginning and 458.0 MB in the end (delta: -356.3 MB). Peak memory consumption was 419.1 MB. Max. memory is 7.1 GB. [2019-12-27 06:58:28,351 INFO L168 Benchmark]: CDTParser took 0.52 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 06:58:28,353 INFO L168 Benchmark]: CACSL2BoogieTranslator took 804.67 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 101.5 MB in the beginning and 157.5 MB in the end (delta: -56.1 MB). Peak memory consumption was 21.7 MB. Max. memory is 7.1 GB. [2019-12-27 06:58:28,353 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.23 ms. Allocated memory is still 203.4 MB. Free memory was 157.5 MB in the beginning and 154.2 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2019-12-27 06:58:28,354 INFO L168 Benchmark]: Boogie Preprocessor took 53.54 ms. Allocated memory is still 203.4 MB. Free memory was 154.2 MB in the beginning and 152.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 06:58:28,360 INFO L168 Benchmark]: RCFGBuilder took 878.69 ms. Allocated memory is still 203.4 MB. Free memory was 151.6 MB in the beginning and 105.5 MB in the end (delta: 46.1 MB). Peak memory consumption was 46.1 MB. Max. memory is 7.1 GB. [2019-12-27 06:58:28,361 INFO L168 Benchmark]: TraceAbstraction took 18518.98 ms. Allocated memory was 203.4 MB in the beginning and 921.2 MB in the end (delta: 717.8 MB). Free memory was 104.8 MB in the beginning and 458.0 MB in the end (delta: -353.1 MB). Peak memory consumption was 364.6 MB. Max. memory is 7.1 GB. [2019-12-27 06:58:28,366 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.52 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 804.67 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 101.5 MB in the beginning and 157.5 MB in the end (delta: -56.1 MB). Peak memory consumption was 21.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 72.23 ms. Allocated memory is still 203.4 MB. Free memory was 157.5 MB in the beginning and 154.2 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 53.54 ms. Allocated memory is still 203.4 MB. Free memory was 154.2 MB in the beginning and 152.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 878.69 ms. Allocated memory is still 203.4 MB. Free memory was 151.6 MB in the beginning and 105.5 MB in the end (delta: 46.1 MB). Peak memory consumption was 46.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 18518.98 ms. Allocated memory was 203.4 MB in the beginning and 921.2 MB in the end (delta: 717.8 MB). Free memory was 104.8 MB in the beginning and 458.0 MB in the end (delta: -353.1 MB). Peak memory consumption was 364.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.6s, 162 ProgramPointsBefore, 86 ProgramPointsAfterwards, 193 TransitionsBefore, 97 TransitionsAfterwards, 11490 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 41 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 24 ChoiceCompositions, 3760 VarBasedMoverChecksPositive, 156 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 51676 CheckedPairsTotal, 106 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L800] FCALL, FORK 0 pthread_create(&t1507, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L802] FCALL, FORK 0 pthread_create(&t1508, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L804] FCALL, FORK 0 pthread_create(&t1509, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L767] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L768] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L769] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L770] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L771] 3 y$r_buff0_thd3 = (_Bool)1 [L774] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L777] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L742] 2 x = 2 [L745] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L777] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L748] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L749] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L750] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L751] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L778] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L779] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L810] 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L811] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L812] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L813] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L814] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L817] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L818] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L819] 0 y$flush_delayed = weak$$choice2 [L820] 0 y$mem_tmp = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L821] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L821] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L822] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L823] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L823] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L824] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L824] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L825] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L825] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L827] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L827] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L828] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 153 locations, 2 error locations. Result: UNSAFE, OverallTime: 18.2s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 5.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1370 SDtfs, 1588 SDslu, 3249 SDs, 0 SdLazy, 2725 SolverSat, 217 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 137 GetRequests, 17 SyntacticMatches, 10 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 885 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25418occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.7s AutomataMinimizationTime, 13 MinimizatonAttempts, 4178 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 577 NumberOfCodeBlocks, 577 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 507 ConstructedInterpolants, 0 QuantifiedInterpolants, 122645 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...