./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix029_power.opt_pso.opt_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version ff03de63 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/mix029_power.opt_pso.opt_rmo.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0b278c8af08551c2e27294e2c5dca8c5bd0f6f00874366f88466c32210c557af --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ff03de6 [2021-12-21 15:02:59,066 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-21 15:02:59,067 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-21 15:02:59,094 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-21 15:02:59,095 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-21 15:02:59,096 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-21 15:02:59,097 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-21 15:02:59,098 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-21 15:02:59,099 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-21 15:02:59,104 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-21 15:02:59,104 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-21 15:02:59,105 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-21 15:02:59,106 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-21 15:02:59,107 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-21 15:02:59,109 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-21 15:02:59,110 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-21 15:02:59,113 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-21 15:02:59,113 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-21 15:02:59,114 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-21 15:02:59,118 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-21 15:02:59,122 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-21 15:02:59,122 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-21 15:02:59,123 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-21 15:02:59,124 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-21 15:02:59,126 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-21 15:02:59,127 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-21 15:02:59,127 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-21 15:02:59,128 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-21 15:02:59,128 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-21 15:02:59,129 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-21 15:02:59,130 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-21 15:02:59,130 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-21 15:02:59,131 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-21 15:02:59,132 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-21 15:02:59,132 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-21 15:02:59,133 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-21 15:02:59,134 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-21 15:02:59,134 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-21 15:02:59,134 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-21 15:02:59,135 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-21 15:02:59,135 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-21 15:02:59,136 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-21 15:02:59,154 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-21 15:02:59,157 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-21 15:02:59,158 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-21 15:02:59,158 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-21 15:02:59,159 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-21 15:02:59,159 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-21 15:02:59,159 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-21 15:02:59,159 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-21 15:02:59,160 INFO L138 SettingsManager]: * Use SBE=true [2021-12-21 15:02:59,160 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-21 15:02:59,160 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-21 15:02:59,161 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-21 15:02:59,161 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-21 15:02:59,161 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-21 15:02:59,161 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-21 15:02:59,161 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-21 15:02:59,161 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-21 15:02:59,161 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-21 15:02:59,162 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-21 15:02:59,162 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-21 15:02:59,162 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-21 15:02:59,162 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-21 15:02:59,162 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-21 15:02:59,162 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-21 15:02:59,163 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-21 15:02:59,163 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-21 15:02:59,163 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-21 15:02:59,163 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-21 15:02:59,163 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-21 15:02:59,163 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-21 15:02:59,164 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-21 15:02:59,164 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-21 15:02:59,164 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-21 15:02:59,164 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-21 15:02:59,164 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0b278c8af08551c2e27294e2c5dca8c5bd0f6f00874366f88466c32210c557af [2021-12-21 15:02:59,370 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-21 15:02:59,387 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-21 15:02:59,389 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-21 15:02:59,390 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-21 15:02:59,390 INFO L275 PluginConnector]: CDTParser initialized [2021-12-21 15:02:59,391 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix029_power.opt_pso.opt_rmo.opt.i [2021-12-21 15:02:59,445 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/384bf6bf3/93185c4d3e624ebea33e8a1d20bd2678/FLAG7ab3b1aa2 [2021-12-21 15:02:59,801 INFO L306 CDTParser]: Found 1 translation units. [2021-12-21 15:02:59,801 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix029_power.opt_pso.opt_rmo.opt.i [2021-12-21 15:02:59,817 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/384bf6bf3/93185c4d3e624ebea33e8a1d20bd2678/FLAG7ab3b1aa2 [2021-12-21 15:03:00,215 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/384bf6bf3/93185c4d3e624ebea33e8a1d20bd2678 [2021-12-21 15:03:00,218 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-21 15:03:00,220 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-21 15:03:00,221 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-21 15:03:00,222 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-21 15:03:00,224 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-21 15:03:00,225 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 03:03:00" (1/1) ... [2021-12-21 15:03:00,227 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56889767 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:03:00, skipping insertion in model container [2021-12-21 15:03:00,227 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 03:03:00" (1/1) ... [2021-12-21 15:03:00,232 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-21 15:03:00,282 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-21 15:03:00,388 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix029_power.opt_pso.opt_rmo.opt.i[966,979] [2021-12-21 15:03:00,524 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 15:03:00,534 INFO L203 MainTranslator]: Completed pre-run [2021-12-21 15:03:00,545 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix029_power.opt_pso.opt_rmo.opt.i[966,979] [2021-12-21 15:03:00,589 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 15:03:00,631 INFO L208 MainTranslator]: Completed translation [2021-12-21 15:03:00,631 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:03:00 WrapperNode [2021-12-21 15:03:00,632 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-21 15:03:00,633 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-21 15:03:00,633 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-21 15:03:00,633 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-21 15:03:00,637 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:03:00" (1/1) ... [2021-12-21 15:03:00,664 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:03:00" (1/1) ... [2021-12-21 15:03:00,698 INFO L137 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 291 [2021-12-21 15:03:00,698 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-21 15:03:00,699 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-21 15:03:00,699 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-21 15:03:00,699 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-21 15:03:00,705 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:03:00" (1/1) ... [2021-12-21 15:03:00,705 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:03:00" (1/1) ... [2021-12-21 15:03:00,716 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:03:00" (1/1) ... [2021-12-21 15:03:00,718 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:03:00" (1/1) ... [2021-12-21 15:03:00,724 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:03:00" (1/1) ... [2021-12-21 15:03:00,736 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:03:00" (1/1) ... [2021-12-21 15:03:00,742 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:03:00" (1/1) ... [2021-12-21 15:03:00,745 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-21 15:03:00,752 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-21 15:03:00,752 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-21 15:03:00,752 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-21 15:03:00,753 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:03:00" (1/1) ... [2021-12-21 15:03:00,758 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-21 15:03:00,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 15:03:00,774 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-21 15:03:00,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-21 15:03:00,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-21 15:03:00,831 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-12-21 15:03:00,831 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-21 15:03:00,831 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-21 15:03:00,831 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-21 15:03:00,831 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-12-21 15:03:00,832 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-12-21 15:03:00,832 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-12-21 15:03:00,832 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-12-21 15:03:00,832 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-12-21 15:03:00,832 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-12-21 15:03:00,832 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-12-21 15:03:00,832 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-12-21 15:03:00,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-21 15:03:00,833 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-12-21 15:03:00,846 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-21 15:03:00,846 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-21 15:03:00,847 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-12-21 15:03:00,931 INFO L234 CfgBuilder]: Building ICFG [2021-12-21 15:03:00,933 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-21 15:03:01,347 INFO L275 CfgBuilder]: Performing block encoding [2021-12-21 15:03:01,559 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-21 15:03:01,560 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2021-12-21 15:03:01,563 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 03:03:01 BoogieIcfgContainer [2021-12-21 15:03:01,563 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-21 15:03:01,564 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-21 15:03:01,564 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-21 15:03:01,566 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-21 15:03:01,566 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 03:03:00" (1/3) ... [2021-12-21 15:03:01,567 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7357fafa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 03:03:01, skipping insertion in model container [2021-12-21 15:03:01,567 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:03:00" (2/3) ... [2021-12-21 15:03:01,567 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7357fafa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 03:03:01, skipping insertion in model container [2021-12-21 15:03:01,568 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 03:03:01" (3/3) ... [2021-12-21 15:03:01,568 INFO L111 eAbstractionObserver]: Analyzing ICFG mix029_power.opt_pso.opt_rmo.opt.i [2021-12-21 15:03:01,572 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-12-21 15:03:01,572 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-21 15:03:01,572 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-12-21 15:03:01,572 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-12-21 15:03:01,622 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:01,622 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:01,623 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:01,623 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:01,623 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:01,623 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:01,623 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:01,624 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:01,624 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:01,624 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:01,625 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:01,625 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:01,625 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:01,625 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:01,625 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:01,625 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:01,626 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:01,626 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:01,626 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:01,627 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:01,627 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:01,627 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:01,627 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:01,627 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:01,628 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:01,628 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:01,628 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:01,628 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:01,629 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:01,629 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:01,629 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:01,629 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:01,629 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:01,629 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:01,630 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:01,630 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:01,630 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:01,630 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:01,630 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:01,631 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:01,631 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:01,631 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:01,631 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:01,631 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:01,631 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:01,632 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:01,632 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:01,632 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:01,632 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:01,632 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:01,632 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:01,633 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:01,633 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:01,633 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:01,633 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:01,633 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:01,633 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:01,634 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:01,634 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:01,634 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:01,634 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:01,635 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:01,635 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:01,635 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:01,635 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:01,636 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:01,636 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:01,636 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:01,636 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:01,636 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:01,637 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:01,637 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:01,637 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:01,637 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:01,637 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:01,637 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:01,638 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:01,638 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:01,640 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:01,640 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:01,640 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:01,641 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:01,641 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:01,642 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:01,642 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:01,642 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:01,642 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:01,646 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:01,646 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:01,646 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:01,647 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:01,647 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:01,647 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:01,647 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:01,648 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:01,648 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:01,648 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:01,648 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:01,650 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:01,651 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:01,651 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:01,651 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:01,651 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:01,651 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:01,651 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:01,651 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:01,652 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:01,652 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:01,652 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:01,652 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:01,653 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:01,653 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:01,654 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:01,654 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:01,654 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:01,654 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:01,654 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:01,654 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:01,655 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:01,655 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:01,655 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:01,655 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:01,655 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:01,655 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:01,656 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:01,656 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:01,656 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:01,656 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:01,656 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:01,656 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:01,656 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:01,657 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:01,657 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:01,657 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:01,657 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-12-21 15:03:01,698 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-21 15:03:01,703 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-21 15:03:01,704 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-12-21 15:03:01,714 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 147 places, 136 transitions, 292 flow [2021-12-21 15:03:01,761 INFO L129 PetriNetUnfolder]: 2/132 cut-off events. [2021-12-21 15:03:01,762 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-12-21 15:03:01,766 INFO L84 FinitePrefix]: Finished finitePrefix Result has 145 conditions, 132 events. 2/132 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 70 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 91. Up to 2 conditions per place. [2021-12-21 15:03:01,766 INFO L82 GeneralOperation]: Start removeDead. Operand has 147 places, 136 transitions, 292 flow [2021-12-21 15:03:01,785 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 143 places, 132 transitions, 276 flow [2021-12-21 15:03:01,794 INFO L129 PetriNetUnfolder]: 0/76 cut-off events. [2021-12-21 15:03:01,795 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-12-21 15:03:01,796 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 15:03:01,796 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 15:03:01,797 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-21 15:03:01,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:03:01,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1884608713, now seen corresponding path program 1 times [2021-12-21 15:03:01,806 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:03:01,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800428629] [2021-12-21 15:03:01,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:03:01,807 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:03:01,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:03:02,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 15:03:02,054 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:03:02,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800428629] [2021-12-21 15:03:02,054 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800428629] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:03:02,054 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 15:03:02,055 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-21 15:03:02,056 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781495670] [2021-12-21 15:03:02,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:03:02,062 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-21 15:03:02,062 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:03:02,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 15:03:02,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 15:03:02,088 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 136 [2021-12-21 15:03:02,094 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 132 transitions, 276 flow. Second operand has 3 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:03:02,094 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-21 15:03:02,094 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 136 [2021-12-21 15:03:02,095 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-21 15:03:02,228 INFO L129 PetriNetUnfolder]: 57/350 cut-off events. [2021-12-21 15:03:02,228 INFO L130 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2021-12-21 15:03:02,231 INFO L84 FinitePrefix]: Finished finitePrefix Result has 479 conditions, 350 events. 57/350 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1385 event pairs, 11 based on Foata normal form. 14/345 useless extension candidates. Maximal degree in co-relation 422. Up to 75 conditions per place. [2021-12-21 15:03:02,233 INFO L132 encePairwiseOnDemand]: 131/136 looper letters, 14 selfloop transitions, 2 changer transitions 0/133 dead transitions. [2021-12-21 15:03:02,234 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 133 transitions, 313 flow [2021-12-21 15:03:02,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 15:03:02,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-12-21 15:03:02,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 384 transitions. [2021-12-21 15:03:02,248 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9411764705882353 [2021-12-21 15:03:02,248 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 384 transitions. [2021-12-21 15:03:02,249 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 384 transitions. [2021-12-21 15:03:02,252 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 15:03:02,253 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 384 transitions. [2021-12-21 15:03:02,257 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:03:02,262 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 136.0) internal successors, (544), 4 states have internal predecessors, (544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:03:02,263 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 136.0) internal successors, (544), 4 states have internal predecessors, (544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:03:02,264 INFO L186 Difference]: Start difference. First operand has 143 places, 132 transitions, 276 flow. Second operand 3 states and 384 transitions. [2021-12-21 15:03:02,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 133 transitions, 313 flow [2021-12-21 15:03:02,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 133 transitions, 308 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-12-21 15:03:02,271 INFO L242 Difference]: Finished difference. Result has 139 places, 128 transitions, 268 flow [2021-12-21 15:03:02,272 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=268, PETRI_PLACES=139, PETRI_TRANSITIONS=128} [2021-12-21 15:03:02,274 INFO L334 CegarLoopForPetriNet]: 143 programPoint places, -4 predicate places. [2021-12-21 15:03:02,275 INFO L470 AbstractCegarLoop]: Abstraction has has 139 places, 128 transitions, 268 flow [2021-12-21 15:03:02,275 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:03:02,275 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 15:03:02,275 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 15:03:02,275 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-21 15:03:02,276 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-21 15:03:02,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:03:02,276 INFO L85 PathProgramCache]: Analyzing trace with hash -966961645, now seen corresponding path program 1 times [2021-12-21 15:03:02,276 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:03:02,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053105754] [2021-12-21 15:03:02,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:03:02,279 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:03:02,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:03:02,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 15:03:02,522 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:03:02,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053105754] [2021-12-21 15:03:02,523 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053105754] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:03:02,523 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 15:03:02,523 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-21 15:03:02,523 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023173530] [2021-12-21 15:03:02,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:03:02,524 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-21 15:03:02,524 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:03:02,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-21 15:03:02,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-21 15:03:02,526 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 136 [2021-12-21 15:03:02,527 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 128 transitions, 268 flow. Second operand has 9 states, 9 states have (on average 113.55555555555556) internal successors, (1022), 9 states have internal predecessors, (1022), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:03:02,527 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-21 15:03:02,527 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 136 [2021-12-21 15:03:02,527 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-21 15:03:02,961 INFO L129 PetriNetUnfolder]: 394/1391 cut-off events. [2021-12-21 15:03:02,961 INFO L130 PetriNetUnfolder]: For 75/75 co-relation queries the response was YES. [2021-12-21 15:03:02,966 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2138 conditions, 1391 events. 394/1391 cut-off events. For 75/75 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 9910 event pairs, 173 based on Foata normal form. 0/1347 useless extension candidates. Maximal degree in co-relation 2080. Up to 391 conditions per place. [2021-12-21 15:03:02,970 INFO L132 encePairwiseOnDemand]: 124/136 looper letters, 20 selfloop transitions, 11 changer transitions 60/186 dead transitions. [2021-12-21 15:03:02,970 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 186 transitions, 560 flow [2021-12-21 15:03:02,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-21 15:03:02,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2021-12-21 15:03:02,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1649 transitions. [2021-12-21 15:03:02,973 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8660714285714286 [2021-12-21 15:03:02,973 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1649 transitions. [2021-12-21 15:03:02,974 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1649 transitions. [2021-12-21 15:03:02,974 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 15:03:02,974 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1649 transitions. [2021-12-21 15:03:02,977 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 117.78571428571429) internal successors, (1649), 14 states have internal predecessors, (1649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:03:02,980 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 136.0) internal successors, (2040), 15 states have internal predecessors, (2040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:03:02,980 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 136.0) internal successors, (2040), 15 states have internal predecessors, (2040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:03:02,981 INFO L186 Difference]: Start difference. First operand has 139 places, 128 transitions, 268 flow. Second operand 14 states and 1649 transitions. [2021-12-21 15:03:02,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 186 transitions, 560 flow [2021-12-21 15:03:02,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 186 transitions, 542 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-12-21 15:03:02,984 INFO L242 Difference]: Finished difference. Result has 161 places, 122 transitions, 330 flow [2021-12-21 15:03:02,984 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=330, PETRI_PLACES=161, PETRI_TRANSITIONS=122} [2021-12-21 15:03:02,985 INFO L334 CegarLoopForPetriNet]: 143 programPoint places, 18 predicate places. [2021-12-21 15:03:02,985 INFO L470 AbstractCegarLoop]: Abstraction has has 161 places, 122 transitions, 330 flow [2021-12-21 15:03:02,986 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 113.55555555555556) internal successors, (1022), 9 states have internal predecessors, (1022), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:03:02,986 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 15:03:02,986 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 15:03:02,986 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-21 15:03:02,986 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-21 15:03:02,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:03:02,987 INFO L85 PathProgramCache]: Analyzing trace with hash -975383083, now seen corresponding path program 1 times [2021-12-21 15:03:02,987 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:03:02,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717830468] [2021-12-21 15:03:02,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:03:02,987 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:03:03,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:03:03,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 15:03:03,154 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:03:03,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717830468] [2021-12-21 15:03:03,154 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717830468] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:03:03,154 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 15:03:03,155 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-21 15:03:03,155 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061416444] [2021-12-21 15:03:03,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:03:03,155 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-21 15:03:03,155 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:03:03,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-21 15:03:03,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-12-21 15:03:03,157 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 136 [2021-12-21 15:03:03,158 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 122 transitions, 330 flow. Second operand has 10 states, 10 states have (on average 110.7) internal successors, (1107), 10 states have internal predecessors, (1107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:03:03,158 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-21 15:03:03,158 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 136 [2021-12-21 15:03:03,158 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-21 15:03:03,770 INFO L129 PetriNetUnfolder]: 450/1007 cut-off events. [2021-12-21 15:03:03,770 INFO L130 PetriNetUnfolder]: For 1972/2027 co-relation queries the response was YES. [2021-12-21 15:03:03,774 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3010 conditions, 1007 events. 450/1007 cut-off events. For 1972/2027 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 5387 event pairs, 60 based on Foata normal form. 29/1005 useless extension candidates. Maximal degree in co-relation 2936. Up to 345 conditions per place. [2021-12-21 15:03:03,779 INFO L132 encePairwiseOnDemand]: 123/136 looper letters, 40 selfloop transitions, 17 changer transitions 64/213 dead transitions. [2021-12-21 15:03:03,779 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 213 transitions, 1064 flow [2021-12-21 15:03:03,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-21 15:03:03,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2021-12-21 15:03:03,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2181 transitions. [2021-12-21 15:03:03,784 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8440402476780186 [2021-12-21 15:03:03,784 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 2181 transitions. [2021-12-21 15:03:03,784 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 2181 transitions. [2021-12-21 15:03:03,785 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 15:03:03,785 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 2181 transitions. [2021-12-21 15:03:03,790 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 114.78947368421052) internal successors, (2181), 19 states have internal predecessors, (2181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:03:03,793 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 136.0) internal successors, (2720), 20 states have internal predecessors, (2720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:03:03,795 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 136.0) internal successors, (2720), 20 states have internal predecessors, (2720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:03:03,796 INFO L186 Difference]: Start difference. First operand has 161 places, 122 transitions, 330 flow. Second operand 19 states and 2181 transitions. [2021-12-21 15:03:03,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 213 transitions, 1064 flow [2021-12-21 15:03:03,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 213 transitions, 1040 flow, removed 11 selfloop flow, removed 4 redundant places. [2021-12-21 15:03:03,808 INFO L242 Difference]: Finished difference. Result has 168 places, 135 transitions, 520 flow [2021-12-21 15:03:03,809 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=520, PETRI_PLACES=168, PETRI_TRANSITIONS=135} [2021-12-21 15:03:03,810 INFO L334 CegarLoopForPetriNet]: 143 programPoint places, 25 predicate places. [2021-12-21 15:03:03,811 INFO L470 AbstractCegarLoop]: Abstraction has has 168 places, 135 transitions, 520 flow [2021-12-21 15:03:03,811 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 110.7) internal successors, (1107), 10 states have internal predecessors, (1107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:03:03,811 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 15:03:03,812 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 15:03:03,812 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-21 15:03:03,812 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-21 15:03:03,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:03:03,812 INFO L85 PathProgramCache]: Analyzing trace with hash -967332864, now seen corresponding path program 1 times [2021-12-21 15:03:03,813 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:03:03,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821256745] [2021-12-21 15:03:03,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:03:03,813 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:03:03,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:03:04,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 15:03:04,062 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:03:04,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821256745] [2021-12-21 15:03:04,063 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821256745] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:03:04,063 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 15:03:04,063 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-21 15:03:04,063 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916824262] [2021-12-21 15:03:04,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:03:04,064 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-21 15:03:04,064 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:03:04,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-21 15:03:04,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-12-21 15:03:04,065 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 136 [2021-12-21 15:03:04,066 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 135 transitions, 520 flow. Second operand has 10 states, 10 states have (on average 112.6) internal successors, (1126), 10 states have internal predecessors, (1126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:03:04,066 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-21 15:03:04,067 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 136 [2021-12-21 15:03:04,067 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-21 15:03:04,510 INFO L129 PetriNetUnfolder]: 327/799 cut-off events. [2021-12-21 15:03:04,510 INFO L130 PetriNetUnfolder]: For 7579/7944 co-relation queries the response was YES. [2021-12-21 15:03:04,513 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3814 conditions, 799 events. 327/799 cut-off events. For 7579/7944 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 4158 event pairs, 140 based on Foata normal form. 22/799 useless extension candidates. Maximal degree in co-relation 3724. Up to 391 conditions per place. [2021-12-21 15:03:04,518 INFO L132 encePairwiseOnDemand]: 123/136 looper letters, 31 selfloop transitions, 25 changer transitions 41/194 dead transitions. [2021-12-21 15:03:04,518 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 194 transitions, 1383 flow [2021-12-21 15:03:04,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-21 15:03:04,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-12-21 15:03:04,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1856 transitions. [2021-12-21 15:03:04,522 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8529411764705882 [2021-12-21 15:03:04,522 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1856 transitions. [2021-12-21 15:03:04,522 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1856 transitions. [2021-12-21 15:03:04,523 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 15:03:04,523 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1856 transitions. [2021-12-21 15:03:04,525 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 116.0) internal successors, (1856), 16 states have internal predecessors, (1856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:03:04,528 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 136.0) internal successors, (2312), 17 states have internal predecessors, (2312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:03:04,529 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 136.0) internal successors, (2312), 17 states have internal predecessors, (2312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:03:04,529 INFO L186 Difference]: Start difference. First operand has 168 places, 135 transitions, 520 flow. Second operand 16 states and 1856 transitions. [2021-12-21 15:03:04,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 194 transitions, 1383 flow [2021-12-21 15:03:04,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 194 transitions, 1324 flow, removed 26 selfloop flow, removed 8 redundant places. [2021-12-21 15:03:04,538 INFO L242 Difference]: Finished difference. Result has 175 places, 148 transitions, 749 flow [2021-12-21 15:03:04,538 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=485, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=749, PETRI_PLACES=175, PETRI_TRANSITIONS=148} [2021-12-21 15:03:04,539 INFO L334 CegarLoopForPetriNet]: 143 programPoint places, 32 predicate places. [2021-12-21 15:03:04,539 INFO L470 AbstractCegarLoop]: Abstraction has has 175 places, 148 transitions, 749 flow [2021-12-21 15:03:04,540 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 112.6) internal successors, (1126), 10 states have internal predecessors, (1126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:03:04,540 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 15:03:04,540 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 15:03:04,540 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-21 15:03:04,540 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-21 15:03:04,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:03:04,541 INFO L85 PathProgramCache]: Analyzing trace with hash 539350464, now seen corresponding path program 2 times [2021-12-21 15:03:04,541 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:03:04,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476989010] [2021-12-21 15:03:04,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:03:04,541 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:03:04,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:03:04,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 15:03:04,736 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:03:04,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476989010] [2021-12-21 15:03:04,736 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476989010] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:03:04,736 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 15:03:04,736 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-21 15:03:04,736 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518842030] [2021-12-21 15:03:04,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:03:04,737 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-21 15:03:04,737 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:03:04,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-21 15:03:04,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-12-21 15:03:04,738 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 136 [2021-12-21 15:03:04,740 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 148 transitions, 749 flow. Second operand has 11 states, 11 states have (on average 111.54545454545455) internal successors, (1227), 11 states have internal predecessors, (1227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:03:04,740 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-21 15:03:04,740 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 136 [2021-12-21 15:03:04,740 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-21 15:03:05,194 INFO L129 PetriNetUnfolder]: 330/809 cut-off events. [2021-12-21 15:03:05,194 INFO L130 PetriNetUnfolder]: For 12035/12681 co-relation queries the response was YES. [2021-12-21 15:03:05,198 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4742 conditions, 809 events. 330/809 cut-off events. For 12035/12681 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 4205 event pairs, 141 based on Foata normal form. 24/810 useless extension candidates. Maximal degree in co-relation 4643. Up to 359 conditions per place. [2021-12-21 15:03:05,203 INFO L132 encePairwiseOnDemand]: 123/136 looper letters, 32 selfloop transitions, 28 changer transitions 42/198 dead transitions. [2021-12-21 15:03:05,203 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 198 transitions, 1695 flow [2021-12-21 15:03:05,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-21 15:03:05,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2021-12-21 15:03:05,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1946 transitions. [2021-12-21 15:03:05,206 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8416955017301038 [2021-12-21 15:03:05,206 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1946 transitions. [2021-12-21 15:03:05,206 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1946 transitions. [2021-12-21 15:03:05,207 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 15:03:05,207 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1946 transitions. [2021-12-21 15:03:05,210 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 114.47058823529412) internal successors, (1946), 17 states have internal predecessors, (1946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:03:05,212 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 136.0) internal successors, (2448), 18 states have internal predecessors, (2448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:03:05,213 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 136.0) internal successors, (2448), 18 states have internal predecessors, (2448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:03:05,213 INFO L186 Difference]: Start difference. First operand has 175 places, 148 transitions, 749 flow. Second operand 17 states and 1946 transitions. [2021-12-21 15:03:05,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 198 transitions, 1695 flow [2021-12-21 15:03:05,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 198 transitions, 1419 flow, removed 136 selfloop flow, removed 14 redundant places. [2021-12-21 15:03:05,243 INFO L242 Difference]: Finished difference. Result has 179 places, 151 transitions, 830 flow [2021-12-21 15:03:05,244 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=647, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=830, PETRI_PLACES=179, PETRI_TRANSITIONS=151} [2021-12-21 15:03:05,244 INFO L334 CegarLoopForPetriNet]: 143 programPoint places, 36 predicate places. [2021-12-21 15:03:05,244 INFO L470 AbstractCegarLoop]: Abstraction has has 179 places, 151 transitions, 830 flow [2021-12-21 15:03:05,245 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 111.54545454545455) internal successors, (1227), 11 states have internal predecessors, (1227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:03:05,245 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 15:03:05,245 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 15:03:05,245 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-21 15:03:05,246 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-21 15:03:05,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:03:05,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1921585306, now seen corresponding path program 1 times [2021-12-21 15:03:05,246 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:03:05,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454454941] [2021-12-21 15:03:05,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:03:05,247 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:03:05,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:03:05,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 15:03:05,462 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:03:05,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454454941] [2021-12-21 15:03:05,462 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454454941] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:03:05,462 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 15:03:05,462 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-21 15:03:05,463 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327720378] [2021-12-21 15:03:05,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:03:05,463 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-21 15:03:05,463 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:03:05,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-21 15:03:05,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-12-21 15:03:05,465 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 136 [2021-12-21 15:03:05,466 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 151 transitions, 830 flow. Second operand has 10 states, 10 states have (on average 112.6) internal successors, (1126), 10 states have internal predecessors, (1126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:03:05,466 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-21 15:03:05,466 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 136 [2021-12-21 15:03:05,466 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-21 15:03:05,922 INFO L129 PetriNetUnfolder]: 300/785 cut-off events. [2021-12-21 15:03:05,922 INFO L130 PetriNetUnfolder]: For 10906/11490 co-relation queries the response was YES. [2021-12-21 15:03:05,926 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4489 conditions, 785 events. 300/785 cut-off events. For 10906/11490 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 4036 event pairs, 41 based on Foata normal form. 21/784 useless extension candidates. Maximal degree in co-relation 4388. Up to 294 conditions per place. [2021-12-21 15:03:05,931 INFO L132 encePairwiseOnDemand]: 125/136 looper letters, 54 selfloop transitions, 15 changer transitions 37/203 dead transitions. [2021-12-21 15:03:05,931 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 203 transitions, 1728 flow [2021-12-21 15:03:05,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-21 15:03:05,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2021-12-21 15:03:05,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1741 transitions. [2021-12-21 15:03:05,934 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8534313725490196 [2021-12-21 15:03:05,934 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1741 transitions. [2021-12-21 15:03:05,934 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1741 transitions. [2021-12-21 15:03:05,935 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 15:03:05,935 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1741 transitions. [2021-12-21 15:03:05,938 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 116.06666666666666) internal successors, (1741), 15 states have internal predecessors, (1741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:03:05,940 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 136.0) internal successors, (2176), 16 states have internal predecessors, (2176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:03:05,940 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 136.0) internal successors, (2176), 16 states have internal predecessors, (2176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:03:05,941 INFO L186 Difference]: Start difference. First operand has 179 places, 151 transitions, 830 flow. Second operand 15 states and 1741 transitions. [2021-12-21 15:03:05,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 203 transitions, 1728 flow [2021-12-21 15:03:05,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 203 transitions, 1568 flow, removed 76 selfloop flow, removed 10 redundant places. [2021-12-21 15:03:05,951 INFO L242 Difference]: Finished difference. Result has 184 places, 154 transitions, 873 flow [2021-12-21 15:03:05,951 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=766, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=873, PETRI_PLACES=184, PETRI_TRANSITIONS=154} [2021-12-21 15:03:05,952 INFO L334 CegarLoopForPetriNet]: 143 programPoint places, 41 predicate places. [2021-12-21 15:03:05,952 INFO L470 AbstractCegarLoop]: Abstraction has has 184 places, 154 transitions, 873 flow [2021-12-21 15:03:05,953 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 112.6) internal successors, (1126), 10 states have internal predecessors, (1126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:03:05,953 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 15:03:05,953 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 15:03:05,953 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-21 15:03:05,953 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-21 15:03:05,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:03:05,954 INFO L85 PathProgramCache]: Analyzing trace with hash 1949157082, now seen corresponding path program 1 times [2021-12-21 15:03:05,954 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:03:05,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241621659] [2021-12-21 15:03:05,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:03:05,954 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:03:05,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:03:06,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 15:03:06,173 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:03:06,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241621659] [2021-12-21 15:03:06,173 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241621659] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:03:06,173 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 15:03:06,173 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-12-21 15:03:06,173 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596376524] [2021-12-21 15:03:06,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:03:06,174 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-21 15:03:06,174 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:03:06,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-21 15:03:06,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2021-12-21 15:03:06,176 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 136 [2021-12-21 15:03:06,177 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 154 transitions, 873 flow. Second operand has 14 states, 14 states have (on average 109.42857142857143) internal successors, (1532), 14 states have internal predecessors, (1532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:03:06,177 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-21 15:03:06,177 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 136 [2021-12-21 15:03:06,177 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-21 15:03:06,581 INFO L129 PetriNetUnfolder]: 238/687 cut-off events. [2021-12-21 15:03:06,581 INFO L130 PetriNetUnfolder]: For 10343/10515 co-relation queries the response was YES. [2021-12-21 15:03:06,584 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4092 conditions, 687 events. 238/687 cut-off events. For 10343/10515 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 3429 event pairs, 62 based on Foata normal form. 11/670 useless extension candidates. Maximal degree in co-relation 3984. Up to 288 conditions per place. [2021-12-21 15:03:06,589 INFO L132 encePairwiseOnDemand]: 123/136 looper letters, 54 selfloop transitions, 19 changer transitions 25/192 dead transitions. [2021-12-21 15:03:06,590 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 192 transitions, 1627 flow [2021-12-21 15:03:06,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-21 15:03:06,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2021-12-21 15:03:06,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 2011 transitions. [2021-12-21 15:03:06,593 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8214869281045751 [2021-12-21 15:03:06,593 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 2011 transitions. [2021-12-21 15:03:06,593 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 2011 transitions. [2021-12-21 15:03:06,594 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 15:03:06,594 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 2011 transitions. [2021-12-21 15:03:06,597 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 111.72222222222223) internal successors, (2011), 18 states have internal predecessors, (2011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:03:06,600 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 136.0) internal successors, (2584), 19 states have internal predecessors, (2584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:03:06,600 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 136.0) internal successors, (2584), 19 states have internal predecessors, (2584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:03:06,600 INFO L186 Difference]: Start difference. First operand has 184 places, 154 transitions, 873 flow. Second operand 18 states and 2011 transitions. [2021-12-21 15:03:06,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 192 transitions, 1627 flow [2021-12-21 15:03:06,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 192 transitions, 1535 flow, removed 37 selfloop flow, removed 9 redundant places. [2021-12-21 15:03:06,612 INFO L242 Difference]: Finished difference. Result has 193 places, 156 transitions, 929 flow [2021-12-21 15:03:06,612 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=824, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=929, PETRI_PLACES=193, PETRI_TRANSITIONS=156} [2021-12-21 15:03:06,613 INFO L334 CegarLoopForPetriNet]: 143 programPoint places, 50 predicate places. [2021-12-21 15:03:06,613 INFO L470 AbstractCegarLoop]: Abstraction has has 193 places, 156 transitions, 929 flow [2021-12-21 15:03:06,613 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 109.42857142857143) internal successors, (1532), 14 states have internal predecessors, (1532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:03:06,613 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 15:03:06,614 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 15:03:06,614 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-21 15:03:06,614 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-21 15:03:06,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:03:06,614 INFO L85 PathProgramCache]: Analyzing trace with hash -2061322091, now seen corresponding path program 1 times [2021-12-21 15:03:06,614 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:03:06,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709702715] [2021-12-21 15:03:06,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:03:06,615 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:03:06,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:03:06,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 15:03:06,685 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:03:06,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709702715] [2021-12-21 15:03:06,686 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709702715] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:03:06,686 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 15:03:06,686 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-21 15:03:06,686 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035688000] [2021-12-21 15:03:06,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:03:06,687 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-21 15:03:06,687 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:03:06,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-21 15:03:06,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-21 15:03:06,688 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 136 [2021-12-21 15:03:06,688 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 156 transitions, 929 flow. Second operand has 7 states, 7 states have (on average 113.57142857142857) internal successors, (795), 7 states have internal predecessors, (795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:03:06,688 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-21 15:03:06,688 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 136 [2021-12-21 15:03:06,689 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-21 15:03:07,107 INFO L129 PetriNetUnfolder]: 641/1595 cut-off events. [2021-12-21 15:03:07,108 INFO L130 PetriNetUnfolder]: For 32612/34940 co-relation queries the response was YES. [2021-12-21 15:03:07,116 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10455 conditions, 1595 events. 641/1595 cut-off events. For 32612/34940 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 10566 event pairs, 108 based on Foata normal form. 66/1594 useless extension candidates. Maximal degree in co-relation 10344. Up to 449 conditions per place. [2021-12-21 15:03:07,126 INFO L132 encePairwiseOnDemand]: 129/136 looper letters, 68 selfloop transitions, 3 changer transitions 49/224 dead transitions. [2021-12-21 15:03:07,126 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 224 transitions, 2248 flow [2021-12-21 15:03:07,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-21 15:03:07,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-12-21 15:03:07,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1173 transitions. [2021-12-21 15:03:07,128 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8625 [2021-12-21 15:03:07,128 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1173 transitions. [2021-12-21 15:03:07,129 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1173 transitions. [2021-12-21 15:03:07,129 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 15:03:07,129 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1173 transitions. [2021-12-21 15:03:07,131 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 117.3) internal successors, (1173), 10 states have internal predecessors, (1173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:03:07,132 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 136.0) internal successors, (1496), 11 states have internal predecessors, (1496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:03:07,133 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 136.0) internal successors, (1496), 11 states have internal predecessors, (1496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:03:07,133 INFO L186 Difference]: Start difference. First operand has 193 places, 156 transitions, 929 flow. Second operand 10 states and 1173 transitions. [2021-12-21 15:03:07,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 224 transitions, 2248 flow [2021-12-21 15:03:07,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 224 transitions, 2092 flow, removed 69 selfloop flow, removed 15 redundant places. [2021-12-21 15:03:07,155 INFO L242 Difference]: Finished difference. Result has 186 places, 157 transitions, 890 flow [2021-12-21 15:03:07,156 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=863, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=890, PETRI_PLACES=186, PETRI_TRANSITIONS=157} [2021-12-21 15:03:07,156 INFO L334 CegarLoopForPetriNet]: 143 programPoint places, 43 predicate places. [2021-12-21 15:03:07,156 INFO L470 AbstractCegarLoop]: Abstraction has has 186 places, 157 transitions, 890 flow [2021-12-21 15:03:07,157 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 113.57142857142857) internal successors, (795), 7 states have internal predecessors, (795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:03:07,157 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 15:03:07,157 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 15:03:07,157 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-21 15:03:07,157 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-21 15:03:07,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:03:07,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1351490247, now seen corresponding path program 2 times [2021-12-21 15:03:07,158 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:03:07,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578090350] [2021-12-21 15:03:07,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:03:07,158 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:03:07,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:03:07,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 15:03:07,222 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:03:07,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578090350] [2021-12-21 15:03:07,222 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578090350] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:03:07,222 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 15:03:07,222 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-21 15:03:07,222 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659971454] [2021-12-21 15:03:07,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:03:07,223 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-21 15:03:07,223 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:03:07,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-21 15:03:07,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-21 15:03:07,224 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 136 [2021-12-21 15:03:07,224 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 157 transitions, 890 flow. Second operand has 6 states, 6 states have (on average 112.5) internal successors, (675), 6 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:03:07,225 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-21 15:03:07,225 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 136 [2021-12-21 15:03:07,225 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-21 15:03:09,264 INFO L129 PetriNetUnfolder]: 7632/13221 cut-off events. [2021-12-21 15:03:09,264 INFO L130 PetriNetUnfolder]: For 204248/205494 co-relation queries the response was YES. [2021-12-21 15:03:09,333 INFO L84 FinitePrefix]: Finished finitePrefix Result has 64621 conditions, 13221 events. 7632/13221 cut-off events. For 204248/205494 co-relation queries the response was YES. Maximal size of possible extension queue 1058. Compared 111373 event pairs, 208 based on Foata normal form. 469/13075 useless extension candidates. Maximal degree in co-relation 64517. Up to 4870 conditions per place. [2021-12-21 15:03:09,381 INFO L132 encePairwiseOnDemand]: 125/136 looper letters, 112 selfloop transitions, 14 changer transitions 111/344 dead transitions. [2021-12-21 15:03:09,382 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 344 transitions, 3207 flow [2021-12-21 15:03:09,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-21 15:03:09,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-12-21 15:03:09,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1192 transitions. [2021-12-21 15:03:09,384 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8764705882352941 [2021-12-21 15:03:09,385 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1192 transitions. [2021-12-21 15:03:09,385 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1192 transitions. [2021-12-21 15:03:09,385 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 15:03:09,385 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1192 transitions. [2021-12-21 15:03:09,386 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 119.2) internal successors, (1192), 10 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:03:09,397 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 136.0) internal successors, (1496), 11 states have internal predecessors, (1496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:03:09,398 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 136.0) internal successors, (1496), 11 states have internal predecessors, (1496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:03:09,398 INFO L186 Difference]: Start difference. First operand has 186 places, 157 transitions, 890 flow. Second operand 10 states and 1192 transitions. [2021-12-21 15:03:09,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 344 transitions, 3207 flow [2021-12-21 15:03:09,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 344 transitions, 3193 flow, removed 6 selfloop flow, removed 7 redundant places. [2021-12-21 15:03:09,482 INFO L242 Difference]: Finished difference. Result has 188 places, 169 transitions, 986 flow [2021-12-21 15:03:09,482 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=876, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=986, PETRI_PLACES=188, PETRI_TRANSITIONS=169} [2021-12-21 15:03:09,484 INFO L334 CegarLoopForPetriNet]: 143 programPoint places, 45 predicate places. [2021-12-21 15:03:09,484 INFO L470 AbstractCegarLoop]: Abstraction has has 188 places, 169 transitions, 986 flow [2021-12-21 15:03:09,484 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 112.5) internal successors, (675), 6 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:03:09,484 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 15:03:09,484 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 15:03:09,484 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-21 15:03:09,485 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-21 15:03:09,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:03:09,485 INFO L85 PathProgramCache]: Analyzing trace with hash 252481646, now seen corresponding path program 1 times [2021-12-21 15:03:09,485 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:03:09,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637827686] [2021-12-21 15:03:09,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:03:09,486 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:03:09,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:03:09,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 15:03:09,664 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:03:09,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637827686] [2021-12-21 15:03:09,664 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637827686] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:03:09,664 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 15:03:09,665 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-21 15:03:09,666 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76364471] [2021-12-21 15:03:09,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:03:09,666 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-21 15:03:09,667 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:03:09,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-21 15:03:09,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-21 15:03:09,670 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 136 [2021-12-21 15:03:09,670 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 169 transitions, 986 flow. Second operand has 7 states, 7 states have (on average 112.28571428571429) internal successors, (786), 7 states have internal predecessors, (786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:03:09,670 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-21 15:03:09,670 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 136 [2021-12-21 15:03:09,670 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-21 15:03:11,568 INFO L129 PetriNetUnfolder]: 7129/13159 cut-off events. [2021-12-21 15:03:11,569 INFO L130 PetriNetUnfolder]: For 211146/212272 co-relation queries the response was YES. [2021-12-21 15:03:11,630 INFO L84 FinitePrefix]: Finished finitePrefix Result has 74621 conditions, 13159 events. 7129/13159 cut-off events. For 211146/212272 co-relation queries the response was YES. Maximal size of possible extension queue 1149. Compared 120049 event pairs, 99 based on Foata normal form. 663/13453 useless extension candidates. Maximal degree in co-relation 74515. Up to 3798 conditions per place. [2021-12-21 15:03:11,658 INFO L132 encePairwiseOnDemand]: 125/136 looper letters, 128 selfloop transitions, 28 changer transitions 92/351 dead transitions. [2021-12-21 15:03:11,658 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 351 transitions, 3462 flow [2021-12-21 15:03:11,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-21 15:03:11,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-12-21 15:03:11,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1547 transitions. [2021-12-21 15:03:11,661 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.875 [2021-12-21 15:03:11,661 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1547 transitions. [2021-12-21 15:03:11,661 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1547 transitions. [2021-12-21 15:03:11,661 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 15:03:11,661 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1547 transitions. [2021-12-21 15:03:11,663 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 119.0) internal successors, (1547), 13 states have internal predecessors, (1547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:03:11,664 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 136.0) internal successors, (1904), 14 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:03:11,665 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 136.0) internal successors, (1904), 14 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:03:11,665 INFO L186 Difference]: Start difference. First operand has 188 places, 169 transitions, 986 flow. Second operand 13 states and 1547 transitions. [2021-12-21 15:03:11,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 351 transitions, 3462 flow [2021-12-21 15:03:11,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 351 transitions, 3368 flow, removed 8 selfloop flow, removed 4 redundant places. [2021-12-21 15:03:11,768 INFO L242 Difference]: Finished difference. Result has 202 places, 170 transitions, 1023 flow [2021-12-21 15:03:11,768 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=787, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1023, PETRI_PLACES=202, PETRI_TRANSITIONS=170} [2021-12-21 15:03:11,769 INFO L334 CegarLoopForPetriNet]: 143 programPoint places, 59 predicate places. [2021-12-21 15:03:11,769 INFO L470 AbstractCegarLoop]: Abstraction has has 202 places, 170 transitions, 1023 flow [2021-12-21 15:03:11,769 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 112.28571428571429) internal successors, (786), 7 states have internal predecessors, (786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:03:11,769 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 15:03:11,769 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 15:03:11,770 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-21 15:03:11,770 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-21 15:03:11,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:03:11,770 INFO L85 PathProgramCache]: Analyzing trace with hash -2105226351, now seen corresponding path program 1 times [2021-12-21 15:03:11,770 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:03:11,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44602702] [2021-12-21 15:03:11,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:03:11,771 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:03:11,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:03:11,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 15:03:11,989 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:03:11,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44602702] [2021-12-21 15:03:11,990 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44602702] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:03:11,990 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 15:03:11,990 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-12-21 15:03:11,990 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156419110] [2021-12-21 15:03:11,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:03:11,990 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-21 15:03:11,990 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:03:11,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-21 15:03:11,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2021-12-21 15:03:11,992 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 136 [2021-12-21 15:03:11,993 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 170 transitions, 1023 flow. Second operand has 12 states, 12 states have (on average 111.58333333333333) internal successors, (1339), 12 states have internal predecessors, (1339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:03:11,993 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-21 15:03:11,993 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 136 [2021-12-21 15:03:11,993 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-21 15:03:13,017 INFO L129 PetriNetUnfolder]: 1385/5152 cut-off events. [2021-12-21 15:03:13,018 INFO L130 PetriNetUnfolder]: For 42507/44508 co-relation queries the response was YES. [2021-12-21 15:03:13,059 INFO L84 FinitePrefix]: Finished finitePrefix Result has 24002 conditions, 5152 events. 1385/5152 cut-off events. For 42507/44508 co-relation queries the response was YES. Maximal size of possible extension queue 542. Compared 58495 event pairs, 114 based on Foata normal form. 85/4883 useless extension candidates. Maximal degree in co-relation 23887. Up to 1452 conditions per place. [2021-12-21 15:03:13,082 INFO L132 encePairwiseOnDemand]: 123/136 looper letters, 47 selfloop transitions, 44 changer transitions 6/223 dead transitions. [2021-12-21 15:03:13,082 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 223 transitions, 2053 flow [2021-12-21 15:03:13,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-21 15:03:13,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2021-12-21 15:03:13,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 2064 transitions. [2021-12-21 15:03:13,085 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8431372549019608 [2021-12-21 15:03:13,085 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 2064 transitions. [2021-12-21 15:03:13,085 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 2064 transitions. [2021-12-21 15:03:13,085 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 15:03:13,085 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 2064 transitions. [2021-12-21 15:03:13,088 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 114.66666666666667) internal successors, (2064), 18 states have internal predecessors, (2064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:03:13,090 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 136.0) internal successors, (2584), 19 states have internal predecessors, (2584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:03:13,090 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 136.0) internal successors, (2584), 19 states have internal predecessors, (2584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:03:13,090 INFO L186 Difference]: Start difference. First operand has 202 places, 170 transitions, 1023 flow. Second operand 18 states and 2064 transitions. [2021-12-21 15:03:13,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 223 transitions, 2053 flow [2021-12-21 15:03:13,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 223 transitions, 1968 flow, removed 36 selfloop flow, removed 4 redundant places. [2021-12-21 15:03:13,344 INFO L242 Difference]: Finished difference. Result has 221 places, 192 transitions, 1507 flow [2021-12-21 15:03:13,344 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=944, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=1507, PETRI_PLACES=221, PETRI_TRANSITIONS=192} [2021-12-21 15:03:13,344 INFO L334 CegarLoopForPetriNet]: 143 programPoint places, 78 predicate places. [2021-12-21 15:03:13,344 INFO L470 AbstractCegarLoop]: Abstraction has has 221 places, 192 transitions, 1507 flow [2021-12-21 15:03:13,345 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 111.58333333333333) internal successors, (1339), 12 states have internal predecessors, (1339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:03:13,345 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 15:03:13,345 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 15:03:13,345 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-21 15:03:13,345 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-21 15:03:13,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:03:13,346 INFO L85 PathProgramCache]: Analyzing trace with hash 146925184, now seen corresponding path program 1 times [2021-12-21 15:03:13,346 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:03:13,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418494596] [2021-12-21 15:03:13,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:03:13,346 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:03:13,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:03:13,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 15:03:13,437 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:03:13,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418494596] [2021-12-21 15:03:13,437 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418494596] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:03:13,437 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 15:03:13,437 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-21 15:03:13,438 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980321947] [2021-12-21 15:03:13,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:03:13,438 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-21 15:03:13,438 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:03:13,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-21 15:03:13,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-21 15:03:13,439 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 136 [2021-12-21 15:03:13,440 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 192 transitions, 1507 flow. Second operand has 8 states, 8 states have (on average 112.25) internal successors, (898), 8 states have internal predecessors, (898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:03:13,440 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-21 15:03:13,440 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 136 [2021-12-21 15:03:13,440 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-21 15:03:16,280 INFO L129 PetriNetUnfolder]: 7593/14644 cut-off events. [2021-12-21 15:03:16,280 INFO L130 PetriNetUnfolder]: For 459857/463082 co-relation queries the response was YES. [2021-12-21 15:03:16,370 INFO L84 FinitePrefix]: Finished finitePrefix Result has 104516 conditions, 14644 events. 7593/14644 cut-off events. For 459857/463082 co-relation queries the response was YES. Maximal size of possible extension queue 1340. Compared 142970 event pairs, 61 based on Foata normal form. 899/15032 useless extension candidates. Maximal degree in co-relation 104396. Up to 4021 conditions per place. [2021-12-21 15:03:16,391 INFO L132 encePairwiseOnDemand]: 125/136 looper letters, 111 selfloop transitions, 31 changer transitions 188/435 dead transitions. [2021-12-21 15:03:16,392 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 435 transitions, 6106 flow [2021-12-21 15:03:16,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-21 15:03:16,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-12-21 15:03:16,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1905 transitions. [2021-12-21 15:03:16,394 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8754595588235294 [2021-12-21 15:03:16,394 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1905 transitions. [2021-12-21 15:03:16,394 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1905 transitions. [2021-12-21 15:03:16,395 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 15:03:16,395 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1905 transitions. [2021-12-21 15:03:16,397 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 119.0625) internal successors, (1905), 16 states have internal predecessors, (1905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:03:16,400 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 136.0) internal successors, (2312), 17 states have internal predecessors, (2312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:03:16,401 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 136.0) internal successors, (2312), 17 states have internal predecessors, (2312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:03:16,401 INFO L186 Difference]: Start difference. First operand has 221 places, 192 transitions, 1507 flow. Second operand 16 states and 1905 transitions. [2021-12-21 15:03:16,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 435 transitions, 6106 flow [2021-12-21 15:03:16,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 435 transitions, 5095 flow, removed 429 selfloop flow, removed 10 redundant places. [2021-12-21 15:03:16,955 INFO L242 Difference]: Finished difference. Result has 233 places, 179 transitions, 1222 flow [2021-12-21 15:03:16,955 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=1154, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1222, PETRI_PLACES=233, PETRI_TRANSITIONS=179} [2021-12-21 15:03:16,955 INFO L334 CegarLoopForPetriNet]: 143 programPoint places, 90 predicate places. [2021-12-21 15:03:16,956 INFO L470 AbstractCegarLoop]: Abstraction has has 233 places, 179 transitions, 1222 flow [2021-12-21 15:03:16,956 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 112.25) internal successors, (898), 8 states have internal predecessors, (898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:03:16,956 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 15:03:16,956 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 15:03:16,956 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-21 15:03:16,956 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-21 15:03:16,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:03:16,957 INFO L85 PathProgramCache]: Analyzing trace with hash 745416670, now seen corresponding path program 1 times [2021-12-21 15:03:16,957 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:03:16,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041631221] [2021-12-21 15:03:16,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:03:16,957 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:03:17,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:03:17,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 15:03:17,145 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:03:17,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041631221] [2021-12-21 15:03:17,147 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041631221] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:03:17,147 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 15:03:17,147 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-21 15:03:17,147 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746761569] [2021-12-21 15:03:17,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:03:17,148 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-21 15:03:17,148 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:03:17,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-21 15:03:17,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-21 15:03:17,149 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 136 [2021-12-21 15:03:17,150 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 179 transitions, 1222 flow. Second operand has 9 states, 9 states have (on average 112.11111111111111) internal successors, (1009), 9 states have internal predecessors, (1009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:03:17,150 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-21 15:03:17,150 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 136 [2021-12-21 15:03:17,150 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-21 15:03:19,374 INFO L129 PetriNetUnfolder]: 5838/11646 cut-off events. [2021-12-21 15:03:19,375 INFO L130 PetriNetUnfolder]: For 340461/342598 co-relation queries the response was YES. [2021-12-21 15:03:19,572 INFO L84 FinitePrefix]: Finished finitePrefix Result has 81844 conditions, 11646 events. 5838/11646 cut-off events. For 340461/342598 co-relation queries the response was YES. Maximal size of possible extension queue 1252. Compared 115941 event pairs, 57 based on Foata normal form. 748/11884 useless extension candidates. Maximal degree in co-relation 81780. Up to 3761 conditions per place. [2021-12-21 15:03:19,603 INFO L132 encePairwiseOnDemand]: 126/136 looper letters, 72 selfloop transitions, 27 changer transitions 173/373 dead transitions. [2021-12-21 15:03:19,604 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 373 transitions, 4462 flow [2021-12-21 15:03:19,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-21 15:03:19,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2021-12-21 15:03:19,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 2101 transitions. [2021-12-21 15:03:19,607 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.858251633986928 [2021-12-21 15:03:19,607 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 2101 transitions. [2021-12-21 15:03:19,607 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 2101 transitions. [2021-12-21 15:03:19,608 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 15:03:19,608 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 2101 transitions. [2021-12-21 15:03:19,610 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 116.72222222222223) internal successors, (2101), 18 states have internal predecessors, (2101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:03:19,612 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 136.0) internal successors, (2584), 19 states have internal predecessors, (2584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:03:19,613 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 136.0) internal successors, (2584), 19 states have internal predecessors, (2584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:03:19,613 INFO L186 Difference]: Start difference. First operand has 233 places, 179 transitions, 1222 flow. Second operand 18 states and 2101 transitions. [2021-12-21 15:03:19,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 373 transitions, 4462 flow [2021-12-21 15:03:20,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 373 transitions, 3958 flow, removed 220 selfloop flow, removed 16 redundant places. [2021-12-21 15:03:20,535 INFO L242 Difference]: Finished difference. Result has 228 places, 160 transitions, 950 flow [2021-12-21 15:03:20,535 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=1026, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=950, PETRI_PLACES=228, PETRI_TRANSITIONS=160} [2021-12-21 15:03:20,536 INFO L334 CegarLoopForPetriNet]: 143 programPoint places, 85 predicate places. [2021-12-21 15:03:20,536 INFO L470 AbstractCegarLoop]: Abstraction has has 228 places, 160 transitions, 950 flow [2021-12-21 15:03:20,536 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 112.11111111111111) internal successors, (1009), 9 states have internal predecessors, (1009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:03:20,536 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 15:03:20,537 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 15:03:20,537 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-21 15:03:20,537 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-21 15:03:20,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:03:20,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1091548107, now seen corresponding path program 1 times [2021-12-21 15:03:20,537 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:03:20,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605165736] [2021-12-21 15:03:20,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:03:20,538 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:03:20,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:03:20,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 15:03:20,638 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:03:20,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605165736] [2021-12-21 15:03:20,639 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605165736] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:03:20,639 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 15:03:20,639 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-21 15:03:20,639 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509445531] [2021-12-21 15:03:20,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:03:20,639 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-21 15:03:20,639 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:03:20,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-21 15:03:20,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-21 15:03:20,640 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 136 [2021-12-21 15:03:20,641 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 160 transitions, 950 flow. Second operand has 7 states, 7 states have (on average 114.71428571428571) internal successors, (803), 7 states have internal predecessors, (803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:03:20,641 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-21 15:03:20,641 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 136 [2021-12-21 15:03:20,641 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-21 15:03:21,359 INFO L129 PetriNetUnfolder]: 1079/5323 cut-off events. [2021-12-21 15:03:21,359 INFO L130 PetriNetUnfolder]: For 27863/31202 co-relation queries the response was YES. [2021-12-21 15:03:21,419 INFO L84 FinitePrefix]: Finished finitePrefix Result has 18565 conditions, 5323 events. 1079/5323 cut-off events. For 27863/31202 co-relation queries the response was YES. Maximal size of possible extension queue 714. Compared 67352 event pairs, 43 based on Foata normal form. 15/4854 useless extension candidates. Maximal degree in co-relation 18446. Up to 1143 conditions per place. [2021-12-21 15:03:21,432 INFO L132 encePairwiseOnDemand]: 130/136 looper letters, 40 selfloop transitions, 1 changer transitions 26/194 dead transitions. [2021-12-21 15:03:21,433 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 194 transitions, 1457 flow [2021-12-21 15:03:21,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-21 15:03:21,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-12-21 15:03:21,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 821 transitions. [2021-12-21 15:03:21,434 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8623949579831933 [2021-12-21 15:03:21,435 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 821 transitions. [2021-12-21 15:03:21,435 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 821 transitions. [2021-12-21 15:03:21,435 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 15:03:21,435 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 821 transitions. [2021-12-21 15:03:21,438 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 117.28571428571429) internal successors, (821), 7 states have internal predecessors, (821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:03:21,439 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 136.0) internal successors, (1088), 8 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:03:21,439 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 136.0) internal successors, (1088), 8 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:03:21,439 INFO L186 Difference]: Start difference. First operand has 228 places, 160 transitions, 950 flow. Second operand 7 states and 821 transitions. [2021-12-21 15:03:21,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 194 transitions, 1457 flow [2021-12-21 15:03:21,670 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 194 transitions, 999 flow, removed 130 selfloop flow, removed 48 redundant places. [2021-12-21 15:03:21,672 INFO L242 Difference]: Finished difference. Result has 180 places, 160 transitions, 649 flow [2021-12-21 15:03:21,672 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=636, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=649, PETRI_PLACES=180, PETRI_TRANSITIONS=160} [2021-12-21 15:03:21,673 INFO L334 CegarLoopForPetriNet]: 143 programPoint places, 37 predicate places. [2021-12-21 15:03:21,673 INFO L470 AbstractCegarLoop]: Abstraction has has 180 places, 160 transitions, 649 flow [2021-12-21 15:03:21,673 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 114.71428571428571) internal successors, (803), 7 states have internal predecessors, (803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:03:21,673 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 15:03:21,673 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 15:03:21,673 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-21 15:03:21,674 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-21 15:03:21,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:03:21,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1212285675, now seen corresponding path program 2 times [2021-12-21 15:03:21,674 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:03:21,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424183195] [2021-12-21 15:03:21,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:03:21,674 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:03:21,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:03:21,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 15:03:21,750 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:03:21,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424183195] [2021-12-21 15:03:21,751 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424183195] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:03:21,751 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 15:03:21,751 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-21 15:03:21,751 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548210930] [2021-12-21 15:03:21,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:03:21,751 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-21 15:03:21,751 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:03:21,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-21 15:03:21,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-21 15:03:21,752 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 136 [2021-12-21 15:03:21,753 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 160 transitions, 649 flow. Second operand has 7 states, 7 states have (on average 114.71428571428571) internal successors, (803), 7 states have internal predecessors, (803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:03:21,753 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-21 15:03:21,753 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 136 [2021-12-21 15:03:21,753 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-21 15:03:22,338 INFO L129 PetriNetUnfolder]: 1172/5316 cut-off events. [2021-12-21 15:03:22,338 INFO L130 PetriNetUnfolder]: For 4587/5045 co-relation queries the response was YES. [2021-12-21 15:03:22,370 INFO L84 FinitePrefix]: Finished finitePrefix Result has 12133 conditions, 5316 events. 1172/5316 cut-off events. For 4587/5045 co-relation queries the response was YES. Maximal size of possible extension queue 730. Compared 67137 event pairs, 22 based on Foata normal form. 17/4873 useless extension candidates. Maximal degree in co-relation 12104. Up to 790 conditions per place. [2021-12-21 15:03:22,375 INFO L132 encePairwiseOnDemand]: 130/136 looper letters, 32 selfloop transitions, 1 changer transitions 47/201 dead transitions. [2021-12-21 15:03:22,376 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 201 transitions, 1088 flow [2021-12-21 15:03:22,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-21 15:03:22,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-12-21 15:03:22,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 821 transitions. [2021-12-21 15:03:22,377 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8623949579831933 [2021-12-21 15:03:22,377 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 821 transitions. [2021-12-21 15:03:22,377 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 821 transitions. [2021-12-21 15:03:22,378 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 15:03:22,378 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 821 transitions. [2021-12-21 15:03:22,379 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 117.28571428571429) internal successors, (821), 7 states have internal predecessors, (821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:03:22,379 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 136.0) internal successors, (1088), 8 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:03:22,380 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 136.0) internal successors, (1088), 8 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:03:22,380 INFO L186 Difference]: Start difference. First operand has 180 places, 160 transitions, 649 flow. Second operand 7 states and 821 transitions. [2021-12-21 15:03:22,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 201 transitions, 1088 flow [2021-12-21 15:03:22,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 201 transitions, 1073 flow, removed 7 selfloop flow, removed 5 redundant places. [2021-12-21 15:03:22,420 INFO L242 Difference]: Finished difference. Result has 182 places, 149 transitions, 571 flow [2021-12-21 15:03:22,420 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=640, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=571, PETRI_PLACES=182, PETRI_TRANSITIONS=149} [2021-12-21 15:03:22,420 INFO L334 CegarLoopForPetriNet]: 143 programPoint places, 39 predicate places. [2021-12-21 15:03:22,421 INFO L470 AbstractCegarLoop]: Abstraction has has 182 places, 149 transitions, 571 flow [2021-12-21 15:03:22,421 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 114.71428571428571) internal successors, (803), 7 states have internal predecessors, (803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:03:22,421 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 15:03:22,421 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 15:03:22,421 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-21 15:03:22,421 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-21 15:03:22,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:03:22,422 INFO L85 PathProgramCache]: Analyzing trace with hash -743189931, now seen corresponding path program 3 times [2021-12-21 15:03:22,422 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:03:22,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138999146] [2021-12-21 15:03:22,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:03:22,422 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:03:22,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:03:22,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 15:03:22,591 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:03:22,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138999146] [2021-12-21 15:03:22,592 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138999146] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:03:22,593 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 15:03:22,593 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-21 15:03:22,593 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434097263] [2021-12-21 15:03:22,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:03:22,594 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-21 15:03:22,594 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:03:22,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-21 15:03:22,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-12-21 15:03:22,595 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 136 [2021-12-21 15:03:22,596 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 149 transitions, 571 flow. Second operand has 10 states, 10 states have (on average 111.2) internal successors, (1112), 10 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:03:22,596 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-21 15:03:22,596 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 136 [2021-12-21 15:03:22,596 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-21 15:03:22,829 INFO L129 PetriNetUnfolder]: 272/1462 cut-off events. [2021-12-21 15:03:22,830 INFO L130 PetriNetUnfolder]: For 910/1036 co-relation queries the response was YES. [2021-12-21 15:03:22,837 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3021 conditions, 1462 events. 272/1462 cut-off events. For 910/1036 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 14211 event pairs, 0 based on Foata normal form. 2/1346 useless extension candidates. Maximal degree in co-relation 2991. Up to 242 conditions per place. [2021-12-21 15:03:22,839 INFO L132 encePairwiseOnDemand]: 126/136 looper letters, 25 selfloop transitions, 12 changer transitions 5/158 dead transitions. [2021-12-21 15:03:22,839 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 158 transitions, 703 flow [2021-12-21 15:03:22,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-21 15:03:22,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-21 15:03:22,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1014 transitions. [2021-12-21 15:03:22,841 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8284313725490197 [2021-12-21 15:03:22,841 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1014 transitions. [2021-12-21 15:03:22,841 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1014 transitions. [2021-12-21 15:03:22,841 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 15:03:22,842 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1014 transitions. [2021-12-21 15:03:22,843 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 112.66666666666667) internal successors, (1014), 9 states have internal predecessors, (1014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:03:22,844 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 136.0) internal successors, (1360), 10 states have internal predecessors, (1360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:03:22,844 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 136.0) internal successors, (1360), 10 states have internal predecessors, (1360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:03:22,845 INFO L186 Difference]: Start difference. First operand has 182 places, 149 transitions, 571 flow. Second operand 9 states and 1014 transitions. [2021-12-21 15:03:22,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 158 transitions, 703 flow [2021-12-21 15:03:22,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 158 transitions, 658 flow, removed 18 selfloop flow, removed 12 redundant places. [2021-12-21 15:03:22,852 INFO L242 Difference]: Finished difference. Result has 175 places, 151 transitions, 601 flow [2021-12-21 15:03:22,852 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=540, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=601, PETRI_PLACES=175, PETRI_TRANSITIONS=151} [2021-12-21 15:03:22,853 INFO L334 CegarLoopForPetriNet]: 143 programPoint places, 32 predicate places. [2021-12-21 15:03:22,854 INFO L470 AbstractCegarLoop]: Abstraction has has 175 places, 151 transitions, 601 flow [2021-12-21 15:03:22,855 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 111.2) internal successors, (1112), 10 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:03:22,855 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 15:03:22,855 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 15:03:22,855 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-21 15:03:22,855 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-21 15:03:22,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:03:22,856 INFO L85 PathProgramCache]: Analyzing trace with hash 373963883, now seen corresponding path program 4 times [2021-12-21 15:03:22,856 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:03:22,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559686230] [2021-12-21 15:03:22,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:03:22,856 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:03:22,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:03:23,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 15:03:23,090 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:03:23,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559686230] [2021-12-21 15:03:23,091 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559686230] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:03:23,091 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 15:03:23,091 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-12-21 15:03:23,091 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388925265] [2021-12-21 15:03:23,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:03:23,092 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-21 15:03:23,092 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:03:23,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-21 15:03:23,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2021-12-21 15:03:23,093 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 136 [2021-12-21 15:03:23,094 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 151 transitions, 601 flow. Second operand has 13 states, 13 states have (on average 108.84615384615384) internal successors, (1415), 13 states have internal predecessors, (1415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:03:23,094 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-21 15:03:23,094 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 136 [2021-12-21 15:03:23,094 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-21 15:03:23,428 INFO L129 PetriNetUnfolder]: 335/1748 cut-off events. [2021-12-21 15:03:23,428 INFO L130 PetriNetUnfolder]: For 1183/1342 co-relation queries the response was YES. [2021-12-21 15:03:23,435 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3569 conditions, 1748 events. 335/1748 cut-off events. For 1183/1342 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 17798 event pairs, 1 based on Foata normal form. 4/1615 useless extension candidates. Maximal degree in co-relation 3544. Up to 290 conditions per place. [2021-12-21 15:03:23,437 INFO L132 encePairwiseOnDemand]: 124/136 looper letters, 24 selfloop transitions, 13 changer transitions 11/161 dead transitions. [2021-12-21 15:03:23,437 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 161 transitions, 735 flow [2021-12-21 15:03:23,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-21 15:03:23,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-12-21 15:03:23,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1322 transitions. [2021-12-21 15:03:23,439 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8100490196078431 [2021-12-21 15:03:23,439 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1322 transitions. [2021-12-21 15:03:23,439 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1322 transitions. [2021-12-21 15:03:23,439 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 15:03:23,439 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1322 transitions. [2021-12-21 15:03:23,441 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 110.16666666666667) internal successors, (1322), 12 states have internal predecessors, (1322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:03:23,442 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 136.0) internal successors, (1768), 13 states have internal predecessors, (1768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:03:23,442 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 136.0) internal successors, (1768), 13 states have internal predecessors, (1768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:03:23,442 INFO L186 Difference]: Start difference. First operand has 175 places, 151 transitions, 601 flow. Second operand 12 states and 1322 transitions. [2021-12-21 15:03:23,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 161 transitions, 735 flow [2021-12-21 15:03:23,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 161 transitions, 704 flow, removed 7 selfloop flow, removed 7 redundant places. [2021-12-21 15:03:23,450 INFO L242 Difference]: Finished difference. Result has 180 places, 148 transitions, 588 flow [2021-12-21 15:03:23,450 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=574, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=588, PETRI_PLACES=180, PETRI_TRANSITIONS=148} [2021-12-21 15:03:23,451 INFO L334 CegarLoopForPetriNet]: 143 programPoint places, 37 predicate places. [2021-12-21 15:03:23,451 INFO L470 AbstractCegarLoop]: Abstraction has has 180 places, 148 transitions, 588 flow [2021-12-21 15:03:23,451 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 108.84615384615384) internal successors, (1415), 13 states have internal predecessors, (1415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:03:23,451 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 15:03:23,451 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 15:03:23,452 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-21 15:03:23,452 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-21 15:03:23,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:03:23,452 INFO L85 PathProgramCache]: Analyzing trace with hash -20304517, now seen corresponding path program 5 times [2021-12-21 15:03:23,452 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:03:23,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785181790] [2021-12-21 15:03:23,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:03:23,453 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:03:23,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 15:03:23,502 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 15:03:23,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 15:03:23,575 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 15:03:23,575 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-21 15:03:23,576 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2021-12-21 15:03:23,577 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2021-12-21 15:03:23,577 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (4 of 7 remaining) [2021-12-21 15:03:23,578 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (3 of 7 remaining) [2021-12-21 15:03:23,578 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION (2 of 7 remaining) [2021-12-21 15:03:23,578 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATION (1 of 7 remaining) [2021-12-21 15:03:23,578 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2021-12-21 15:03:23,578 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-21 15:03:23,581 INFO L732 BasicCegarLoop]: Path program histogram: [5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 15:03:23,585 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-12-21 15:03:23,585 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-21 15:03:23,678 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 03:03:23 BasicIcfg [2021-12-21 15:03:23,679 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-21 15:03:23,679 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-21 15:03:23,679 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-21 15:03:23,679 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-21 15:03:23,680 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 03:03:01" (3/4) ... [2021-12-21 15:03:23,681 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-21 15:03:23,786 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-21 15:03:23,799 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-21 15:03:23,800 INFO L158 Benchmark]: Toolchain (without parser) took 23579.40ms. Allocated memory was 88.1MB in the beginning and 9.0GB in the end (delta: 8.9GB). Free memory was 65.8MB in the beginning and 8.0GB in the end (delta: -7.9GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2021-12-21 15:03:23,800 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 88.1MB. Free memory is still 63.3MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-21 15:03:23,800 INFO L158 Benchmark]: CACSL2BoogieTranslator took 410.39ms. Allocated memory is still 88.1MB. Free memory was 65.6MB in the beginning and 42.4MB in the end (delta: 23.2MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2021-12-21 15:03:23,800 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.93ms. Allocated memory is still 88.1MB. Free memory was 42.2MB in the beginning and 39.3MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-21 15:03:23,801 INFO L158 Benchmark]: Boogie Preprocessor took 51.74ms. Allocated memory is still 88.1MB. Free memory was 39.3MB in the beginning and 37.0MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-21 15:03:23,801 INFO L158 Benchmark]: RCFGBuilder took 811.23ms. Allocated memory was 88.1MB in the beginning and 107.0MB in the end (delta: 18.9MB). Free memory was 37.0MB in the beginning and 43.8MB in the end (delta: -6.8MB). Peak memory consumption was 18.8MB. Max. memory is 16.1GB. [2021-12-21 15:03:23,801 INFO L158 Benchmark]: TraceAbstraction took 22115.03ms. Allocated memory was 107.0MB in the beginning and 9.0GB in the end (delta: 8.9GB). Free memory was 43.0MB in the beginning and 8.0GB in the end (delta: -8.0GB). Peak memory consumption was 942.0MB. Max. memory is 16.1GB. [2021-12-21 15:03:23,801 INFO L158 Benchmark]: Witness Printer took 120.03ms. Allocated memory is still 9.0GB. Free memory was 8.0GB in the beginning and 8.0GB in the end (delta: 40.9MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2021-12-21 15:03:23,802 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.17ms. Allocated memory is still 88.1MB. Free memory is still 63.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 410.39ms. Allocated memory is still 88.1MB. Free memory was 65.6MB in the beginning and 42.4MB in the end (delta: 23.2MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.93ms. Allocated memory is still 88.1MB. Free memory was 42.2MB in the beginning and 39.3MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.74ms. Allocated memory is still 88.1MB. Free memory was 39.3MB in the beginning and 37.0MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 811.23ms. Allocated memory was 88.1MB in the beginning and 107.0MB in the end (delta: 18.9MB). Free memory was 37.0MB in the beginning and 43.8MB in the end (delta: -6.8MB). Peak memory consumption was 18.8MB. Max. memory is 16.1GB. * TraceAbstraction took 22115.03ms. Allocated memory was 107.0MB in the beginning and 9.0GB in the end (delta: 8.9GB). Free memory was 43.0MB in the beginning and 8.0GB in the end (delta: -8.0GB). Peak memory consumption was 942.0MB. Max. memory is 16.1GB. * Witness Printer took 120.03ms. Allocated memory is still 9.0GB. Free memory was 8.0GB in the beginning and 8.0GB in the end (delta: 40.9MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L712] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L714] 0 int __unbuffered_p3_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0] [L716] 0 int __unbuffered_p3_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0] [L718] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0] [L719] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0] [L720] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L722] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L724] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L725] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L726] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L727] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L728] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L729] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=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] [L730] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=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] [L731] 0 _Bool y$r_buff0_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=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_buff0_thd4=0] [L732] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=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_buff0_thd4=0, y$r_buff1_thd0=0] [L733] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L734] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L735] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L736] 0 _Bool y$r_buff1_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0] [L737] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0] [L738] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L739] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L740] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L741] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L742] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L744] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L745] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L746] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L846] 0 pthread_t t773; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t773={5: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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L847] FCALL, FORK 0 pthread_create(&t773, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t773, ((void *)0), P0, ((void *)0))=-3, t773={5: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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L848] 0 pthread_t t774; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t773={5:0}, t774={6: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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L849] FCALL, FORK 0 pthread_create(&t774, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t774, ((void *)0), P1, ((void *)0))=-2, t773={5:0}, t774={6: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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L850] 0 pthread_t t775; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t773={5:0}, t774={6:0}, t775={7: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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L851] FCALL, FORK 0 pthread_create(&t775, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t775, ((void *)0), P2, ((void *)0))=-1, t773={5:0}, t774={6:0}, t775={7: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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L785] 3 y$w_buff1 = y$w_buff0 [L786] 3 y$w_buff0 = 2 [L787] 3 y$w_buff1_used = y$w_buff0_used [L788] 3 y$w_buff0_used = (_Bool)1 [L789] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L789] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L790] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L791] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L792] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L793] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L794] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L795] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L798] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L852] 0 pthread_t t776; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t773={5:0}, t774={6:0}, t775={7:0}, t776={3: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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L853] FCALL, FORK 0 pthread_create(&t776, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t776, ((void *)0), P3, ((void *)0))=0, t773={5:0}, t774={6:0}, t775={7:0}, t776={3: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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L815] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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=2] [L818] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=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=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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=2] [L821] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=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=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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=2] [L824] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L824] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L824] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L824] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L825] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L825] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L826] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L826] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L827] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L827] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L828] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L828] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L750] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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=2] [L753] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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=2] [L765] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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=2] [L768] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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=2] [L771] 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) [L771] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L771] 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) [L771] 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) [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L773] 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 [L774] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L775] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L775] 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 [L801] 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) [L801] 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) [L802] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L802] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L803] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L803] 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 [L804] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L804] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L805] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L805] 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 [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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=2] [L808] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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=2] [L778] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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=2] [L831] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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=2] [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t773={5:0}, t774={6:0}, t775={7:0}, t776={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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=2] [L857] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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=2] [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] 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) [L859] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L859] 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) [L859] 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) [L860] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L860] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L861] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L861] 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 [L862] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L862] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L863] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L863] 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 [L866] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L867] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L868] 0 y$flush_delayed = weak$$choice2 [L869] 0 y$mem_tmp = y [L870] 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) [L870] 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) [L871] 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)) [L871] 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)) [L872] 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)) [L872] 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)) [L873] 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)) [L873] 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)) [L874] 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)) [L874] 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)) [L875] 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)) [L875] 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)) [L876] 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)) [L876] 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)) [L877] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L878] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L878] 0 y = y$flush_delayed ? y$mem_tmp : y [L879] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t773={5:0}, t774={6:0}, t775={7:0}, t776={3:0}, weak$$choice0=49, weak$$choice2=255, x=1, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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=2] [L881] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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=2] [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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=2] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 853]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 847]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 172 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 21.9s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 18.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1184 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1184 mSDsluCounter, 811 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1518 mSDsCounter, 394 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2611 IncrementalHoareTripleChecker+Invalid, 3005 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 394 mSolverCounterUnsat, 155 mSDtfsCounter, 2611 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 282 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 246 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 656 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1507occurred in iteration=11, InterpolantAutomatonStates: 222, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 1692 NumberOfCodeBlocks, 1692 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1570 ConstructedInterpolants, 0 QuantifiedInterpolants, 9752 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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! [2021-12-21 15:03:23,851 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE