/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.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-WP.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix056_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7a177ad [2020-11-09 15:26:05,090 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-09 15:26:05,096 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-09 15:26:05,163 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-09 15:26:05,163 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-09 15:26:05,169 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-09 15:26:05,172 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-09 15:26:05,180 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-09 15:26:05,183 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-09 15:26:05,190 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-09 15:26:05,192 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-09 15:26:05,194 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-09 15:26:05,194 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-09 15:26:05,197 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-09 15:26:05,200 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-09 15:26:05,202 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-09 15:26:05,204 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-09 15:26:05,208 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-09 15:26:05,215 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-09 15:26:05,224 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-09 15:26:05,226 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-09 15:26:05,228 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-09 15:26:05,230 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-09 15:26:05,233 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-09 15:26:05,242 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-09 15:26:05,243 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-09 15:26:05,243 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-09 15:26:05,246 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-09 15:26:05,246 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-09 15:26:05,247 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-09 15:26:05,248 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-09 15:26:05,249 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-09 15:26:05,251 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-09 15:26:05,252 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-09 15:26:05,253 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-09 15:26:05,254 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-09 15:26:05,255 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-09 15:26:05,256 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-09 15:26:05,256 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-09 15:26:05,257 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-09 15:26:05,258 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-09 15:26:05,259 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-WP.epf [2020-11-09 15:26:05,318 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-09 15:26:05,318 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-09 15:26:05,323 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-09 15:26:05,324 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-09 15:26:05,324 INFO L138 SettingsManager]: * Use SBE=true [2020-11-09 15:26:05,324 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-09 15:26:05,324 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-09 15:26:05,324 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-09 15:26:05,325 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-09 15:26:05,325 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-09 15:26:05,326 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-09 15:26:05,326 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-09 15:26:05,327 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-09 15:26:05,327 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-09 15:26:05,327 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-09 15:26:05,327 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-09 15:26:05,327 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-09 15:26:05,328 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-09 15:26:05,328 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-09 15:26:05,328 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-09 15:26:05,328 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-09 15:26:05,329 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-09 15:26:05,329 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-09 15:26:05,329 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-11-09 15:26:05,329 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-09 15:26:05,329 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-09 15:26:05,330 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-09 15:26:05,330 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2020-11-09 15:26:05,330 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-11-09 15:26:05,330 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-09 15:26:05,330 INFO L138 SettingsManager]: * Interpolant automaton=MCR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-11-09 15:26:05,774 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-09 15:26:05,807 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-09 15:26:05,810 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-09 15:26:05,812 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-09 15:26:05,812 INFO L275 PluginConnector]: CDTParser initialized [2020-11-09 15:26:05,813 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix056_tso.oepc.i [2020-11-09 15:26:05,896 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85722a8c7/4e60ce2cf9834851b8ea8e62aa4ee4b2/FLAG9907fc5ed [2020-11-09 15:26:06,615 INFO L306 CDTParser]: Found 1 translation units. [2020-11-09 15:26:06,616 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix056_tso.oepc.i [2020-11-09 15:26:06,632 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85722a8c7/4e60ce2cf9834851b8ea8e62aa4ee4b2/FLAG9907fc5ed [2020-11-09 15:26:06,843 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85722a8c7/4e60ce2cf9834851b8ea8e62aa4ee4b2 [2020-11-09 15:26:06,847 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-09 15:26:06,855 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-11-09 15:26:06,857 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-09 15:26:06,858 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-09 15:26:06,862 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-09 15:26:06,862 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 03:26:06" (1/1) ... [2020-11-09 15:26:06,866 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61396c73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:26:06, skipping insertion in model container [2020-11-09 15:26:06,867 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 03:26:06" (1/1) ... [2020-11-09 15:26:06,875 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-09 15:26:06,946 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-09 15:26:07,469 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-09 15:26:07,487 INFO L203 MainTranslator]: Completed pre-run [2020-11-09 15:26:07,640 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-09 15:26:07,747 INFO L208 MainTranslator]: Completed translation [2020-11-09 15:26:07,748 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:26:07 WrapperNode [2020-11-09 15:26:07,748 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-09 15:26:07,749 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-09 15:26:07,749 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-09 15:26:07,749 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-09 15:26:07,758 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:26:07" (1/1) ... [2020-11-09 15:26:07,777 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:26:07" (1/1) ... [2020-11-09 15:26:07,822 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-09 15:26:07,826 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-09 15:26:07,826 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-09 15:26:07,826 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-09 15:26:07,838 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:26:07" (1/1) ... [2020-11-09 15:26:07,839 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:26:07" (1/1) ... [2020-11-09 15:26:07,844 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:26:07" (1/1) ... [2020-11-09 15:26:07,844 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:26:07" (1/1) ... [2020-11-09 15:26:07,855 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:26:07" (1/1) ... [2020-11-09 15:26:07,859 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:26:07" (1/1) ... [2020-11-09 15:26:07,863 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:26:07" (1/1) ... [2020-11-09 15:26:07,868 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-09 15:26:07,869 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-09 15:26:07,869 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-09 15:26:07,869 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-09 15:26:07,870 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:26:07" (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-11-09 15:26:07,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-09 15:26:07,954 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-11-09 15:26:07,954 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-09 15:26:07,954 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-09 15:26:07,954 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-11-09 15:26:07,954 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-11-09 15:26:07,955 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-11-09 15:26:07,955 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-11-09 15:26:07,955 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-11-09 15:26:07,955 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-11-09 15:26:07,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-09 15:26:07,955 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-11-09 15:26:07,956 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-09 15:26:07,956 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-09 15:26:07,958 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-11-09 15:26:10,123 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-09 15:26:10,124 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-11-09 15:26:10,126 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:26:10 BoogieIcfgContainer [2020-11-09 15:26:10,126 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-09 15:26:10,128 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-09 15:26:10,128 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-09 15:26:10,132 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-09 15:26:10,132 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 03:26:06" (1/3) ... [2020-11-09 15:26:10,133 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64654285 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 03:26:10, skipping insertion in model container [2020-11-09 15:26:10,133 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:26:07" (2/3) ... [2020-11-09 15:26:10,134 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64654285 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 03:26:10, skipping insertion in model container [2020-11-09 15:26:10,134 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:26:10" (3/3) ... [2020-11-09 15:26:10,136 INFO L111 eAbstractionObserver]: Analyzing ICFG mix056_tso.oepc.i [2020-11-09 15:26:10,154 WARN L168 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-11-09 15:26:10,154 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-11-09 15:26:10,159 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-11-09 15:26:10,160 INFO L351 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-11-09 15:26:10,199 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:10,199 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:10,200 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:10,200 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:10,200 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:10,200 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:10,200 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:10,200 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:10,201 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:10,201 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:10,201 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:10,201 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:10,202 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:10,202 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:10,202 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:10,202 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:10,202 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:10,203 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:10,203 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:10,203 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:10,204 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:10,204 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:10,204 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:10,204 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:10,204 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:10,204 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:10,205 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:10,205 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:10,205 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:10,205 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:10,206 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:10,206 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:10,206 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:10,206 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:10,207 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:10,207 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:10,207 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:10,207 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:10,208 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:10,208 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:10,208 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:10,208 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:10,209 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:10,209 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:10,209 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:10,209 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:10,209 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:10,209 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:10,210 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:10,210 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:10,210 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:10,210 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:10,210 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:10,210 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:10,211 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:10,211 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:10,211 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:10,211 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:10,211 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:10,211 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:10,212 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:10,212 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:10,212 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:10,212 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:10,212 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:10,212 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:10,213 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:10,213 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:10,213 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:10,213 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:10,213 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:10,214 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:10,214 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:10,214 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:10,214 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:10,215 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:10,215 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:10,215 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:10,215 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:10,215 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:10,216 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:10,216 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:10,216 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:10,217 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:10,219 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:10,219 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:10,220 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:10,220 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:10,220 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:10,220 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:10,220 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:10,220 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:10,221 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:10,221 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:10,221 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:10,221 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:10,221 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:10,222 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:10,225 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:10,225 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:10,225 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:10,225 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:10,227 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:10,227 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:10,228 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:10,228 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:10,228 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:10,228 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:10,228 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:10,229 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:10,229 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:10,229 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:26:10,230 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-11-09 15:26:10,245 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-11-09 15:26:10,270 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-09 15:26:10,270 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-09 15:26:10,270 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-11-09 15:26:10,270 INFO L380 AbstractCegarLoop]: Backedges is MCR [2020-11-09 15:26:10,270 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-09 15:26:10,270 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-09 15:26:10,271 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-09 15:26:10,271 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-09 15:26:10,285 INFO L128 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-11-09 15:26:10,286 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 107 places, 100 transitions, 215 flow [2020-11-09 15:26:10,289 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 107 places, 100 transitions, 215 flow [2020-11-09 15:26:10,291 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 107 places, 100 transitions, 215 flow [2020-11-09 15:26:10,342 INFO L129 PetriNetUnfolder]: 3/97 cut-off events. [2020-11-09 15:26:10,342 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-11-09 15:26:10,347 INFO L84 FinitePrefix]: Finished finitePrefix Result has 107 conditions, 97 events. 3/97 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 77 event pairs, 0 based on Foata normal form. 0/92 useless extension candidates. Maximal degree in co-relation 64. Up to 2 conditions per place. [2020-11-09 15:26:10,351 INFO L116 LiptonReduction]: Number of co-enabled transitions 1746 [2020-11-09 15:26:12,506 WARN L194 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 226 DAG size of output: 186 [2020-11-09 15:26:12,540 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 2, 1] term [2020-11-09 15:26:12,540 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:26:12,543 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-09 15:26:12,543 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:26:13,949 WARN L194 SmtUtils]: Spent 1.37 s on a formula simplification. DAG size of input: 142 DAG size of output: 122 [2020-11-09 15:26:16,413 WARN L194 SmtUtils]: Spent 2.46 s on a formula simplification. DAG size of input: 310 DAG size of output: 266 [2020-11-09 15:26:16,419 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 1] term [2020-11-09 15:26:16,420 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:26:16,435 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 3, 2, 2, 1] term [2020-11-09 15:26:16,435 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:26:16,439 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:26:16,441 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:26:16,443 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:26:16,444 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 15:26:16,446 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:26:16,450 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:26:16,470 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:26:16,492 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 2, 1] term [2020-11-09 15:26:16,493 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:26:16,502 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 2, 1] term [2020-11-09 15:26:16,503 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:26:16,507 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 15:26:16,507 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:26:16,509 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 2, 1] term [2020-11-09 15:26:16,510 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:26:16,516 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 2, 1] term [2020-11-09 15:26:16,517 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:26:16,519 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 15:26:16,519 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:26:16,533 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 1] term [2020-11-09 15:26:16,533 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:26:16,539 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 1] term [2020-11-09 15:26:16,539 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:26:16,544 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 15:26:16,544 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:26:16,545 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 1] term [2020-11-09 15:26:16,546 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:26:16,557 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 2, 1] term [2020-11-09 15:26:16,557 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:26:16,563 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 2, 1] term [2020-11-09 15:26:16,564 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:26:16,565 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 15:26:16,567 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:26:20,512 WARN L194 SmtUtils]: Spent 3.93 s on a formula simplification. DAG size of input: 352 DAG size of output: 266 [2020-11-09 15:26:20,783 WARN L194 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2020-11-09 15:26:20,916 WARN L194 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2020-11-09 15:26:21,062 WARN L194 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2020-11-09 15:26:23,992 WARN L194 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2020-11-09 15:26:24,233 WARN L194 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2020-11-09 15:26:24,775 WARN L194 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2020-11-09 15:26:24,878 WARN L194 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2020-11-09 15:26:25,444 WARN L194 SmtUtils]: Spent 533.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 112 [2020-11-09 15:26:25,703 WARN L194 SmtUtils]: Spent 255.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2020-11-09 15:26:26,218 WARN L194 SmtUtils]: Spent 513.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 112 [2020-11-09 15:26:26,464 WARN L194 SmtUtils]: Spent 241.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2020-11-09 15:26:26,485 INFO L131 LiptonReduction]: Checked pairs total: 4757 [2020-11-09 15:26:26,485 INFO L133 LiptonReduction]: Total number of compositions: 90 [2020-11-09 15:26:26,493 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 37 places, 28 transitions, 71 flow [2020-11-09 15:26:26,576 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 890 states. [2020-11-09 15:26:26,579 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states. [2020-11-09 15:26:26,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-11-09 15:26:26,587 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:26:26,588 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:26:26,588 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 15:26:26,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:26:26,602 INFO L82 PathProgramCache]: Analyzing trace with hash 1746244549, now seen corresponding path program 1 times [2020-11-09 15:26:26,629 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:26:26,629 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918482918] [2020-11-09 15:26:26,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:26:26,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:26:26,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 15:26:26,991 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918482918] [2020-11-09 15:26:26,992 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:26:26,993 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-09 15:26:26,993 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [259822168] [2020-11-09 15:26:26,994 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:26:26,998 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:26:27,017 INFO L252 McrAutomatonBuilder]: Finished intersection with 8 states and 7 transitions. [2020-11-09 15:26:27,017 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:26:27,023 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 15:26:27,024 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-09 15:26:27,024 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:26:27,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-09 15:26:27,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 15:26:27,049 INFO L87 Difference]: Start difference. First operand 890 states. Second operand 3 states. [2020-11-09 15:26:27,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:26:27,182 INFO L93 Difference]: Finished difference Result 750 states and 2363 transitions. [2020-11-09 15:26:27,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-09 15:26:27,188 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-11-09 15:26:27,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:26:27,212 INFO L225 Difference]: With dead ends: 750 [2020-11-09 15:26:27,212 INFO L226 Difference]: Without dead ends: 550 [2020-11-09 15:26:27,214 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-11-09 15:26:27,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2020-11-09 15:26:27,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 550. [2020-11-09 15:26:27,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 550 states. [2020-11-09 15:26:27,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 1693 transitions. [2020-11-09 15:26:27,345 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 1693 transitions. Word has length 7 [2020-11-09 15:26:27,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:26:27,347 INFO L481 AbstractCegarLoop]: Abstraction has 550 states and 1693 transitions. [2020-11-09 15:26:27,347 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-09 15:26:27,347 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 1693 transitions. [2020-11-09 15:26:27,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-11-09 15:26:27,349 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:26:27,349 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:26:27,350 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-09 15:26:27,350 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 15:26:27,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:26:27,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1729039232, now seen corresponding path program 1 times [2020-11-09 15:26:27,352 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:26:27,353 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520591162] [2020-11-09 15:26:27,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:26:27,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:26:27,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 15:26:27,472 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520591162] [2020-11-09 15:26:27,472 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:26:27,472 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-09 15:26:27,472 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1551623942] [2020-11-09 15:26:27,472 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:26:27,475 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:26:27,479 INFO L252 McrAutomatonBuilder]: Finished intersection with 11 states and 10 transitions. [2020-11-09 15:26:27,479 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:26:27,480 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 15:26:27,481 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-09 15:26:27,481 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:26:27,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-09 15:26:27,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 15:26:27,485 INFO L87 Difference]: Start difference. First operand 550 states and 1693 transitions. Second operand 3 states. [2020-11-09 15:26:27,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:26:27,507 INFO L93 Difference]: Finished difference Result 358 states and 925 transitions. [2020-11-09 15:26:27,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-09 15:26:27,508 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-11-09 15:26:27,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:26:27,515 INFO L225 Difference]: With dead ends: 358 [2020-11-09 15:26:27,515 INFO L226 Difference]: Without dead ends: 358 [2020-11-09 15:26:27,517 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 15:26:27,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2020-11-09 15:26:27,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 358. [2020-11-09 15:26:27,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2020-11-09 15:26:27,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 925 transitions. [2020-11-09 15:26:27,542 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 925 transitions. Word has length 10 [2020-11-09 15:26:27,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:26:27,542 INFO L481 AbstractCegarLoop]: Abstraction has 358 states and 925 transitions. [2020-11-09 15:26:27,542 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-09 15:26:27,542 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 925 transitions. [2020-11-09 15:26:27,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-11-09 15:26:27,545 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:26:27,546 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:26:27,546 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-09 15:26:27,546 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 15:26:27,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:26:27,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1692870467, now seen corresponding path program 1 times [2020-11-09 15:26:27,559 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:26:27,559 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426515878] [2020-11-09 15:26:27,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:26:27,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:26:27,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 15:26:27,709 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426515878] [2020-11-09 15:26:27,710 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:26:27,710 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 15:26:27,710 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [863372730] [2020-11-09 15:26:27,710 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:26:27,713 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:26:27,717 INFO L252 McrAutomatonBuilder]: Finished intersection with 26 states and 37 transitions. [2020-11-09 15:26:27,717 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:26:27,965 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 15:26:27,966 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-09 15:26:27,966 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:26:27,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-09 15:26:27,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-09 15:26:27,968 INFO L87 Difference]: Start difference. First operand 358 states and 925 transitions. Second operand 4 states. [2020-11-09 15:26:28,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:26:28,023 INFO L93 Difference]: Finished difference Result 198 states and 445 transitions. [2020-11-09 15:26:28,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-09 15:26:28,029 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-11-09 15:26:28,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:26:28,031 INFO L225 Difference]: With dead ends: 198 [2020-11-09 15:26:28,031 INFO L226 Difference]: Without dead ends: 198 [2020-11-09 15:26:28,032 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 4 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-09 15:26:28,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2020-11-09 15:26:28,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2020-11-09 15:26:28,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2020-11-09 15:26:28,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 445 transitions. [2020-11-09 15:26:28,044 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 445 transitions. Word has length 13 [2020-11-09 15:26:28,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:26:28,044 INFO L481 AbstractCegarLoop]: Abstraction has 198 states and 445 transitions. [2020-11-09 15:26:28,045 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-09 15:26:28,045 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 445 transitions. [2020-11-09 15:26:28,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-11-09 15:26:28,049 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:26:28,049 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:26:28,050 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-09 15:26:28,050 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 15:26:28,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:26:28,051 INFO L82 PathProgramCache]: Analyzing trace with hash -1957435559, now seen corresponding path program 1 times [2020-11-09 15:26:28,061 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:26:28,061 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181313534] [2020-11-09 15:26:28,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:26:28,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:26:28,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 15:26:28,149 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181313534] [2020-11-09 15:26:28,149 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:26:28,149 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-09 15:26:28,149 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2006467300] [2020-11-09 15:26:28,150 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:26:28,154 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:26:28,169 INFO L252 McrAutomatonBuilder]: Finished intersection with 65 states and 120 transitions. [2020-11-09 15:26:28,170 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:26:28,199 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:26:28,199 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:26:28,201 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:26:28,201 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:26:28,203 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:26:28,203 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:26:28,281 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:26:28,282 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:26:28,285 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:26:28,285 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:26:28,287 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:26:28,288 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:26:28,353 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:26:28,354 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:26:28,355 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:26:28,356 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:26:28,357 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:26:28,357 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:26:28,436 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:26:28,437 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:26:28,438 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:26:28,439 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:26:28,440 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:26:28,440 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:26:28,497 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:26:28,498 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:26:28,499 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:26:28,499 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:26:28,500 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:26:28,500 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:26:28,601 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [5423#(<= ~__unbuffered_cnt~0 0)] [2020-11-09 15:26:28,601 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-09 15:26:28,602 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:26:28,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-09 15:26:28,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-11-09 15:26:28,603 INFO L87 Difference]: Start difference. First operand 198 states and 445 transitions. Second operand 6 states. [2020-11-09 15:26:28,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:26:28,645 INFO L93 Difference]: Finished difference Result 154 states and 357 transitions. [2020-11-09 15:26:28,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-09 15:26:28,646 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-11-09 15:26:28,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:26:28,648 INFO L225 Difference]: With dead ends: 154 [2020-11-09 15:26:28,648 INFO L226 Difference]: Without dead ends: 154 [2020-11-09 15:26:28,648 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 4 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-11-09 15:26:28,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2020-11-09 15:26:28,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2020-11-09 15:26:28,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2020-11-09 15:26:28,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 357 transitions. [2020-11-09 15:26:28,654 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 357 transitions. Word has length 17 [2020-11-09 15:26:28,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:26:28,655 INFO L481 AbstractCegarLoop]: Abstraction has 154 states and 357 transitions. [2020-11-09 15:26:28,655 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-09 15:26:28,655 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 357 transitions. [2020-11-09 15:26:28,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-09 15:26:28,657 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:26:28,657 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] [2020-11-09 15:26:28,657 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-09 15:26:28,657 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 15:26:28,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:26:28,658 INFO L82 PathProgramCache]: Analyzing trace with hash 388650603, now seen corresponding path program 1 times [2020-11-09 15:26:28,659 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:26:28,660 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895792668] [2020-11-09 15:26:28,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:26:28,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:26:28,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 15:26:28,985 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895792668] [2020-11-09 15:26:28,985 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:26:28,985 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-09 15:26:28,985 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1436084122] [2020-11-09 15:26:28,986 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:26:28,991 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:26:29,017 INFO L252 McrAutomatonBuilder]: Finished intersection with 79 states and 141 transitions. [2020-11-09 15:26:29,017 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:26:29,035 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:26:29,035 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:26:29,036 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:26:29,036 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:26:29,037 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:26:29,038 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:26:29,089 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:26:29,089 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:26:29,090 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:26:29,091 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:26:29,092 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:26:29,092 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:26:29,147 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:26:29,148 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:26:29,149 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:26:29,149 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:26:29,150 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:26:29,150 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:26:29,185 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:26:29,186 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:26:29,187 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:26:29,187 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:26:29,189 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:26:29,189 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:26:29,259 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:26:29,259 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:26:29,260 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:26:29,260 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:26:29,261 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:26:29,262 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:26:29,298 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:26:29,298 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:26:29,299 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:26:29,299 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:26:29,300 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:26:29,300 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:26:29,348 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:26:29,349 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:26:29,350 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:26:29,386 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:26:29,388 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:26:29,391 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:26:29,483 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 15:26:29,484 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-09 15:26:29,484 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:26:29,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-09 15:26:29,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2020-11-09 15:26:29,485 INFO L87 Difference]: Start difference. First operand 154 states and 357 transitions. Second operand 8 states. [2020-11-09 15:26:29,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:26:29,599 INFO L93 Difference]: Finished difference Result 217 states and 493 transitions. [2020-11-09 15:26:29,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-09 15:26:29,600 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2020-11-09 15:26:29,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:26:29,601 INFO L225 Difference]: With dead ends: 217 [2020-11-09 15:26:29,601 INFO L226 Difference]: Without dead ends: 103 [2020-11-09 15:26:29,602 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2020-11-09 15:26:29,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2020-11-09 15:26:29,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2020-11-09 15:26:29,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2020-11-09 15:26:29,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 219 transitions. [2020-11-09 15:26:29,606 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 219 transitions. Word has length 21 [2020-11-09 15:26:29,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:26:29,606 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 219 transitions. [2020-11-09 15:26:29,606 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-09 15:26:29,606 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 219 transitions. [2020-11-09 15:26:29,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-09 15:26:29,607 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:26:29,607 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] [2020-11-09 15:26:29,608 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-09 15:26:29,608 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 15:26:29,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:26:29,608 INFO L82 PathProgramCache]: Analyzing trace with hash -495507445, now seen corresponding path program 2 times [2020-11-09 15:26:29,610 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:26:29,611 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602499314] [2020-11-09 15:26:29,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:26:29,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:26:29,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 15:26:29,876 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602499314] [2020-11-09 15:26:29,877 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:26:29,877 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-09 15:26:29,877 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1858256746] [2020-11-09 15:26:29,877 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:26:29,882 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:26:29,909 INFO L252 McrAutomatonBuilder]: Finished intersection with 78 states and 150 transitions. [2020-11-09 15:26:29,909 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:26:29,970 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:26:29,970 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:26:29,971 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:26:29,971 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:26:29,972 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[5, 3, 3, 2, 2, 1] term [2020-11-09 15:26:29,972 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 15:26:30,028 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:26:30,029 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:26:30,030 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:26:30,030 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:26:30,031 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[5, 3, 3, 2, 2, 1] term [2020-11-09 15:26:30,031 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 15:26:30,104 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:26:30,105 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:26:30,106 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:26:30,106 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:26:30,107 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[5, 2, 3, 2, 2, 1] term [2020-11-09 15:26:30,107 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 15:26:30,194 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:26:30,194 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:26:30,195 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:26:30,195 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:26:30,196 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[5, 2, 3, 2, 2, 1] term [2020-11-09 15:26:30,196 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 15:26:30,261 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:26:30,261 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:26:30,262 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:26:30,262 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:26:30,263 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[5, 2, 3, 2, 2, 1] term [2020-11-09 15:26:30,263 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 15:26:30,320 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:26:30,320 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:26:30,321 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:26:30,321 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:26:30,322 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[5, 3, 3, 2, 2, 1] term [2020-11-09 15:26:30,322 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 15:26:30,372 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:26:30,372 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:26:30,373 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:26:30,374 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:26:30,374 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[5, 3, 3, 2, 2, 1] term [2020-11-09 15:26:30,375 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 15:26:30,564 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:26:30,564 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:26:30,565 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:26:30,565 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:26:30,566 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[5, 2, 3, 2, 2, 1] term [2020-11-09 15:26:30,566 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 15:26:30,615 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:26:30,616 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:26:30,617 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:26:30,617 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:26:30,618 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[5, 2, 3, 2, 2, 1] term [2020-11-09 15:26:30,619 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 15:26:30,667 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:26:30,668 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:26:30,669 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:26:30,669 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:26:30,670 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[5, 2, 3, 2, 2, 1] term [2020-11-09 15:26:30,670 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 15:26:30,717 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:26:30,717 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:26:30,718 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:26:30,719 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:26:30,719 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:26:30,720 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:26:30,756 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:26:30,756 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:26:30,757 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:26:30,757 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:26:30,758 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:26:30,758 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:26:30,826 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [6330#(and (or (not (= (mod ~y$w_buff0_used~0 256) 0)) (= ~y$r_buff0_thd0~0 0)) (or (= ~z~0 1) (not (= (mod ~y$w_buff0_used~0 256) 0)))), 6331#(and (= ~z~0 1) (= ~y$r_buff0_thd0~0 0))] [2020-11-09 15:26:30,827 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-09 15:26:30,827 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:26:30,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-09 15:26:30,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2020-11-09 15:26:30,828 INFO L87 Difference]: Start difference. First operand 103 states and 219 transitions. Second operand 11 states. [2020-11-09 15:26:31,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:26:31,047 INFO L93 Difference]: Finished difference Result 167 states and 354 transitions. [2020-11-09 15:26:31,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-09 15:26:31,050 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2020-11-09 15:26:31,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:26:31,051 INFO L225 Difference]: With dead ends: 167 [2020-11-09 15:26:31,051 INFO L226 Difference]: Without dead ends: 122 [2020-11-09 15:26:31,052 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 34 SyntacticMatches, 15 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2020-11-09 15:26:31,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2020-11-09 15:26:31,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 114. [2020-11-09 15:26:31,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2020-11-09 15:26:31,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 237 transitions. [2020-11-09 15:26:31,059 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 237 transitions. Word has length 21 [2020-11-09 15:26:31,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:26:31,060 INFO L481 AbstractCegarLoop]: Abstraction has 114 states and 237 transitions. [2020-11-09 15:26:31,060 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-09 15:26:31,060 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 237 transitions. [2020-11-09 15:26:31,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-09 15:26:31,062 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:26:31,062 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] [2020-11-09 15:26:31,062 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-09 15:26:31,063 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 15:26:31,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:26:31,063 INFO L82 PathProgramCache]: Analyzing trace with hash 178995713, now seen corresponding path program 3 times [2020-11-09 15:26:31,071 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:26:31,071 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304550455] [2020-11-09 15:26:31,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:26:31,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:26:31,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 15:26:31,316 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304550455] [2020-11-09 15:26:31,316 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:26:31,316 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-09 15:26:31,317 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2049642244] [2020-11-09 15:26:31,317 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:26:31,321 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:26:31,335 INFO L252 McrAutomatonBuilder]: Finished intersection with 40 states and 59 transitions. [2020-11-09 15:26:31,335 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:26:31,349 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:26:31,350 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:26:31,351 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:26:31,351 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:26:31,352 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:26:31,352 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:26:31,403 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:26:31,403 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:26:31,404 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:26:31,405 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:26:31,405 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:26:31,405 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:26:31,435 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:26:31,435 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:26:31,436 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:26:31,436 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:26:31,437 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:26:31,437 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:26:31,473 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:26:31,473 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:26:31,474 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:26:31,474 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:26:31,475 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:26:31,475 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:26:31,508 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:26:31,508 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:26:31,509 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:26:31,509 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:26:31,510 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:26:31,510 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:26:31,542 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 15:26:31,543 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-09 15:26:31,543 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:26:31,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-09 15:26:31,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-11-09 15:26:31,544 INFO L87 Difference]: Start difference. First operand 114 states and 237 transitions. Second operand 7 states. [2020-11-09 15:26:31,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:26:31,612 INFO L93 Difference]: Finished difference Result 153 states and 310 transitions. [2020-11-09 15:26:31,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-09 15:26:31,613 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2020-11-09 15:26:31,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:26:31,614 INFO L225 Difference]: With dead ends: 153 [2020-11-09 15:26:31,614 INFO L226 Difference]: Without dead ends: 66 [2020-11-09 15:26:31,615 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-11-09 15:26:31,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-11-09 15:26:31,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2020-11-09 15:26:31,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-11-09 15:26:31,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 117 transitions. [2020-11-09 15:26:31,618 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 117 transitions. Word has length 21 [2020-11-09 15:26:31,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:26:31,618 INFO L481 AbstractCegarLoop]: Abstraction has 66 states and 117 transitions. [2020-11-09 15:26:31,618 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-09 15:26:31,619 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 117 transitions. [2020-11-09 15:26:31,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-09 15:26:31,619 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:26:31,619 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] [2020-11-09 15:26:31,619 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-09 15:26:31,620 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 15:26:31,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:26:31,620 INFO L82 PathProgramCache]: Analyzing trace with hash -195900917, now seen corresponding path program 4 times [2020-11-09 15:26:31,622 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:26:31,622 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942217971] [2020-11-09 15:26:31,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:26:31,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:26:31,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 15:26:31,947 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942217971] [2020-11-09 15:26:31,947 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:26:31,947 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-09 15:26:31,947 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [232364948] [2020-11-09 15:26:31,948 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:26:31,952 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:26:31,983 INFO L252 McrAutomatonBuilder]: Finished intersection with 85 states and 158 transitions. [2020-11-09 15:26:31,983 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:26:31,998 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:26:31,998 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:26:31,999 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:26:31,999 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:26:32,000 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:26:32,000 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:26:32,037 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:26:32,038 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:26:32,038 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:26:32,039 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:26:32,039 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:26:32,040 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:26:32,126 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:26:32,127 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:26:32,128 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:26:32,128 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:26:32,129 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:26:32,129 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:26:32,161 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:26:32,162 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:26:32,162 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:26:32,163 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:26:32,163 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:26:32,164 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:26:32,200 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:26:32,200 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:26:32,201 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:26:32,201 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:26:32,202 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:26:32,202 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:26:32,393 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [7036#(and (or (not (= (mod ~y$w_buff0_used~0 256) 0)) (= ~y$r_buff0_thd2~0 0)) (or (not (= (mod ~y$w_buff0_used~0 256) 0)) (= ~y$r_buff0_thd0~0 0)) (or (= ~z~0 1) (not (= (mod ~y$w_buff0_used~0 256) 0))))] [2020-11-09 15:26:32,394 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-09 15:26:32,394 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:26:32,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-09 15:26:32,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-11-09 15:26:32,395 INFO L87 Difference]: Start difference. First operand 66 states and 117 transitions. Second operand 10 states. [2020-11-09 15:26:32,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:26:32,795 INFO L93 Difference]: Finished difference Result 107 states and 183 transitions. [2020-11-09 15:26:32,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-09 15:26:32,795 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2020-11-09 15:26:32,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:26:32,797 INFO L225 Difference]: With dead ends: 107 [2020-11-09 15:26:32,797 INFO L226 Difference]: Without dead ends: 74 [2020-11-09 15:26:32,797 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 34 SyntacticMatches, 6 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2020-11-09 15:26:32,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-11-09 15:26:32,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 48. [2020-11-09 15:26:32,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-11-09 15:26:32,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 81 transitions. [2020-11-09 15:26:32,800 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 81 transitions. Word has length 21 [2020-11-09 15:26:32,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:26:32,800 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 81 transitions. [2020-11-09 15:26:32,800 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-09 15:26:32,801 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 81 transitions. [2020-11-09 15:26:32,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-09 15:26:32,801 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:26:32,801 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] [2020-11-09 15:26:32,801 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-09 15:26:32,801 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 15:26:32,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:26:32,802 INFO L82 PathProgramCache]: Analyzing trace with hash 18555501, now seen corresponding path program 5 times [2020-11-09 15:26:32,803 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:26:32,803 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454260352] [2020-11-09 15:26:32,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:26:32,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-09 15:26:32,839 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-09 15:26:32,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-09 15:26:32,882 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-09 15:26:32,953 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-09 15:26:32,953 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-09 15:26:32,954 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-09 15:26:33,086 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 03:26:33 BasicIcfg [2020-11-09 15:26:33,087 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-09 15:26:33,088 INFO L168 Benchmark]: Toolchain (without parser) took 26237.31 ms. Allocated memory was 155.2 MB in the beginning and 324.0 MB in the end (delta: 168.8 MB). Free memory was 129.2 MB in the beginning and 134.3 MB in the end (delta: -5.0 MB). Peak memory consumption was 165.4 MB. Max. memory is 8.0 GB. [2020-11-09 15:26:33,089 INFO L168 Benchmark]: CDTParser took 0.53 ms. Allocated memory is still 125.8 MB. Free memory was 96.8 MB in the beginning and 96.7 MB in the end (delta: 120.8 kB). There was no memory consumed. Max. memory is 8.0 GB. [2020-11-09 15:26:33,090 INFO L168 Benchmark]: CACSL2BoogieTranslator took 890.88 ms. Allocated memory is still 155.2 MB. Free memory was 128.6 MB in the beginning and 118.7 MB in the end (delta: 9.9 MB). Peak memory consumption was 20.7 MB. Max. memory is 8.0 GB. [2020-11-09 15:26:33,091 INFO L168 Benchmark]: Boogie Procedure Inliner took 73.28 ms. Allocated memory is still 155.2 MB. Free memory was 118.7 MB in the beginning and 115.9 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-11-09 15:26:33,091 INFO L168 Benchmark]: Boogie Preprocessor took 42.19 ms. Allocated memory is still 155.2 MB. Free memory was 115.9 MB in the beginning and 113.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-11-09 15:26:33,092 INFO L168 Benchmark]: RCFGBuilder took 2257.29 ms. Allocated memory was 155.2 MB in the beginning and 186.6 MB in the end (delta: 31.5 MB). Free memory was 113.8 MB in the beginning and 99.8 MB in the end (delta: 14.0 MB). Peak memory consumption was 52.8 MB. Max. memory is 8.0 GB. [2020-11-09 15:26:33,093 INFO L168 Benchmark]: TraceAbstraction took 22958.78 ms. Allocated memory was 186.6 MB in the beginning and 324.0 MB in the end (delta: 137.4 MB). Free memory was 99.8 MB in the beginning and 134.8 MB in the end (delta: -35.0 MB). Peak memory consumption was 102.4 MB. Max. memory is 8.0 GB. [2020-11-09 15:26:33,098 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.53 ms. Allocated memory is still 125.8 MB. Free memory was 96.8 MB in the beginning and 96.7 MB in the end (delta: 120.8 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 890.88 ms. Allocated memory is still 155.2 MB. Free memory was 128.6 MB in the beginning and 118.7 MB in the end (delta: 9.9 MB). Peak memory consumption was 20.7 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 73.28 ms. Allocated memory is still 155.2 MB. Free memory was 118.7 MB in the beginning and 115.9 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 42.19 ms. Allocated memory is still 155.2 MB. Free memory was 115.9 MB in the beginning and 113.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 2257.29 ms. Allocated memory was 155.2 MB in the beginning and 186.6 MB in the end (delta: 31.5 MB). Free memory was 113.8 MB in the beginning and 99.8 MB in the end (delta: 14.0 MB). Peak memory consumption was 52.8 MB. Max. memory is 8.0 GB. * TraceAbstraction took 22958.78 ms. Allocated memory was 186.6 MB in the beginning and 324.0 MB in the end (delta: 137.4 MB). Free memory was 99.8 MB in the beginning and 134.8 MB in the end (delta: -35.0 MB). Peak memory consumption was 102.4 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 943 VarBasedMoverChecksPositive, 27 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 90 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 16.1s, 107 PlacesBefore, 37 PlacesAfterwards, 100 TransitionsBefore, 28 TransitionsAfterwards, 1746 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 41 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 12 ConcurrentYvCompositions, 2 ChoiceCompositions, 90 TotalNumberOfCompositions, 4757 MoverChecksTotal - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L718] 0 _Bool y$flush_delayed; [L719] 0 int y$mem_tmp; [L720] 0 _Bool y$r_buff0_thd0; [L721] 0 _Bool y$r_buff0_thd1; [L722] 0 _Bool y$r_buff0_thd2; [L723] 0 _Bool y$r_buff0_thd3; [L724] 0 _Bool y$r_buff1_thd0; [L725] 0 _Bool y$r_buff1_thd1; [L726] 0 _Bool y$r_buff1_thd2; [L727] 0 _Bool y$r_buff1_thd3; [L728] 0 _Bool y$read_delayed; [L729] 0 int *y$read_delayed_var; [L730] 0 int y$w_buff0; [L731] 0 _Bool y$w_buff0_used; [L732] 0 int y$w_buff1; [L733] 0 _Bool y$w_buff1_used; [L735] 0 int z = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L813] 0 pthread_t t1507; [L814] FCALL, FORK 0 pthread_create(&t1507, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L815] 0 pthread_t t1508; [L816] FCALL, FORK 0 pthread_create(&t1508, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L817] 0 pthread_t t1509; [L818] FCALL, FORK 0 pthread_create(&t1509, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L776] 3 y$w_buff1 = y$w_buff0 [L777] 3 y$w_buff0 = 2 [L778] 3 y$w_buff1_used = y$w_buff0_used [L779] 3 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 3 !(!expression) [L781] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L782] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L783] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L784] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L785] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L788] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L741] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L744] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L749] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L751] 1 return 0; [L756] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L759] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L762] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L762] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L762] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L762] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L763] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L763] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L764] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L764] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L765] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L765] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L766] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L766] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L769] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L771] 2 return 0; [L791] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L791] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L792] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L792] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L793] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L793] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L794] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L794] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L795] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L795] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L798] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L800] 3 return 0; [L820] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L824] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L824] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L824] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L824] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L825] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L825] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L826] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L826] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L827] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L827] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L828] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L828] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L831] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 0 y$flush_delayed = weak$$choice2 [L834] 0 y$mem_tmp = y [L835] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L835] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L836] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L836] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0) [L836] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L836] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L837] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L837] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L837] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L837] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L838] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L838] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used) [L838] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L838] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L839] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L839] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L839] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L839] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L840] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0) [L840] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L840] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L841] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L841] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L841] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L841] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L842] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0) [L843] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L843] 0 y = y$flush_delayed ? y$mem_tmp : y [L844] 0 y$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix056_tso.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 98 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 22.6s, OverallIterations: 9, TraceHistogramMax: 1, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 16.3s, HoareTripleCheckerStatistics: 195 SDtfs, 258 SDslu, 498 SDs, 0 SdLazy, 217 SolverSat, 93 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 232 GetRequests, 156 SyntacticMatches, 29 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=890occurred 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.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 34 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 152 NumberOfCodeBlocks, 152 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 123 ConstructedInterpolants, 0 QuantifiedInterpolants, 13869 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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...