/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/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-SP.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix051_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-1d1d2b5 [2020-10-22 02:00:06,793 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-22 02:00:06,796 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-22 02:00:06,818 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-22 02:00:06,819 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-22 02:00:06,820 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-22 02:00:06,821 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-22 02:00:06,823 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-22 02:00:06,824 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-22 02:00:06,825 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-22 02:00:06,826 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-22 02:00:06,827 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-22 02:00:06,827 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-22 02:00:06,828 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-22 02:00:06,829 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-22 02:00:06,830 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-22 02:00:06,831 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-22 02:00:06,831 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-22 02:00:06,833 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-22 02:00:06,835 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-22 02:00:06,836 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-22 02:00:06,837 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-22 02:00:06,838 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-22 02:00:06,839 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-22 02:00:06,841 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-22 02:00:06,841 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-22 02:00:06,841 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-22 02:00:06,842 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-22 02:00:06,843 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-22 02:00:06,843 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-22 02:00:06,844 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-22 02:00:06,844 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-22 02:00:06,845 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-22 02:00:06,846 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-22 02:00:06,847 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-22 02:00:06,847 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-22 02:00:06,848 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-22 02:00:06,848 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-22 02:00:06,848 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-22 02:00:06,849 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-22 02:00:06,850 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-22 02:00:06,850 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-SP.epf [2020-10-22 02:00:06,872 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-22 02:00:06,872 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-22 02:00:06,874 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-22 02:00:06,874 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-22 02:00:06,874 INFO L138 SettingsManager]: * Use SBE=true [2020-10-22 02:00:06,874 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-22 02:00:06,874 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-22 02:00:06,875 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-22 02:00:06,875 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-22 02:00:06,875 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-22 02:00:06,875 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-22 02:00:06,875 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-22 02:00:06,875 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-22 02:00:06,876 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-22 02:00:06,876 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-22 02:00:06,876 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-22 02:00:06,876 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-22 02:00:06,876 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-22 02:00:06,876 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-22 02:00:06,877 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-22 02:00:06,877 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-22 02:00:06,877 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-22 02:00:06,877 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-22 02:00:06,877 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-22 02:00:06,878 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-22 02:00:06,878 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-22 02:00:06,878 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-22 02:00:06,878 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2020-10-22 02:00:06,878 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-22 02:00:06,879 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-22 02:00:06,879 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2020-10-22 02:00:07,186 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-22 02:00:07,204 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-22 02:00:07,209 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-22 02:00:07,210 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-22 02:00:07,211 INFO L275 PluginConnector]: CDTParser initialized [2020-10-22 02:00:07,212 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix051_pso.opt.i [2020-10-22 02:00:07,274 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11ff77e16/bc881fee0b314a23b5f8e935fe8d5ce7/FLAGfaceeeb87 [2020-10-22 02:00:07,758 INFO L306 CDTParser]: Found 1 translation units. [2020-10-22 02:00:07,759 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix051_pso.opt.i [2020-10-22 02:00:07,780 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11ff77e16/bc881fee0b314a23b5f8e935fe8d5ce7/FLAGfaceeeb87 [2020-10-22 02:00:08,120 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11ff77e16/bc881fee0b314a23b5f8e935fe8d5ce7 [2020-10-22 02:00:08,131 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-22 02:00:08,138 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-22 02:00:08,139 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-22 02:00:08,140 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-22 02:00:08,143 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-22 02:00:08,144 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 02:00:08" (1/1) ... [2020-10-22 02:00:08,147 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2561c30c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:00:08, skipping insertion in model container [2020-10-22 02:00:08,148 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 02:00:08" (1/1) ... [2020-10-22 02:00:08,156 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-22 02:00:08,206 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-22 02:00:08,690 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-22 02:00:08,701 INFO L203 MainTranslator]: Completed pre-run [2020-10-22 02:00:08,780 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-22 02:00:08,861 INFO L208 MainTranslator]: Completed translation [2020-10-22 02:00:08,861 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:00:08 WrapperNode [2020-10-22 02:00:08,861 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-22 02:00:08,862 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-22 02:00:08,863 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-22 02:00:08,863 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-22 02:00:08,872 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:00:08" (1/1) ... [2020-10-22 02:00:08,891 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:00:08" (1/1) ... [2020-10-22 02:00:08,940 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-22 02:00:08,940 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-22 02:00:08,940 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-22 02:00:08,941 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-22 02:00:08,950 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:00:08" (1/1) ... [2020-10-22 02:00:08,951 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:00:08" (1/1) ... [2020-10-22 02:00:08,956 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:00:08" (1/1) ... [2020-10-22 02:00:08,956 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:00:08" (1/1) ... [2020-10-22 02:00:08,967 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:00:08" (1/1) ... [2020-10-22 02:00:08,971 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:00:08" (1/1) ... [2020-10-22 02:00:08,975 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:00:08" (1/1) ... [2020-10-22 02:00:08,981 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-22 02:00:08,981 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-22 02:00:08,981 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-22 02:00:08,981 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-22 02:00:08,982 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:00: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 [2020-10-22 02:00:09,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-22 02:00:09,052 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-22 02:00:09,052 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-22 02:00:09,052 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-22 02:00:09,052 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-22 02:00:09,052 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-22 02:00:09,053 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-22 02:00:09,053 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-22 02:00:09,053 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-22 02:00:09,053 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-22 02:00:09,053 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-10-22 02:00:09,054 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-10-22 02:00:09,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-22 02:00:09,054 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-22 02:00:09,054 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-22 02:00:09,054 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-22 02:00:09,056 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-22 02:00:10,996 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-22 02:00:10,996 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-10-22 02:00:10,999 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 02:00:10 BoogieIcfgContainer [2020-10-22 02:00:10,999 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-22 02:00:11,000 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-22 02:00:11,001 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-22 02:00:11,004 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-22 02:00:11,004 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 02:00:08" (1/3) ... [2020-10-22 02:00:11,005 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bb52463 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 02:00:11, skipping insertion in model container [2020-10-22 02:00:11,005 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:00:08" (2/3) ... [2020-10-22 02:00:11,006 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bb52463 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 02:00:11, skipping insertion in model container [2020-10-22 02:00:11,006 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 02:00:10" (3/3) ... [2020-10-22 02:00:11,008 INFO L111 eAbstractionObserver]: Analyzing ICFG mix051_pso.opt.i [2020-10-22 02:00:11,020 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-22 02:00:11,021 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-22 02:00:11,029 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-22 02:00:11,030 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-22 02:00:11,063 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:11,064 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:11,064 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:11,064 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:11,065 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:11,065 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:11,065 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:11,066 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:11,066 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:11,066 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:11,066 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:11,066 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:11,067 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:11,067 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:11,067 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:11,067 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:11,068 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:11,068 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:11,068 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:11,068 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:11,068 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:11,069 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:11,069 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:11,069 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:11,069 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:11,069 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:11,070 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:11,070 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:11,070 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:11,070 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:11,070 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:11,070 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:11,071 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:11,071 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:11,071 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:11,071 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:11,071 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:11,071 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:11,072 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:11,072 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:11,072 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:11,072 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:11,072 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:11,072 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:11,073 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:11,073 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:11,073 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:11,073 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:11,073 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:11,073 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:11,074 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:11,074 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:11,074 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:11,074 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:11,076 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:11,076 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:11,077 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:11,077 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:11,077 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:11,077 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:11,078 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:11,078 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:11,078 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:11,078 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:11,078 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:11,079 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:11,079 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:11,079 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:11,079 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:11,079 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:11,080 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:11,080 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:11,080 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:11,080 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:11,080 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:11,081 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:11,081 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:11,081 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:11,082 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:11,086 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:11,086 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:11,086 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:11,086 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:11,087 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:11,087 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:11,087 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:11,087 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:11,087 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:11,088 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:11,088 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:11,088 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:11,088 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:11,088 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:11,089 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:11,089 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:11,089 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:11,089 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:11,089 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:11,090 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:11,090 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:11,090 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:11,090 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:11,090 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:11,091 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:11,091 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:11,091 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:11,098 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:11,098 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:11,098 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:11,099 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:11,099 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:11,099 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:11,099 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:11,099 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:11,100 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:11,100 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:11,100 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:11,100 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:11,100 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:11,100 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:11,102 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:11,103 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:11,103 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:11,103 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:11,105 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:11,105 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:11,105 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:11,105 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:11,107 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-22 02:00:11,121 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-22 02:00:11,143 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-22 02:00:11,143 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-22 02:00:11,143 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-22 02:00:11,143 INFO L380 AbstractCegarLoop]: Backedges is MCR [2020-10-22 02:00:11,143 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-22 02:00:11,144 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-22 02:00:11,144 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-22 02:00:11,144 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-22 02:00:11,159 INFO L137 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-10-22 02:00:11,160 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 127 places, 117 transitions, 254 flow [2020-10-22 02:00:11,163 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 127 places, 117 transitions, 254 flow [2020-10-22 02:00:11,165 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 127 places, 117 transitions, 254 flow [2020-10-22 02:00:11,219 INFO L129 PetriNetUnfolder]: 3/113 cut-off events. [2020-10-22 02:00:11,219 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-22 02:00:11,227 INFO L80 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 113 events. 3/113 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 88 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 77. Up to 2 conditions per place. [2020-10-22 02:00:11,233 INFO L116 LiptonReduction]: Number of co-enabled transitions 2508 [2020-10-22 02:00:11,892 WARN L193 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2020-10-22 02:00:12,556 WARN L193 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-10-22 02:00:12,691 WARN L193 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-22 02:00:14,320 WARN L193 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2020-10-22 02:00:14,530 WARN L193 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2020-10-22 02:00:14,690 WARN L193 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2020-10-22 02:00:15,190 WARN L193 SmtUtils]: Spent 456.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 122 [2020-10-22 02:00:15,400 WARN L193 SmtUtils]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2020-10-22 02:00:15,419 INFO L131 LiptonReduction]: Checked pairs total: 6419 [2020-10-22 02:00:15,419 INFO L133 LiptonReduction]: Total number of compositions: 109 [2020-10-22 02:00:15,426 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 43 places, 31 transitions, 82 flow [2020-10-22 02:00:15,579 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 2090 states. [2020-10-22 02:00:15,582 INFO L276 IsEmpty]: Start isEmpty. Operand 2090 states. [2020-10-22 02:00:15,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-22 02:00:15,591 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:00:15,592 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:00:15,592 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:00:15,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:00:15,598 INFO L82 PathProgramCache]: Analyzing trace with hash 723835439, now seen corresponding path program 1 times [2020-10-22 02:00:15,625 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:00:15,625 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686145609] [2020-10-22 02:00:15,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:00:15,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:00:15,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 02:00:15,921 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686145609] [2020-10-22 02:00:15,921 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:00:15,921 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-22 02:00:15,923 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1704595179] [2020-10-22 02:00:15,924 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:00:15,927 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:00:15,943 INFO L252 McrAutomatonBuilder]: Finished intersection with 10 states and 9 transitions. [2020-10-22 02:00:15,943 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:00:15,948 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 02:00:15,949 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-22 02:00:15,949 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:00:15,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-22 02:00:15,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 02:00:15,966 INFO L87 Difference]: Start difference. First operand 2090 states. Second operand 3 states. [2020-10-22 02:00:16,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:00:16,040 INFO L93 Difference]: Finished difference Result 1770 states and 6672 transitions. [2020-10-22 02:00:16,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-22 02:00:16,042 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-22 02:00:16,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:00:16,077 INFO L225 Difference]: With dead ends: 1770 [2020-10-22 02:00:16,077 INFO L226 Difference]: Without dead ends: 1450 [2020-10-22 02:00:16,079 INFO L677 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 [2020-10-22 02:00:16,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1450 states. [2020-10-22 02:00:16,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1450 to 1450. [2020-10-22 02:00:16,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1450 states. [2020-10-22 02:00:16,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1450 states to 1450 states and 5376 transitions. [2020-10-22 02:00:16,225 INFO L78 Accepts]: Start accepts. Automaton has 1450 states and 5376 transitions. Word has length 9 [2020-10-22 02:00:16,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:00:16,226 INFO L481 AbstractCegarLoop]: Abstraction has 1450 states and 5376 transitions. [2020-10-22 02:00:16,226 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-22 02:00:16,226 INFO L276 IsEmpty]: Start isEmpty. Operand 1450 states and 5376 transitions. [2020-10-22 02:00:16,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-22 02:00:16,229 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:00:16,229 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:00:16,230 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-22 02:00:16,230 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:00:16,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:00:16,230 INFO L82 PathProgramCache]: Analyzing trace with hash -178830931, now seen corresponding path program 1 times [2020-10-22 02:00:16,232 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:00:16,232 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738258196] [2020-10-22 02:00:16,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:00:16,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:00:16,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 02:00:16,303 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738258196] [2020-10-22 02:00:16,304 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:00:16,304 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-22 02:00:16,304 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1185822089] [2020-10-22 02:00:16,304 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:00:16,306 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:00:16,308 INFO L252 McrAutomatonBuilder]: Finished intersection with 12 states and 11 transitions. [2020-10-22 02:00:16,308 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:00:16,308 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 02:00:16,310 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-22 02:00:16,310 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:00:16,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-22 02:00:16,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 02:00:16,311 INFO L87 Difference]: Start difference. First operand 1450 states and 5376 transitions. Second operand 3 states. [2020-10-22 02:00:16,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:00:16,333 INFO L93 Difference]: Finished difference Result 1410 states and 5194 transitions. [2020-10-22 02:00:16,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-22 02:00:16,334 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-10-22 02:00:16,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:00:16,346 INFO L225 Difference]: With dead ends: 1410 [2020-10-22 02:00:16,346 INFO L226 Difference]: Without dead ends: 1410 [2020-10-22 02:00:16,347 INFO L677 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 [2020-10-22 02:00:16,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1410 states. [2020-10-22 02:00:16,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1410 to 1410. [2020-10-22 02:00:16,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1410 states. [2020-10-22 02:00:16,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1410 states to 1410 states and 5194 transitions. [2020-10-22 02:00:16,398 INFO L78 Accepts]: Start accepts. Automaton has 1410 states and 5194 transitions. Word has length 11 [2020-10-22 02:00:16,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:00:16,399 INFO L481 AbstractCegarLoop]: Abstraction has 1410 states and 5194 transitions. [2020-10-22 02:00:16,399 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-22 02:00:16,399 INFO L276 IsEmpty]: Start isEmpty. Operand 1410 states and 5194 transitions. [2020-10-22 02:00:16,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-22 02:00:16,402 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:00:16,402 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:00:16,402 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-22 02:00:16,403 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:00:16,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:00:16,403 INFO L82 PathProgramCache]: Analyzing trace with hash 754517220, now seen corresponding path program 1 times [2020-10-22 02:00:16,407 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:00:16,407 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9362034] [2020-10-22 02:00:16,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:00:16,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:00:16,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 02:00:16,548 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9362034] [2020-10-22 02:00:16,549 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:00:16,549 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 02:00:16,549 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1297951710] [2020-10-22 02:00:16,549 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:00:16,551 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:00:16,554 INFO L252 McrAutomatonBuilder]: Finished intersection with 19 states and 24 transitions. [2020-10-22 02:00:16,554 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:00:16,653 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 02:00:16,654 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-22 02:00:16,654 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:00:16,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-22 02:00:16,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-22 02:00:16,655 INFO L87 Difference]: Start difference. First operand 1410 states and 5194 transitions. Second operand 4 states. [2020-10-22 02:00:16,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:00:16,712 INFO L93 Difference]: Finished difference Result 1430 states and 4778 transitions. [2020-10-22 02:00:16,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-22 02:00:16,713 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-10-22 02:00:16,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:00:16,721 INFO L225 Difference]: With dead ends: 1430 [2020-10-22 02:00:16,722 INFO L226 Difference]: Without dead ends: 1110 [2020-10-22 02:00:16,722 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-22 02:00:16,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1110 states. [2020-10-22 02:00:16,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1110 to 1110. [2020-10-22 02:00:16,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1110 states. [2020-10-22 02:00:16,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1110 states to 1110 states and 3694 transitions. [2020-10-22 02:00:16,764 INFO L78 Accepts]: Start accepts. Automaton has 1110 states and 3694 transitions. Word has length 12 [2020-10-22 02:00:16,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:00:16,765 INFO L481 AbstractCegarLoop]: Abstraction has 1110 states and 3694 transitions. [2020-10-22 02:00:16,765 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-22 02:00:16,765 INFO L276 IsEmpty]: Start isEmpty. Operand 1110 states and 3694 transitions. [2020-10-22 02:00:16,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-22 02:00:16,767 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:00:16,767 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:00:16,767 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-22 02:00:16,767 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:00:16,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:00:16,768 INFO L82 PathProgramCache]: Analyzing trace with hash -2009105501, now seen corresponding path program 1 times [2020-10-22 02:00:16,771 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:00:16,771 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88968322] [2020-10-22 02:00:16,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:00:16,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:00:16,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 02:00:16,814 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88968322] [2020-10-22 02:00:16,815 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:00:16,815 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-22 02:00:16,815 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [390827394] [2020-10-22 02:00:16,815 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:00:16,817 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:00:16,821 INFO L252 McrAutomatonBuilder]: Finished intersection with 33 states and 50 transitions. [2020-10-22 02:00:16,821 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:00:16,957 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 02:00:16,957 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-22 02:00:16,958 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:00:16,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-22 02:00:16,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 02:00:16,959 INFO L87 Difference]: Start difference. First operand 1110 states and 3694 transitions. Second operand 3 states. [2020-10-22 02:00:16,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:00:16,990 INFO L93 Difference]: Finished difference Result 1526 states and 4894 transitions. [2020-10-22 02:00:16,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-22 02:00:16,990 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2020-10-22 02:00:16,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:00:16,999 INFO L225 Difference]: With dead ends: 1526 [2020-10-22 02:00:17,000 INFO L226 Difference]: Without dead ends: 1154 [2020-10-22 02:00:17,000 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 02:00:17,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1154 states. [2020-10-22 02:00:17,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1154 to 1082. [2020-10-22 02:00:17,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1082 states. [2020-10-22 02:00:17,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1082 states to 1082 states and 3430 transitions. [2020-10-22 02:00:17,039 INFO L78 Accepts]: Start accepts. Automaton has 1082 states and 3430 transitions. Word has length 14 [2020-10-22 02:00:17,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:00:17,039 INFO L481 AbstractCegarLoop]: Abstraction has 1082 states and 3430 transitions. [2020-10-22 02:00:17,039 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-22 02:00:17,039 INFO L276 IsEmpty]: Start isEmpty. Operand 1082 states and 3430 transitions. [2020-10-22 02:00:17,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-22 02:00:17,041 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:00:17,042 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:00:17,042 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-22 02:00:17,042 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:00:17,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:00:17,043 INFO L82 PathProgramCache]: Analyzing trace with hash 36330094, now seen corresponding path program 1 times [2020-10-22 02:00:17,047 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:00:17,048 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672334225] [2020-10-22 02:00:17,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:00:17,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:00:17,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 02:00:17,116 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672334225] [2020-10-22 02:00:17,116 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:00:17,116 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-22 02:00:17,116 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [50138209] [2020-10-22 02:00:17,117 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:00:17,118 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:00:17,122 INFO L252 McrAutomatonBuilder]: Finished intersection with 27 states and 38 transitions. [2020-10-22 02:00:17,122 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:00:17,323 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [20570#(<= ~__unbuffered_cnt~0 0)] [2020-10-22 02:00:17,324 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-22 02:00:17,324 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:00:17,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-22 02:00:17,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-22 02:00:17,325 INFO L87 Difference]: Start difference. First operand 1082 states and 3430 transitions. Second operand 6 states. [2020-10-22 02:00:17,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:00:17,404 INFO L93 Difference]: Finished difference Result 922 states and 2637 transitions. [2020-10-22 02:00:17,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-22 02:00:17,411 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-10-22 02:00:17,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:00:17,419 INFO L225 Difference]: With dead ends: 922 [2020-10-22 02:00:17,419 INFO L226 Difference]: Without dead ends: 710 [2020-10-22 02:00:17,420 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-10-22 02:00:17,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2020-10-22 02:00:17,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 710. [2020-10-22 02:00:17,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 710 states. [2020-10-22 02:00:17,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 710 states and 1994 transitions. [2020-10-22 02:00:17,441 INFO L78 Accepts]: Start accepts. Automaton has 710 states and 1994 transitions. Word has length 14 [2020-10-22 02:00:17,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:00:17,442 INFO L481 AbstractCegarLoop]: Abstraction has 710 states and 1994 transitions. [2020-10-22 02:00:17,442 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-22 02:00:17,442 INFO L276 IsEmpty]: Start isEmpty. Operand 710 states and 1994 transitions. [2020-10-22 02:00:17,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-22 02:00:17,444 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:00:17,444 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:00:17,444 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-22 02:00:17,445 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:00:17,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:00:17,446 INFO L82 PathProgramCache]: Analyzing trace with hash -1063562056, now seen corresponding path program 1 times [2020-10-22 02:00:17,447 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:00:17,447 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344910307] [2020-10-22 02:00:17,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:00:17,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:00:17,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 02:00:17,569 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344910307] [2020-10-22 02:00:17,571 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:00:17,571 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-22 02:00:17,572 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [988538513] [2020-10-22 02:00:17,572 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:00:17,576 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:00:17,586 INFO L252 McrAutomatonBuilder]: Finished intersection with 78 states and 151 transitions. [2020-10-22 02:00:17,587 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:00:18,082 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [22923#(<= ~__unbuffered_cnt~0 0)] [2020-10-22 02:00:18,083 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-22 02:00:18,083 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:00:18,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-22 02:00:18,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-22 02:00:18,084 INFO L87 Difference]: Start difference. First operand 710 states and 1994 transitions. Second operand 7 states. [2020-10-22 02:00:18,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:00:18,174 INFO L93 Difference]: Finished difference Result 608 states and 1667 transitions. [2020-10-22 02:00:18,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-22 02:00:18,175 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2020-10-22 02:00:18,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:00:18,180 INFO L225 Difference]: With dead ends: 608 [2020-10-22 02:00:18,180 INFO L226 Difference]: Without dead ends: 531 [2020-10-22 02:00:18,182 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2020-10-22 02:00:18,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2020-10-22 02:00:18,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 531. [2020-10-22 02:00:18,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 531 states. [2020-10-22 02:00:18,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 1475 transitions. [2020-10-22 02:00:18,198 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 1475 transitions. Word has length 17 [2020-10-22 02:00:18,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:00:18,198 INFO L481 AbstractCegarLoop]: Abstraction has 531 states and 1475 transitions. [2020-10-22 02:00:18,198 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-22 02:00:18,198 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 1475 transitions. [2020-10-22 02:00:18,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-22 02:00:18,201 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:00:18,201 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:00:18,201 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-22 02:00:18,202 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:00:18,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:00:18,202 INFO L82 PathProgramCache]: Analyzing trace with hash -1303015582, now seen corresponding path program 1 times [2020-10-22 02:00:18,203 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:00:18,203 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895618709] [2020-10-22 02:00:18,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:00:18,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:00:18,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 02:00:18,384 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895618709] [2020-10-22 02:00:18,384 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:00:18,384 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-22 02:00:18,384 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1383918625] [2020-10-22 02:00:18,385 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:00:18,388 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:00:18,416 INFO L252 McrAutomatonBuilder]: Finished intersection with 111 states and 224 transitions. [2020-10-22 02:00:18,416 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:00:18,847 WARN L193 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 215 DAG size of output: 3 [2020-10-22 02:00:19,324 WARN L193 SmtUtils]: Spent 473.00 ms on a formula simplification. DAG size of input: 229 DAG size of output: 3 [2020-10-22 02:00:20,106 WARN L193 SmtUtils]: Spent 779.00 ms on a formula simplification. DAG size of input: 227 DAG size of output: 3 [2020-10-22 02:00:20,720 WARN L193 SmtUtils]: Spent 571.00 ms on a formula simplification. DAG size of input: 258 DAG size of output: 3 [2020-10-22 02:00:21,385 WARN L193 SmtUtils]: Spent 662.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 3 [2020-10-22 02:00:22,387 WARN L193 SmtUtils]: Spent 960.00 ms on a formula simplification. DAG size of input: 257 DAG size of output: 3 [2020-10-22 02:00:23,019 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [24607#(<= ~__unbuffered_cnt~0 0)] [2020-10-22 02:00:23,019 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-22 02:00:23,020 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:00:23,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-22 02:00:23,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-10-22 02:00:23,020 INFO L87 Difference]: Start difference. First operand 531 states and 1475 transitions. Second operand 8 states. [2020-10-22 02:00:23,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:00:23,104 INFO L93 Difference]: Finished difference Result 507 states and 1426 transitions. [2020-10-22 02:00:23,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-22 02:00:23,105 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2020-10-22 02:00:23,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:00:23,108 INFO L225 Difference]: With dead ends: 507 [2020-10-22 02:00:23,108 INFO L226 Difference]: Without dead ends: 313 [2020-10-22 02:00:23,109 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 56 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2020-10-22 02:00:23,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2020-10-22 02:00:23,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 313. [2020-10-22 02:00:23,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2020-10-22 02:00:23,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 849 transitions. [2020-10-22 02:00:23,119 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 849 transitions. Word has length 20 [2020-10-22 02:00:23,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:00:23,119 INFO L481 AbstractCegarLoop]: Abstraction has 313 states and 849 transitions. [2020-10-22 02:00:23,119 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-22 02:00:23,120 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 849 transitions. [2020-10-22 02:00:23,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-22 02:00:23,121 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:00:23,121 INFO L422 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] [2020-10-22 02:00:23,122 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-22 02:00:23,122 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:00:23,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:00:23,122 INFO L82 PathProgramCache]: Analyzing trace with hash -1657089697, now seen corresponding path program 1 times [2020-10-22 02:00:23,123 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:00:23,124 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242720986] [2020-10-22 02:00:23,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:00:23,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:00:23,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 02:00:23,180 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242720986] [2020-10-22 02:00:23,180 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:00:23,180 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 02:00:23,181 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [222235419] [2020-10-22 02:00:23,181 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:00:23,185 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:00:23,229 INFO L252 McrAutomatonBuilder]: Finished intersection with 123 states and 241 transitions. [2020-10-22 02:00:23,229 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:00:23,656 WARN L193 SmtUtils]: Spent 423.00 ms on a formula simplification. DAG size of input: 215 DAG size of output: 3 [2020-10-22 02:00:24,336 WARN L193 SmtUtils]: Spent 605.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 3 [2020-10-22 02:00:24,947 WARN L193 SmtUtils]: Spent 596.00 ms on a formula simplification. DAG size of input: 227 DAG size of output: 3 [2020-10-22 02:00:25,628 WARN L193 SmtUtils]: Spent 562.00 ms on a formula simplification. DAG size of input: 257 DAG size of output: 3 [2020-10-22 02:00:26,253 WARN L193 SmtUtils]: Spent 485.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 3 [2020-10-22 02:00:26,928 WARN L193 SmtUtils]: Spent 472.00 ms on a formula simplification. DAG size of input: 257 DAG size of output: 3 [2020-10-22 02:00:27,094 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 02:00:27,094 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-22 02:00:27,094 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:00:27,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-22 02:00:27,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-22 02:00:27,095 INFO L87 Difference]: Start difference. First operand 313 states and 849 transitions. Second operand 4 states. [2020-10-22 02:00:27,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:00:27,120 INFO L93 Difference]: Finished difference Result 423 states and 1136 transitions. [2020-10-22 02:00:27,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-22 02:00:27,120 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2020-10-22 02:00:27,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:00:27,122 INFO L225 Difference]: With dead ends: 423 [2020-10-22 02:00:27,122 INFO L226 Difference]: Without dead ends: 145 [2020-10-22 02:00:27,122 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-22 02:00:27,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2020-10-22 02:00:27,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2020-10-22 02:00:27,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2020-10-22 02:00:27,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 351 transitions. [2020-10-22 02:00:27,127 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 351 transitions. Word has length 24 [2020-10-22 02:00:27,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:00:27,127 INFO L481 AbstractCegarLoop]: Abstraction has 145 states and 351 transitions. [2020-10-22 02:00:27,127 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-22 02:00:27,127 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 351 transitions. [2020-10-22 02:00:27,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-22 02:00:27,128 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:00:27,128 INFO L422 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] [2020-10-22 02:00:27,128 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-22 02:00:27,129 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:00:27,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:00:27,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1533332317, now seen corresponding path program 2 times [2020-10-22 02:00:27,130 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:00:27,131 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576516399] [2020-10-22 02:00:27,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:00:27,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:00:27,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 02:00:27,185 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576516399] [2020-10-22 02:00:27,185 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:00:27,186 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 02:00:27,186 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [791432116] [2020-10-22 02:00:27,186 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:00:27,193 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:00:27,272 INFO L252 McrAutomatonBuilder]: Finished intersection with 72 states and 126 transitions. [2020-10-22 02:00:27,272 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:00:27,513 WARN L193 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 215 DAG size of output: 3 [2020-10-22 02:00:27,961 WARN L193 SmtUtils]: Spent 418.00 ms on a formula simplification. DAG size of input: 227 DAG size of output: 3 [2020-10-22 02:00:28,046 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 02:00:28,046 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-22 02:00:28,047 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:00:28,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-22 02:00:28,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-22 02:00:28,048 INFO L87 Difference]: Start difference. First operand 145 states and 351 transitions. Second operand 4 states. [2020-10-22 02:00:28,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:00:28,071 INFO L93 Difference]: Finished difference Result 183 states and 437 transitions. [2020-10-22 02:00:28,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-22 02:00:28,071 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2020-10-22 02:00:28,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:00:28,072 INFO L225 Difference]: With dead ends: 183 [2020-10-22 02:00:28,072 INFO L226 Difference]: Without dead ends: 79 [2020-10-22 02:00:28,073 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-22 02:00:28,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2020-10-22 02:00:28,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2020-10-22 02:00:28,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-10-22 02:00:28,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 165 transitions. [2020-10-22 02:00:28,079 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 165 transitions. Word has length 24 [2020-10-22 02:00:28,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:00:28,079 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 165 transitions. [2020-10-22 02:00:28,079 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-22 02:00:28,079 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 165 transitions. [2020-10-22 02:00:28,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-22 02:00:28,080 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:00:28,080 INFO L422 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] [2020-10-22 02:00:28,080 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-22 02:00:28,081 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:00:28,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:00:28,081 INFO L82 PathProgramCache]: Analyzing trace with hash -1956134985, now seen corresponding path program 3 times [2020-10-22 02:00:28,082 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:00:28,082 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667993787] [2020-10-22 02:00:28,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:00:28,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:00:28,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 02:00:28,242 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667993787] [2020-10-22 02:00:28,242 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:00:28,243 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-22 02:00:28,243 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1686874715] [2020-10-22 02:00:28,243 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:00:28,247 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:00:28,279 INFO L252 McrAutomatonBuilder]: Finished intersection with 80 states and 137 transitions. [2020-10-22 02:00:28,280 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:00:28,525 WARN L193 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 227 DAG size of output: 212 [2020-10-22 02:00:28,620 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term [2020-10-22 02:00:28,620 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:00:28,622 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term [2020-10-22 02:00:28,622 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:00:28,623 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term [2020-10-22 02:00:28,623 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:00:28,625 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-22 02:00:28,625 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:00:28,627 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-22 02:00:28,627 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:00:28,628 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-22 02:00:28,628 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:00:28,630 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 2, 4, 4, 3, 3, 2, 1] term [2020-10-22 02:00:28,630 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:00:28,631 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-22 02:00:28,631 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:00:28,632 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-22 02:00:28,632 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:00:28,635 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:00:28,641 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:00:28,651 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:00:28,668 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:00:28,698 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:00:28,804 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 2, 2, 1] term [2020-10-22 02:00:28,805 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:00:28,805 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 1] term [2020-10-22 02:00:28,806 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:00:28,810 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 02:00:28,810 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:00:28,811 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:00:28,814 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:00:28,817 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:00:28,823 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:00:28,827 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:00:28,834 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:00:28,836 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:00:28,837 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:00:28,842 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:00:28,854 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:00:28,856 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:00:28,857 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:00:28,860 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:00:28,868 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:00:28,924 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:00:28,948 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:00:28,954 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:00:28,955 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:00:28,963 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:00:29,014 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:00:29,024 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:00:29,037 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:00:29,038 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:00:29,040 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:00:29,044 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:00:29,045 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:00:29,046 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:00:29,048 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:00:29,055 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:00:29,183 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:00:29,201 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:00:29,203 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-22 02:00:29,204 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:00:29,370 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 2, 2, 1] term [2020-10-22 02:00:29,370 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:00:29,371 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 1] term [2020-10-22 02:00:29,371 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:00:29,373 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-22 02:00:29,373 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:00:29,374 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-22 02:00:29,374 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:00:29,376 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:00:29,380 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:00:29,383 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:00:29,388 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:00:29,389 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:00:29,389 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:00:29,395 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:00:29,404 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:00:29,405 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 02:00:29,411 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:00:29,417 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:00:29,421 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:00:29,424 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:00:29,425 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:00:29,426 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:00:29,428 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:00:29,434 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:00:29,439 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:00:29,442 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-22 02:00:29,442 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:00:29,519 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term [2020-10-22 02:00:29,519 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:00:29,521 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term [2020-10-22 02:00:29,522 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:00:29,522 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term [2020-10-22 02:00:29,522 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:00:29,524 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-22 02:00:29,524 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:00:29,525 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-22 02:00:29,526 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:00:29,528 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-22 02:00:29,528 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:00:29,529 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-22 02:00:29,530 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:00:29,531 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-22 02:00:29,531 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:00:29,532 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-22 02:00:29,532 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:00:29,533 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:00:29,535 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:00:29,540 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:00:29,550 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:00:29,578 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:00:29,670 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [26820#(and (not (= ~z$w_buff0~0 0)) (not (= (mod ~z$w_buff0_used~0 256) 0)) (not (= (mod ~z$r_buff0_thd4~0 256) 0))), 26821#(and (not (= ~z~0 0)) (= (mod ~z$w_buff0_used~0 256) 0))] [2020-10-22 02:00:29,670 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-22 02:00:29,671 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:00:29,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-22 02:00:29,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-22 02:00:29,671 INFO L87 Difference]: Start difference. First operand 79 states and 165 transitions. Second operand 7 states. [2020-10-22 02:00:29,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:00:29,739 INFO L93 Difference]: Finished difference Result 97 states and 199 transitions. [2020-10-22 02:00:29,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-22 02:00:29,739 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-10-22 02:00:29,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:00:29,740 INFO L225 Difference]: With dead ends: 97 [2020-10-22 02:00:29,740 INFO L226 Difference]: Without dead ends: 51 [2020-10-22 02:00:29,740 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2020-10-22 02:00:29,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2020-10-22 02:00:29,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2020-10-22 02:00:29,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-10-22 02:00:29,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 89 transitions. [2020-10-22 02:00:29,743 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 89 transitions. Word has length 24 [2020-10-22 02:00:29,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:00:29,743 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 89 transitions. [2020-10-22 02:00:29,744 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-22 02:00:29,744 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 89 transitions. [2020-10-22 02:00:29,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-22 02:00:29,744 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:00:29,744 INFO L422 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] [2020-10-22 02:00:29,744 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-22 02:00:29,745 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:00:29,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:00:29,745 INFO L82 PathProgramCache]: Analyzing trace with hash -1952781065, now seen corresponding path program 4 times [2020-10-22 02:00:29,746 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:00:29,747 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159255138] [2020-10-22 02:00:29,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:00:29,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-22 02:00:29,833 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-22 02:00:29,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-22 02:00:29,873 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-22 02:00:29,917 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-22 02:00:29,917 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-22 02:00:29,917 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-22 02:00:29,919 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-22 02:00:29,949 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [922] [922] L856-->L864: Formula: (let ((.cse7 (= (mod ~z$w_buff0_used~0_In-567315910 256) 0)) (.cse6 (= (mod ~z$r_buff0_thd0~0_In-567315910 256) 0)) (.cse8 (= (mod ~z$r_buff1_thd0~0_In-567315910 256) 0)) (.cse9 (= (mod ~z$w_buff1_used~0_In-567315910 256) 0))) (let ((.cse1 (not .cse9)) (.cse2 (not .cse8)) (.cse0 (or .cse8 .cse9)) (.cse4 (not .cse6)) (.cse5 (not .cse7)) (.cse3 (or .cse6 .cse7))) (and (= ~z$r_buff0_thd0~0_In-567315910 ~z$r_buff0_thd0~0_Out-567315910) (= |ULTIMATE.start_assume_abort_if_not_#in~cond_Out-567315910| ULTIMATE.start_assume_abort_if_not_~cond_Out-567315910) (or (and (or (and (= ~z~0_In-567315910 ~z~0_Out-567315910) .cse0) (and .cse1 .cse2 (= ~z$w_buff1~0_In-567315910 ~z~0_Out-567315910))) .cse3) (and .cse4 .cse5 (= ~z~0_Out-567315910 ~z$w_buff0~0_In-567315910))) (= ~z$r_buff1_thd0~0_In-567315910 ~z$r_buff1_thd0~0_Out-567315910) (or (and .cse1 .cse2 (= ~z$w_buff1_used~0_Out-567315910 0)) (and (= ~z$w_buff1_used~0_Out-567315910 ~z$w_buff1_used~0_In-567315910) .cse0)) (or (and .cse4 .cse5 (= 0 ~z$w_buff0_used~0_Out-567315910)) (and (= ~z$w_buff0_used~0_In-567315910 ~z$w_buff0_used~0_Out-567315910) .cse3)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond_Out-567315910| (mod ~main$tmp_guard0~0_In-567315910 256)) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out-567315910 0))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-567315910, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-567315910, ~z$w_buff0~0=~z$w_buff0~0_In-567315910, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-567315910, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-567315910, ~z$w_buff1~0=~z$w_buff1~0_In-567315910, ~z~0=~z~0_In-567315910, ~main$tmp_guard0~0=~main$tmp_guard0~0_In-567315910} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_Out-567315910, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-567315910|, ~z$w_buff0~0=~z$w_buff0~0_In-567315910, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out-567315910, ~z$w_buff1~0=~z$w_buff1~0_In-567315910, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-567315910|, ~main$tmp_guard0~0=~main$tmp_guard0~0_In-567315910, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-567315910|, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-567315910|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_Out-567315910|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_Out-567315910, ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-567315910|, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-567315910|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-567315910, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out-567315910, ~z~0=~z~0_Out-567315910} AuxVars[] AssignedVars[~z$w_buff0_used~0, ULTIMATE.start_main_#t~ite39, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_assume_abort_if_not_#in~cond, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_assume_abort_if_not_~cond, ~z$r_buff1_thd0~0, ~z~0] because there is no mapped edge [2020-10-22 02:00:29,958 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:00:29,958 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [807] [2020-10-22 02:00:29,961 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:00:29,961 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:00:29,961 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:00:29,961 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:00:29,962 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:00:29,962 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:00:29,962 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:00:29,962 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:00:29,962 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:00:29,963 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:00:29,963 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:00:29,963 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:00:29,964 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:00:29,964 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:00:29,964 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:00:29,964 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:00:29,965 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:00:29,965 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:00:29,965 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:00:29,965 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:00:29,966 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:00:29,966 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:00:29,966 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:00:29,966 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:00:29,967 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:00:29,968 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:00:29,968 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:00:29,968 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:00:29,969 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:00:29,969 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:00:29,969 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:00:29,969 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:00:29,969 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:00:29,969 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:00:30,081 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 02:00:30 BasicIcfg [2020-10-22 02:00:30,081 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-22 02:00:30,082 INFO L168 Benchmark]: Toolchain (without parser) took 21949.99 ms. Allocated memory was 144.7 MB in the beginning and 429.4 MB in the end (delta: 284.7 MB). Free memory was 100.2 MB in the beginning and 209.6 MB in the end (delta: -109.4 MB). Peak memory consumption was 175.3 MB. Max. memory is 7.1 GB. [2020-10-22 02:00:30,083 INFO L168 Benchmark]: CDTParser took 3.05 ms. Allocated memory is still 144.7 MB. Free memory was 120.7 MB in the beginning and 120.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-10-22 02:00:30,087 INFO L168 Benchmark]: CACSL2BoogieTranslator took 722.66 ms. Allocated memory was 144.7 MB in the beginning and 202.4 MB in the end (delta: 57.7 MB). Free memory was 99.4 MB in the beginning and 152.9 MB in the end (delta: -53.6 MB). Peak memory consumption was 20.7 MB. Max. memory is 7.1 GB. [2020-10-22 02:00:30,087 INFO L168 Benchmark]: Boogie Procedure Inliner took 77.71 ms. Allocated memory is still 202.4 MB. Free memory was 152.9 MB in the beginning and 150.1 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2020-10-22 02:00:30,088 INFO L168 Benchmark]: Boogie Preprocessor took 40.51 ms. Allocated memory is still 202.4 MB. Free memory was 150.1 MB in the beginning and 148.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2020-10-22 02:00:30,093 INFO L168 Benchmark]: RCFGBuilder took 2018.09 ms. Allocated memory was 202.4 MB in the beginning and 249.0 MB in the end (delta: 46.7 MB). Free memory was 148.1 MB in the beginning and 203.2 MB in the end (delta: -55.1 MB). Peak memory consumption was 102.1 MB. Max. memory is 7.1 GB. [2020-10-22 02:00:30,094 INFO L168 Benchmark]: TraceAbstraction took 19080.51 ms. Allocated memory was 249.0 MB in the beginning and 429.4 MB in the end (delta: 180.4 MB). Free memory was 201.4 MB in the beginning and 209.6 MB in the end (delta: -8.2 MB). Peak memory consumption was 172.1 MB. Max. memory is 7.1 GB. [2020-10-22 02:00:30,107 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 3.05 ms. Allocated memory is still 144.7 MB. Free memory was 120.7 MB in the beginning and 120.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 722.66 ms. Allocated memory was 144.7 MB in the beginning and 202.4 MB in the end (delta: 57.7 MB). Free memory was 99.4 MB in the beginning and 152.9 MB in the end (delta: -53.6 MB). Peak memory consumption was 20.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 77.71 ms. Allocated memory is still 202.4 MB. Free memory was 152.9 MB in the beginning and 150.1 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.51 ms. Allocated memory is still 202.4 MB. Free memory was 150.1 MB in the beginning and 148.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2018.09 ms. Allocated memory was 202.4 MB in the beginning and 249.0 MB in the end (delta: 46.7 MB). Free memory was 148.1 MB in the beginning and 203.2 MB in the end (delta: -55.1 MB). Peak memory consumption was 102.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 19080.51 ms. Allocated memory was 249.0 MB in the beginning and 429.4 MB in the end (delta: 180.4 MB). Free memory was 201.4 MB in the beginning and 209.6 MB in the end (delta: -8.2 MB). Peak memory consumption was 172.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1359 VarBasedMoverChecksPositive, 38 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 101 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 4.2s, 127 PlacesBefore, 43 PlacesAfterwards, 117 TransitionsBefore, 31 TransitionsAfterwards, 2508 CoEnabledTransitionPairs, 7 FixpointIterations, 40 TrivialSequentialCompositions, 57 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 2 ChoiceCompositions, 109 TotalNumberOfCompositions, 6419 MoverChecksTotal - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int a = 0; [L719] 0 _Bool main$tmp_guard0; [L720] 0 _Bool main$tmp_guard1; [L722] 0 int x = 0; [L724] 0 int y = 0; [L726] 0 int z = 0; [L727] 0 _Bool z$flush_delayed; [L728] 0 int z$mem_tmp; [L729] 0 _Bool z$r_buff0_thd0; [L730] 0 _Bool z$r_buff0_thd1; [L731] 0 _Bool z$r_buff0_thd2; [L732] 0 _Bool z$r_buff0_thd3; [L733] 0 _Bool z$r_buff0_thd4; [L734] 0 _Bool z$r_buff1_thd0; [L735] 0 _Bool z$r_buff1_thd1; [L736] 0 _Bool z$r_buff1_thd2; [L737] 0 _Bool z$r_buff1_thd3; [L738] 0 _Bool z$r_buff1_thd4; [L739] 0 _Bool z$read_delayed; [L740] 0 int *z$read_delayed_var; [L741] 0 int z$w_buff0; [L742] 0 _Bool z$w_buff0_used; [L743] 0 int z$w_buff1; [L744] 0 _Bool z$w_buff1_used; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L846] 0 pthread_t t1365; [L847] FCALL, FORK 0 pthread_create(&t1365, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L848] 0 pthread_t t1366; [L849] FCALL, FORK 0 pthread_create(&t1366, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L850] 0 pthread_t t1367; [L851] FCALL, FORK 0 pthread_create(&t1367, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=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=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L852] 0 pthread_t t1368; [L853] FCALL, FORK 0 pthread_create(&t1368, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=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=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L808] 4 z$w_buff1 = z$w_buff0 [L809] 4 z$w_buff0 = 1 [L810] 4 z$w_buff1_used = z$w_buff0_used [L811] 4 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 4 !(!expression) [L813] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L814] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L815] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L816] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L817] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L818] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=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=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L821] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=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=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L750] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, 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=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, 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=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L760] 1 return 0; [L765] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0: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=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0: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=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] 3 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0: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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L783] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L784] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L785] 3 z$flush_delayed = weak$$choice2 [L786] 3 z$mem_tmp = z [L787] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L787] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1 [L787] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L787] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L788] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L788] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L789] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L789] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L790] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L790] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L791] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L791] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L791] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0 [L791] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L791] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L791] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L792] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L792] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L793] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L793] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L793] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L793] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L794] 3 __unbuffered_p2_EAX = z [L795] EXPR 3 z$flush_delayed ? z$mem_tmp : z [L795] 3 z = z$flush_delayed ? z$mem_tmp : z [L796] 3 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L773] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L775] 2 return 0; [L824] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L824] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L825] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L825] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L826] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L826] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L827] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L827] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L828] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L828] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L831] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L833] 4 return 0; [L801] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L803] 3 return 0; [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L866] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 0) [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix051_pso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 115 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 18.7s, OverallIterations: 11, TraceHistogramMax: 1, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.4s, HoareTripleCheckerStatistics: 278 SDtfs, 390 SDslu, 483 SDs, 0 SdLazy, 145 SolverSat, 80 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 274 GetRequests, 225 SyntacticMatches, 7 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2090occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 10 MinimizatonAttempts, 72 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 193 NumberOfCodeBlocks, 193 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 159 ConstructedInterpolants, 0 QuantifiedInterpolants, 8782 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...