./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 839c364b 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/mix054_pso.opt_rmo.opt_tso.oepc_tso.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 4b807ac1723767f46eb51e856f642cbeec29c757d6219d60986235d902b15355 --- Real Ultimate output --- This is Ultimate 0.2.2-839c364b5d67a0f615c82cb70ab247790648d4a9-839c364 [2021-12-14 16:36:03,460 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-14 16:36:03,461 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-14 16:36:03,497 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-14 16:36:03,498 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-14 16:36:03,499 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-14 16:36:03,499 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-14 16:36:03,501 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-14 16:36:03,508 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-14 16:36:03,509 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-14 16:36:03,510 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-14 16:36:03,513 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-14 16:36:03,513 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-14 16:36:03,517 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-14 16:36:03,519 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-14 16:36:03,520 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-14 16:36:03,522 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-14 16:36:03,524 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-14 16:36:03,525 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-14 16:36:03,529 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-14 16:36:03,532 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-14 16:36:03,533 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-14 16:36:03,534 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-14 16:36:03,535 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-14 16:36:03,536 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-14 16:36:03,540 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-14 16:36:03,541 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-14 16:36:03,541 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-14 16:36:03,542 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-14 16:36:03,543 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-14 16:36:03,543 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-14 16:36:03,543 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-14 16:36:03,544 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-14 16:36:03,545 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-14 16:36:03,546 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-14 16:36:03,547 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-14 16:36:03,547 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-14 16:36:03,547 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-14 16:36:03,548 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-14 16:36:03,548 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-14 16:36:03,549 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-14 16:36:03,549 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-14 16:36:03,573 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-14 16:36:03,575 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-14 16:36:03,576 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-14 16:36:03,576 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-14 16:36:03,577 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-14 16:36:03,577 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-14 16:36:03,578 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-14 16:36:03,578 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-14 16:36:03,578 INFO L138 SettingsManager]: * Use SBE=true [2021-12-14 16:36:03,578 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-14 16:36:03,579 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-14 16:36:03,579 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-14 16:36:03,579 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-14 16:36:03,579 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-14 16:36:03,579 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-14 16:36:03,580 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-14 16:36:03,580 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-14 16:36:03,580 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-14 16:36:03,580 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-14 16:36:03,580 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-14 16:36:03,580 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-14 16:36:03,581 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-14 16:36:03,581 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-14 16:36:03,581 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-14 16:36:03,581 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 16:36:03,581 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-14 16:36:03,582 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-14 16:36:03,582 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-14 16:36:03,583 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-14 16:36:03,583 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-14 16:36:03,583 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-14 16:36:03,583 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-14 16:36:03,583 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-14 16:36:03,583 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-14 16:36:03,584 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 -> 4b807ac1723767f46eb51e856f642cbeec29c757d6219d60986235d902b15355 [2021-12-14 16:36:03,761 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-14 16:36:03,795 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-14 16:36:03,797 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-14 16:36:03,798 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-14 16:36:03,799 INFO L275 PluginConnector]: CDTParser initialized [2021-12-14 16:36:03,800 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2021-12-14 16:36:03,857 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69279118f/3c4f5da2c64748039f10d5c6feaaf816/FLAGf98e7ea4e [2021-12-14 16:36:04,273 INFO L306 CDTParser]: Found 1 translation units. [2021-12-14 16:36:04,273 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2021-12-14 16:36:04,283 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69279118f/3c4f5da2c64748039f10d5c6feaaf816/FLAGf98e7ea4e [2021-12-14 16:36:04,642 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69279118f/3c4f5da2c64748039f10d5c6feaaf816 [2021-12-14 16:36:04,644 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-14 16:36:04,646 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-14 16:36:04,648 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-14 16:36:04,648 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-14 16:36:04,651 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-14 16:36:04,651 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 04:36:04" (1/1) ... [2021-12-14 16:36:04,653 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@181b18fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:36:04, skipping insertion in model container [2021-12-14 16:36:04,654 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 04:36:04" (1/1) ... [2021-12-14 16:36:04,660 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-14 16:36:04,704 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-14 16:36:04,880 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/mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i[973,986] [2021-12-14 16:36:05,040 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 16:36:05,045 INFO L203 MainTranslator]: Completed pre-run [2021-12-14 16:36:05,056 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/mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i[973,986] [2021-12-14 16:36:05,110 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 16:36:05,143 INFO L208 MainTranslator]: Completed translation [2021-12-14 16:36:05,143 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:36:05 WrapperNode [2021-12-14 16:36:05,143 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-14 16:36:05,144 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-14 16:36:05,144 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-14 16:36:05,144 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-14 16:36:05,149 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:36:05" (1/1) ... [2021-12-14 16:36:05,172 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:36:05" (1/1) ... [2021-12-14 16:36:05,206 INFO L137 Inliner]: procedures = 175, calls = 41, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 259 [2021-12-14 16:36:05,206 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-14 16:36:05,207 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-14 16:36:05,207 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-14 16:36:05,207 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-14 16:36:05,213 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:36:05" (1/1) ... [2021-12-14 16:36:05,213 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:36:05" (1/1) ... [2021-12-14 16:36:05,221 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:36:05" (1/1) ... [2021-12-14 16:36:05,222 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:36:05" (1/1) ... [2021-12-14 16:36:05,227 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:36:05" (1/1) ... [2021-12-14 16:36:05,229 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:36:05" (1/1) ... [2021-12-14 16:36:05,231 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:36:05" (1/1) ... [2021-12-14 16:36:05,234 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-14 16:36:05,234 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-14 16:36:05,234 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-14 16:36:05,235 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-14 16:36:05,235 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:36:05" (1/1) ... [2021-12-14 16:36:05,255 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 16:36:05,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 16:36:05,293 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-14 16:36:05,296 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-14 16:36:05,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-14 16:36:05,322 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-12-14 16:36:05,323 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-14 16:36:05,323 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-14 16:36:05,323 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-14 16:36:05,323 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-12-14 16:36:05,323 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-12-14 16:36:05,324 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-12-14 16:36:05,324 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-12-14 16:36:05,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-14 16:36:05,324 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-12-14 16:36:05,324 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-14 16:36:05,324 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-14 16:36:05,325 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-12-14 16:36:05,468 INFO L236 CfgBuilder]: Building ICFG [2021-12-14 16:36:05,469 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-14 16:36:05,857 INFO L277 CfgBuilder]: Performing block encoding [2021-12-14 16:36:06,062 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-14 16:36:06,063 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-12-14 16:36:06,064 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 04:36:06 BoogieIcfgContainer [2021-12-14 16:36:06,064 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-14 16:36:06,067 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-14 16:36:06,067 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-14 16:36:06,069 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-14 16:36:06,070 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 04:36:04" (1/3) ... [2021-12-14 16:36:06,071 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ee00e28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 04:36:06, skipping insertion in model container [2021-12-14 16:36:06,071 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:36:05" (2/3) ... [2021-12-14 16:36:06,071 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ee00e28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 04:36:06, skipping insertion in model container [2021-12-14 16:36:06,071 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 04:36:06" (3/3) ... [2021-12-14 16:36:06,072 INFO L111 eAbstractionObserver]: Analyzing ICFG mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2021-12-14 16:36:06,076 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-12-14 16:36:06,076 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-14 16:36:06,076 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-12-14 16:36:06,076 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-12-14 16:36:06,104 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:06,104 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:06,104 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:06,105 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:06,105 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:06,105 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:06,105 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:06,106 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:06,106 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:06,106 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:06,106 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:06,107 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:06,107 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:06,107 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:06,107 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:06,107 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:06,108 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:06,108 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:06,108 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:06,108 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:06,109 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:06,109 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:06,109 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:06,110 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:06,110 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:06,110 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:06,111 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:06,111 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:06,111 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:06,111 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:06,112 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:06,112 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:06,112 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:06,112 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:06,112 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:06,112 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:06,113 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:06,113 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:06,113 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:06,113 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:06,113 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:06,113 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:06,114 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:06,114 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:06,114 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:06,114 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:06,114 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:06,115 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:06,115 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:06,115 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:06,115 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:06,115 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:06,116 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:06,116 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:06,116 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:06,116 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:06,117 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:06,117 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:06,117 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:06,117 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:06,121 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:06,122 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:06,122 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:06,122 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:06,122 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:06,122 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:06,123 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:06,123 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:06,123 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:06,123 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:06,124 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:06,124 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:06,124 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:06,152 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:06,153 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:06,153 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:06,153 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:06,153 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:06,153 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:06,153 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:06,153 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:06,153 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:36:06,153 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-12-14 16:36:06,222 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-14 16:36:06,228 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-14 16:36:06,228 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-12-14 16:36:06,237 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 99 places, 94 transitions, 198 flow [2021-12-14 16:36:06,269 INFO L129 PetriNetUnfolder]: 2/92 cut-off events. [2021-12-14 16:36:06,270 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-12-14 16:36:06,272 INFO L84 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 92 events. 2/92 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 43 event pairs, 0 based on Foata normal form. 0/88 useless extension candidates. Maximal degree in co-relation 55. Up to 2 conditions per place. [2021-12-14 16:36:06,273 INFO L82 GeneralOperation]: Start removeDead. Operand has 99 places, 94 transitions, 198 flow [2021-12-14 16:36:06,280 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 97 places, 92 transitions, 190 flow [2021-12-14 16:36:06,296 INFO L129 PetriNetUnfolder]: 0/56 cut-off events. [2021-12-14 16:36:06,296 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-12-14 16:36:06,296 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-14 16:36:06,297 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] [2021-12-14 16:36:06,298 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-12-14 16:36:06,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:36:06,302 INFO L85 PathProgramCache]: Analyzing trace with hash -590582846, now seen corresponding path program 1 times [2021-12-14 16:36:06,308 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:36:06,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508787887] [2021-12-14 16:36:06,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:36:06,309 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:36:06,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:36:06,466 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-14 16:36:06,467 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:36:06,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508787887] [2021-12-14 16:36:06,467 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508787887] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:36:06,468 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:36:06,468 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 16:36:06,469 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282278038] [2021-12-14 16:36:06,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:36:06,475 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 16:36:06,475 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:36:06,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 16:36:06,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 16:36:06,492 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 94 [2021-12-14 16:36:06,494 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 92 transitions, 190 flow. Second operand has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 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-14 16:36:06,494 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-14 16:36:06,494 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 94 [2021-12-14 16:36:06,495 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-14 16:36:06,542 INFO L129 PetriNetUnfolder]: 17/160 cut-off events. [2021-12-14 16:36:06,542 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-12-14 16:36:06,543 INFO L84 FinitePrefix]: Finished finitePrefix Result has 208 conditions, 160 events. 17/160 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 394 event pairs, 3 based on Foata normal form. 6/158 useless extension candidates. Maximal degree in co-relation 161. Up to 27 conditions per place. [2021-12-14 16:36:06,544 INFO L132 encePairwiseOnDemand]: 89/94 looper letters, 9 selfloop transitions, 2 changer transitions 0/91 dead transitions. [2021-12-14 16:36:06,544 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 91 transitions, 210 flow [2021-12-14 16:36:06,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 16:36:06,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-12-14 16:36:06,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 262 transitions. [2021-12-14 16:36:06,557 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9290780141843972 [2021-12-14 16:36:06,557 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 262 transitions. [2021-12-14 16:36:06,558 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 262 transitions. [2021-12-14 16:36:06,559 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 16:36:06,560 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 262 transitions. [2021-12-14 16:36:06,562 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 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-14 16:36:06,566 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 94.0) internal successors, (376), 4 states have internal predecessors, (376), 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-14 16:36:06,566 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 94.0) internal successors, (376), 4 states have internal predecessors, (376), 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-14 16:36:06,567 INFO L186 Difference]: Start difference. First operand has 97 places, 92 transitions, 190 flow. Second operand 3 states and 262 transitions. [2021-12-14 16:36:06,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 91 transitions, 210 flow [2021-12-14 16:36:06,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 91 transitions, 208 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-12-14 16:36:06,571 INFO L242 Difference]: Finished difference. Result has 95 places, 88 transitions, 184 flow [2021-12-14 16:36:06,572 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=184, PETRI_PLACES=95, PETRI_TRANSITIONS=88} [2021-12-14 16:36:06,575 INFO L334 CegarLoopForPetriNet]: 97 programPoint places, -2 predicate places. [2021-12-14 16:36:06,575 INFO L470 AbstractCegarLoop]: Abstraction has has 95 places, 88 transitions, 184 flow [2021-12-14 16:36:06,575 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 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-14 16:36:06,576 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-14 16:36:06,576 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-14 16:36:06,576 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-14 16:36:06,576 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-12-14 16:36:06,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:36:06,577 INFO L85 PathProgramCache]: Analyzing trace with hash -1655661633, now seen corresponding path program 1 times [2021-12-14 16:36:06,577 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:36:06,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187310816] [2021-12-14 16:36:06,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:36:06,577 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:36:06,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:36:06,786 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-14 16:36:06,787 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:36:06,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187310816] [2021-12-14 16:36:06,787 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187310816] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:36:06,787 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:36:06,787 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-14 16:36:06,788 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051053001] [2021-12-14 16:36:06,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:36:06,789 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-14 16:36:06,789 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:36:06,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-14 16:36:06,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2021-12-14 16:36:06,791 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 94 [2021-12-14 16:36:06,791 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 88 transitions, 184 flow. Second operand has 10 states, 10 states have (on average 73.3) internal successors, (733), 10 states have internal predecessors, (733), 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-14 16:36:06,792 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-14 16:36:06,792 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 94 [2021-12-14 16:36:06,792 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-14 16:36:07,142 INFO L129 PetriNetUnfolder]: 119/492 cut-off events. [2021-12-14 16:36:07,142 INFO L130 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2021-12-14 16:36:07,146 INFO L84 FinitePrefix]: Finished finitePrefix Result has 769 conditions, 492 events. 119/492 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2628 event pairs, 47 based on Foata normal form. 0/477 useless extension candidates. Maximal degree in co-relation 718. Up to 125 conditions per place. [2021-12-14 16:36:07,147 INFO L132 encePairwiseOnDemand]: 83/94 looper letters, 16 selfloop transitions, 8 changer transitions 48/133 dead transitions. [2021-12-14 16:36:07,147 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 133 transitions, 416 flow [2021-12-14 16:36:07,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-14 16:36:07,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2021-12-14 16:36:07,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1146 transitions. [2021-12-14 16:36:07,154 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8127659574468085 [2021-12-14 16:36:07,154 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1146 transitions. [2021-12-14 16:36:07,154 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1146 transitions. [2021-12-14 16:36:07,155 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 16:36:07,155 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1146 transitions. [2021-12-14 16:36:07,157 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 76.4) internal successors, (1146), 15 states have internal predecessors, (1146), 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-14 16:36:07,160 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 94.0) internal successors, (1504), 16 states have internal predecessors, (1504), 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-14 16:36:07,161 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 94.0) internal successors, (1504), 16 states have internal predecessors, (1504), 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-14 16:36:07,161 INFO L186 Difference]: Start difference. First operand has 95 places, 88 transitions, 184 flow. Second operand 15 states and 1146 transitions. [2021-12-14 16:36:07,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 133 transitions, 416 flow [2021-12-14 16:36:07,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 133 transitions, 398 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-12-14 16:36:07,164 INFO L242 Difference]: Finished difference. Result has 118 places, 82 transitions, 232 flow [2021-12-14 16:36:07,164 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=232, PETRI_PLACES=118, PETRI_TRANSITIONS=82} [2021-12-14 16:36:07,165 INFO L334 CegarLoopForPetriNet]: 97 programPoint places, 21 predicate places. [2021-12-14 16:36:07,165 INFO L470 AbstractCegarLoop]: Abstraction has has 118 places, 82 transitions, 232 flow [2021-12-14 16:36:07,165 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 73.3) internal successors, (733), 10 states have internal predecessors, (733), 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-14 16:36:07,165 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-14 16:36:07,166 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] [2021-12-14 16:36:07,166 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-14 16:36:07,166 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-12-14 16:36:07,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:36:07,166 INFO L85 PathProgramCache]: Analyzing trace with hash -1668964423, now seen corresponding path program 1 times [2021-12-14 16:36:07,167 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:36:07,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172318444] [2021-12-14 16:36:07,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:36:07,167 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:36:07,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:36:07,319 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-14 16:36:07,320 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:36:07,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172318444] [2021-12-14 16:36:07,320 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172318444] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:36:07,320 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:36:07,320 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-14 16:36:07,321 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400955316] [2021-12-14 16:36:07,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:36:07,321 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-14 16:36:07,321 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:36:07,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-14 16:36:07,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-12-14 16:36:07,323 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 94 [2021-12-14 16:36:07,323 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 82 transitions, 232 flow. Second operand has 9 states, 9 states have (on average 74.44444444444444) internal successors, (670), 9 states have internal predecessors, (670), 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-14 16:36:07,323 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-14 16:36:07,324 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 94 [2021-12-14 16:36:07,324 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-14 16:36:07,552 INFO L129 PetriNetUnfolder]: 82/284 cut-off events. [2021-12-14 16:36:07,552 INFO L130 PetriNetUnfolder]: For 518/518 co-relation queries the response was YES. [2021-12-14 16:36:07,553 INFO L84 FinitePrefix]: Finished finitePrefix Result has 798 conditions, 284 events. 82/284 cut-off events. For 518/518 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1068 event pairs, 13 based on Foata normal form. 6/283 useless extension candidates. Maximal degree in co-relation 733. Up to 88 conditions per place. [2021-12-14 16:36:07,554 INFO L132 encePairwiseOnDemand]: 84/94 looper letters, 23 selfloop transitions, 8 changer transitions 19/112 dead transitions. [2021-12-14 16:36:07,554 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 112 transitions, 500 flow [2021-12-14 16:36:07,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-14 16:36:07,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-12-14 16:36:07,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 852 transitions. [2021-12-14 16:36:07,556 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8239845261121856 [2021-12-14 16:36:07,556 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 852 transitions. [2021-12-14 16:36:07,557 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 852 transitions. [2021-12-14 16:36:07,557 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 16:36:07,557 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 852 transitions. [2021-12-14 16:36:07,559 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 77.45454545454545) internal successors, (852), 11 states have internal predecessors, (852), 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-14 16:36:07,560 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 94.0) internal successors, (1128), 12 states have internal predecessors, (1128), 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-14 16:36:07,560 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 94.0) internal successors, (1128), 12 states have internal predecessors, (1128), 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-14 16:36:07,561 INFO L186 Difference]: Start difference. First operand has 118 places, 82 transitions, 232 flow. Second operand 11 states and 852 transitions. [2021-12-14 16:36:07,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 112 transitions, 500 flow [2021-12-14 16:36:07,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 112 transitions, 476 flow, removed 10 selfloop flow, removed 5 redundant places. [2021-12-14 16:36:07,565 INFO L242 Difference]: Finished difference. Result has 111 places, 85 transitions, 274 flow [2021-12-14 16:36:07,565 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=274, PETRI_PLACES=111, PETRI_TRANSITIONS=85} [2021-12-14 16:36:07,566 INFO L334 CegarLoopForPetriNet]: 97 programPoint places, 14 predicate places. [2021-12-14 16:36:07,566 INFO L470 AbstractCegarLoop]: Abstraction has has 111 places, 85 transitions, 274 flow [2021-12-14 16:36:07,566 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 74.44444444444444) internal successors, (670), 9 states have internal predecessors, (670), 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-14 16:36:07,566 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-14 16:36:07,566 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] [2021-12-14 16:36:07,567 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-14 16:36:07,567 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-12-14 16:36:07,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:36:07,567 INFO L85 PathProgramCache]: Analyzing trace with hash 1940937855, now seen corresponding path program 2 times [2021-12-14 16:36:07,567 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:36:07,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905338611] [2021-12-14 16:36:07,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:36:07,568 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:36:07,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:36:07,766 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-14 16:36:07,766 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:36:07,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905338611] [2021-12-14 16:36:07,766 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905338611] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:36:07,767 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:36:07,767 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-12-14 16:36:07,767 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398537942] [2021-12-14 16:36:07,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:36:07,767 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-14 16:36:07,767 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:36:07,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-14 16:36:07,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2021-12-14 16:36:07,769 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 94 [2021-12-14 16:36:07,770 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 85 transitions, 274 flow. Second operand has 13 states, 13 states have (on average 68.3076923076923) internal successors, (888), 13 states have internal predecessors, (888), 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-14 16:36:07,770 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-14 16:36:07,770 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 94 [2021-12-14 16:36:07,770 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-14 16:36:08,319 INFO L129 PetriNetUnfolder]: 208/552 cut-off events. [2021-12-14 16:36:08,320 INFO L130 PetriNetUnfolder]: For 1410/1437 co-relation queries the response was YES. [2021-12-14 16:36:08,322 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1683 conditions, 552 events. 208/552 cut-off events. For 1410/1437 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2762 event pairs, 8 based on Foata normal form. 16/561 useless extension candidates. Maximal degree in co-relation 1610. Up to 148 conditions per place. [2021-12-14 16:36:08,324 INFO L132 encePairwiseOnDemand]: 80/94 looper letters, 40 selfloop transitions, 15 changer transitions 52/163 dead transitions. [2021-12-14 16:36:08,324 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 163 transitions, 972 flow [2021-12-14 16:36:08,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-12-14 16:36:08,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2021-12-14 16:36:08,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 1446 transitions. [2021-12-14 16:36:08,327 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7691489361702127 [2021-12-14 16:36:08,328 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 1446 transitions. [2021-12-14 16:36:08,328 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 1446 transitions. [2021-12-14 16:36:08,328 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 16:36:08,329 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 1446 transitions. [2021-12-14 16:36:08,331 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 72.3) internal successors, (1446), 20 states have internal predecessors, (1446), 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-14 16:36:08,333 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 94.0) internal successors, (1974), 21 states have internal predecessors, (1974), 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-14 16:36:08,334 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 94.0) internal successors, (1974), 21 states have internal predecessors, (1974), 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-14 16:36:08,334 INFO L186 Difference]: Start difference. First operand has 111 places, 85 transitions, 274 flow. Second operand 20 states and 1446 transitions. [2021-12-14 16:36:08,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 163 transitions, 972 flow [2021-12-14 16:36:08,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 163 transitions, 879 flow, removed 38 selfloop flow, removed 8 redundant places. [2021-12-14 16:36:08,339 INFO L242 Difference]: Finished difference. Result has 130 places, 91 transitions, 369 flow [2021-12-14 16:36:08,340 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=369, PETRI_PLACES=130, PETRI_TRANSITIONS=91} [2021-12-14 16:36:08,340 INFO L334 CegarLoopForPetriNet]: 97 programPoint places, 33 predicate places. [2021-12-14 16:36:08,340 INFO L470 AbstractCegarLoop]: Abstraction has has 130 places, 91 transitions, 369 flow [2021-12-14 16:36:08,341 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 68.3076923076923) internal successors, (888), 13 states have internal predecessors, (888), 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-14 16:36:08,341 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-14 16:36:08,341 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] [2021-12-14 16:36:08,341 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-14 16:36:08,342 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-12-14 16:36:08,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:36:08,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1408778179, now seen corresponding path program 1 times [2021-12-14 16:36:08,342 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:36:08,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401983848] [2021-12-14 16:36:08,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:36:08,343 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:36:08,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:36:08,521 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-14 16:36:08,521 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:36:08,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401983848] [2021-12-14 16:36:08,522 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401983848] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:36:08,522 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:36:08,522 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-14 16:36:08,522 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168833314] [2021-12-14 16:36:08,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:36:08,524 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-14 16:36:08,524 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:36:08,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-14 16:36:08,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-12-14 16:36:08,525 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 94 [2021-12-14 16:36:08,526 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 91 transitions, 369 flow. Second operand has 11 states, 11 states have (on average 72.45454545454545) internal successors, (797), 11 states have internal predecessors, (797), 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-14 16:36:08,526 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-14 16:36:08,526 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 94 [2021-12-14 16:36:08,526 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-14 16:36:08,746 INFO L129 PetriNetUnfolder]: 84/312 cut-off events. [2021-12-14 16:36:08,746 INFO L130 PetriNetUnfolder]: For 1906/1937 co-relation queries the response was YES. [2021-12-14 16:36:08,748 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1234 conditions, 312 events. 84/312 cut-off events. For 1906/1937 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1304 event pairs, 25 based on Foata normal form. 19/320 useless extension candidates. Maximal degree in co-relation 1149. Up to 114 conditions per place. [2021-12-14 16:36:08,749 INFO L132 encePairwiseOnDemand]: 83/94 looper letters, 24 selfloop transitions, 14 changer transitions 16/117 dead transitions. [2021-12-14 16:36:08,750 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 117 transitions, 751 flow [2021-12-14 16:36:08,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-14 16:36:08,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-12-14 16:36:08,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 968 transitions. [2021-12-14 16:36:08,752 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7921440261865794 [2021-12-14 16:36:08,752 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 968 transitions. [2021-12-14 16:36:08,752 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 968 transitions. [2021-12-14 16:36:08,753 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 16:36:08,753 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 968 transitions. [2021-12-14 16:36:08,754 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 74.46153846153847) internal successors, (968), 13 states have internal predecessors, (968), 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-14 16:36:08,756 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 94.0) internal successors, (1316), 14 states have internal predecessors, (1316), 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-14 16:36:08,756 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 94.0) internal successors, (1316), 14 states have internal predecessors, (1316), 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-14 16:36:08,756 INFO L186 Difference]: Start difference. First operand has 130 places, 91 transitions, 369 flow. Second operand 13 states and 968 transitions. [2021-12-14 16:36:08,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 117 transitions, 751 flow [2021-12-14 16:36:08,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 117 transitions, 697 flow, removed 24 selfloop flow, removed 9 redundant places. [2021-12-14 16:36:08,762 INFO L242 Difference]: Finished difference. Result has 128 places, 94 transitions, 424 flow [2021-12-14 16:36:08,762 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=343, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=424, PETRI_PLACES=128, PETRI_TRANSITIONS=94} [2021-12-14 16:36:08,763 INFO L334 CegarLoopForPetriNet]: 97 programPoint places, 31 predicate places. [2021-12-14 16:36:08,763 INFO L470 AbstractCegarLoop]: Abstraction has has 128 places, 94 transitions, 424 flow [2021-12-14 16:36:08,763 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 72.45454545454545) internal successors, (797), 11 states have internal predecessors, (797), 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-14 16:36:08,764 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-14 16:36:08,764 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] [2021-12-14 16:36:08,764 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-14 16:36:08,764 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-12-14 16:36:08,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:36:08,765 INFO L85 PathProgramCache]: Analyzing trace with hash 448543743, now seen corresponding path program 2 times [2021-12-14 16:36:08,771 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:36:08,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817229558] [2021-12-14 16:36:08,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:36:08,771 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:36:08,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:36:09,029 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-14 16:36:09,029 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:36:09,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817229558] [2021-12-14 16:36:09,029 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817229558] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:36:09,030 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:36:09,030 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-14 16:36:09,030 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398917956] [2021-12-14 16:36:09,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:36:09,030 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-14 16:36:09,030 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:36:09,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-14 16:36:09,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2021-12-14 16:36:09,032 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 94 [2021-12-14 16:36:09,032 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 94 transitions, 424 flow. Second operand has 11 states, 11 states have (on average 72.45454545454545) internal successors, (797), 11 states have internal predecessors, (797), 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-14 16:36:09,033 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-14 16:36:09,033 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 94 [2021-12-14 16:36:09,033 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-14 16:36:09,299 INFO L129 PetriNetUnfolder]: 74/295 cut-off events. [2021-12-14 16:36:09,299 INFO L130 PetriNetUnfolder]: For 1789/1848 co-relation queries the response was YES. [2021-12-14 16:36:09,300 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1178 conditions, 295 events. 74/295 cut-off events. For 1789/1848 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1189 event pairs, 24 based on Foata normal form. 25/310 useless extension candidates. Maximal degree in co-relation 1090. Up to 104 conditions per place. [2021-12-14 16:36:09,302 INFO L132 encePairwiseOnDemand]: 83/94 looper letters, 21 selfloop transitions, 13 changer transitions 16/113 dead transitions. [2021-12-14 16:36:09,302 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 113 transitions, 733 flow [2021-12-14 16:36:09,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-14 16:36:09,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-12-14 16:36:09,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 966 transitions. [2021-12-14 16:36:09,304 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.79050736497545 [2021-12-14 16:36:09,304 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 966 transitions. [2021-12-14 16:36:09,304 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 966 transitions. [2021-12-14 16:36:09,305 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 16:36:09,305 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 966 transitions. [2021-12-14 16:36:09,306 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 74.3076923076923) internal successors, (966), 13 states have internal predecessors, (966), 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-14 16:36:09,308 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 94.0) internal successors, (1316), 14 states have internal predecessors, (1316), 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-14 16:36:09,308 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 94.0) internal successors, (1316), 14 states have internal predecessors, (1316), 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-14 16:36:09,308 INFO L186 Difference]: Start difference. First operand has 128 places, 94 transitions, 424 flow. Second operand 13 states and 966 transitions. [2021-12-14 16:36:09,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 113 transitions, 733 flow [2021-12-14 16:36:09,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 113 transitions, 653 flow, removed 30 selfloop flow, removed 10 redundant places. [2021-12-14 16:36:09,314 INFO L242 Difference]: Finished difference. Result has 131 places, 94 transitions, 425 flow [2021-12-14 16:36:09,314 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=378, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=425, PETRI_PLACES=131, PETRI_TRANSITIONS=94} [2021-12-14 16:36:09,315 INFO L334 CegarLoopForPetriNet]: 97 programPoint places, 34 predicate places. [2021-12-14 16:36:09,315 INFO L470 AbstractCegarLoop]: Abstraction has has 131 places, 94 transitions, 425 flow [2021-12-14 16:36:09,316 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 72.45454545454545) internal successors, (797), 11 states have internal predecessors, (797), 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-14 16:36:09,316 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-14 16:36:09,316 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] [2021-12-14 16:36:09,316 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-14 16:36:09,316 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-12-14 16:36:09,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:36:09,317 INFO L85 PathProgramCache]: Analyzing trace with hash 2126481980, now seen corresponding path program 1 times [2021-12-14 16:36:09,317 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:36:09,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861330073] [2021-12-14 16:36:09,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:36:09,317 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:36:09,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:36:09,411 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-14 16:36:09,411 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:36:09,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861330073] [2021-12-14 16:36:09,411 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861330073] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:36:09,411 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:36:09,412 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 16:36:09,412 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382552659] [2021-12-14 16:36:09,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:36:09,415 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 16:36:09,415 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:36:09,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 16:36:09,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 16:36:09,416 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 94 [2021-12-14 16:36:09,416 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 94 transitions, 425 flow. Second operand has 6 states, 6 states have (on average 75.16666666666667) internal successors, (451), 6 states have internal predecessors, (451), 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-14 16:36:09,416 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-14 16:36:09,416 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 94 [2021-12-14 16:36:09,416 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-14 16:36:09,589 INFO L129 PetriNetUnfolder]: 153/432 cut-off events. [2021-12-14 16:36:09,589 INFO L130 PetriNetUnfolder]: For 1790/1802 co-relation queries the response was YES. [2021-12-14 16:36:09,590 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1540 conditions, 432 events. 153/432 cut-off events. For 1790/1802 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1870 event pairs, 8 based on Foata normal form. 12/435 useless extension candidates. Maximal degree in co-relation 1455. Up to 92 conditions per place. [2021-12-14 16:36:09,592 INFO L132 encePairwiseOnDemand]: 85/94 looper letters, 29 selfloop transitions, 7 changer transitions 43/142 dead transitions. [2021-12-14 16:36:09,592 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 142 transitions, 942 flow [2021-12-14 16:36:09,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-14 16:36:09,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-12-14 16:36:09,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 794 transitions. [2021-12-14 16:36:09,594 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8446808510638298 [2021-12-14 16:36:09,594 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 794 transitions. [2021-12-14 16:36:09,594 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 794 transitions. [2021-12-14 16:36:09,594 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 16:36:09,594 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 794 transitions. [2021-12-14 16:36:09,595 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 79.4) internal successors, (794), 10 states have internal predecessors, (794), 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-14 16:36:09,596 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 94.0) internal successors, (1034), 11 states have internal predecessors, (1034), 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-14 16:36:09,596 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 94.0) internal successors, (1034), 11 states have internal predecessors, (1034), 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-14 16:36:09,597 INFO L186 Difference]: Start difference. First operand has 131 places, 94 transitions, 425 flow. Second operand 10 states and 794 transitions. [2021-12-14 16:36:09,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 142 transitions, 942 flow [2021-12-14 16:36:09,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 142 transitions, 835 flow, removed 22 selfloop flow, removed 17 redundant places. [2021-12-14 16:36:09,601 INFO L242 Difference]: Finished difference. Result has 123 places, 91 transitions, 359 flow [2021-12-14 16:36:09,601 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=321, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=359, PETRI_PLACES=123, PETRI_TRANSITIONS=91} [2021-12-14 16:36:09,602 INFO L334 CegarLoopForPetriNet]: 97 programPoint places, 26 predicate places. [2021-12-14 16:36:09,602 INFO L470 AbstractCegarLoop]: Abstraction has has 123 places, 91 transitions, 359 flow [2021-12-14 16:36:09,602 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 75.16666666666667) internal successors, (451), 6 states have internal predecessors, (451), 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-14 16:36:09,602 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-14 16:36:09,602 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] [2021-12-14 16:36:09,603 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-14 16:36:09,603 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-12-14 16:36:09,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:36:09,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1407439487, now seen corresponding path program 1 times [2021-12-14 16:36:09,603 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:36:09,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405459538] [2021-12-14 16:36:09,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:36:09,604 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:36:09,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:36:09,691 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-14 16:36:09,692 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:36:09,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405459538] [2021-12-14 16:36:09,692 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405459538] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:36:09,692 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:36:09,692 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 16:36:09,692 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31471554] [2021-12-14 16:36:09,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:36:09,692 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 16:36:09,692 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:36:09,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 16:36:09,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-14 16:36:09,693 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 94 [2021-12-14 16:36:09,694 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 91 transitions, 359 flow. Second operand has 7 states, 7 states have (on average 75.0) internal successors, (525), 7 states have internal predecessors, (525), 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-14 16:36:09,694 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-14 16:36:09,694 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 94 [2021-12-14 16:36:09,694 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-14 16:36:09,819 INFO L129 PetriNetUnfolder]: 49/221 cut-off events. [2021-12-14 16:36:09,819 INFO L130 PetriNetUnfolder]: For 495/497 co-relation queries the response was YES. [2021-12-14 16:36:09,820 INFO L84 FinitePrefix]: Finished finitePrefix Result has 700 conditions, 221 events. 49/221 cut-off events. For 495/497 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 737 event pairs, 10 based on Foata normal form. 9/228 useless extension candidates. Maximal degree in co-relation 644. Up to 31 conditions per place. [2021-12-14 16:36:09,820 INFO L132 encePairwiseOnDemand]: 85/94 looper letters, 23 selfloop transitions, 10 changer transitions 15/111 dead transitions. [2021-12-14 16:36:09,820 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 111 transitions, 590 flow [2021-12-14 16:36:09,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-14 16:36:09,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-12-14 16:36:09,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 848 transitions. [2021-12-14 16:36:09,823 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8201160541586073 [2021-12-14 16:36:09,823 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 848 transitions. [2021-12-14 16:36:09,823 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 848 transitions. [2021-12-14 16:36:09,823 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 16:36:09,823 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 848 transitions. [2021-12-14 16:36:09,824 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 77.0909090909091) internal successors, (848), 11 states have internal predecessors, (848), 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-14 16:36:09,826 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 94.0) internal successors, (1128), 12 states have internal predecessors, (1128), 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-14 16:36:09,826 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 94.0) internal successors, (1128), 12 states have internal predecessors, (1128), 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-14 16:36:09,826 INFO L186 Difference]: Start difference. First operand has 123 places, 91 transitions, 359 flow. Second operand 11 states and 848 transitions. [2021-12-14 16:36:09,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 111 transitions, 590 flow [2021-12-14 16:36:09,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 111 transitions, 443 flow, removed 56 selfloop flow, removed 21 redundant places. [2021-12-14 16:36:09,829 INFO L242 Difference]: Finished difference. Result has 115 places, 92 transitions, 325 flow [2021-12-14 16:36:09,829 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=263, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=325, PETRI_PLACES=115, PETRI_TRANSITIONS=92} [2021-12-14 16:36:09,830 INFO L334 CegarLoopForPetriNet]: 97 programPoint places, 18 predicate places. [2021-12-14 16:36:09,830 INFO L470 AbstractCegarLoop]: Abstraction has has 115 places, 92 transitions, 325 flow [2021-12-14 16:36:09,830 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 75.0) internal successors, (525), 7 states have internal predecessors, (525), 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-14 16:36:09,830 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-14 16:36:09,830 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] [2021-12-14 16:36:09,830 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-14 16:36:09,830 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-12-14 16:36:09,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:36:09,831 INFO L85 PathProgramCache]: Analyzing trace with hash 600485396, now seen corresponding path program 1 times [2021-12-14 16:36:09,831 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:36:09,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124271432] [2021-12-14 16:36:09,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:36:09,831 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:36:09,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:36:09,966 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-14 16:36:09,967 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:36:09,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124271432] [2021-12-14 16:36:09,967 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124271432] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:36:09,967 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:36:09,967 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-12-14 16:36:09,967 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513320978] [2021-12-14 16:36:09,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:36:09,967 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-14 16:36:09,967 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:36:09,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-14 16:36:09,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2021-12-14 16:36:09,968 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 94 [2021-12-14 16:36:09,969 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 92 transitions, 325 flow. Second operand has 13 states, 13 states have (on average 69.61538461538461) internal successors, (905), 13 states have internal predecessors, (905), 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-14 16:36:09,969 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-14 16:36:09,969 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 94 [2021-12-14 16:36:09,969 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-14 16:36:10,201 INFO L129 PetriNetUnfolder]: 23/259 cut-off events. [2021-12-14 16:36:10,201 INFO L130 PetriNetUnfolder]: For 281/286 co-relation queries the response was YES. [2021-12-14 16:36:10,202 INFO L84 FinitePrefix]: Finished finitePrefix Result has 643 conditions, 259 events. 23/259 cut-off events. For 281/286 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1213 event pairs, 0 based on Foata normal form. 4/253 useless extension candidates. Maximal degree in co-relation 594. Up to 30 conditions per place. [2021-12-14 16:36:10,202 INFO L132 encePairwiseOnDemand]: 82/94 looper letters, 19 selfloop transitions, 5 changer transitions 25/112 dead transitions. [2021-12-14 16:36:10,202 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 112 transitions, 492 flow [2021-12-14 16:36:10,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-14 16:36:10,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2021-12-14 16:36:10,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 995 transitions. [2021-12-14 16:36:10,204 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.756079027355623 [2021-12-14 16:36:10,204 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 995 transitions. [2021-12-14 16:36:10,204 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 995 transitions. [2021-12-14 16:36:10,205 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 16:36:10,205 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 995 transitions. [2021-12-14 16:36:10,206 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 71.07142857142857) internal successors, (995), 14 states have internal predecessors, (995), 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-14 16:36:10,208 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 94.0) internal successors, (1410), 15 states have internal predecessors, (1410), 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-14 16:36:10,208 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 94.0) internal successors, (1410), 15 states have internal predecessors, (1410), 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-14 16:36:10,208 INFO L186 Difference]: Start difference. First operand has 115 places, 92 transitions, 325 flow. Second operand 14 states and 995 transitions. [2021-12-14 16:36:10,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 112 transitions, 492 flow [2021-12-14 16:36:10,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 112 transitions, 468 flow, removed 4 selfloop flow, removed 6 redundant places. [2021-12-14 16:36:10,211 INFO L242 Difference]: Finished difference. Result has 126 places, 86 transitions, 290 flow [2021-12-14 16:36:10,211 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=302, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=290, PETRI_PLACES=126, PETRI_TRANSITIONS=86} [2021-12-14 16:36:10,211 INFO L334 CegarLoopForPetriNet]: 97 programPoint places, 29 predicate places. [2021-12-14 16:36:10,211 INFO L470 AbstractCegarLoop]: Abstraction has has 126 places, 86 transitions, 290 flow [2021-12-14 16:36:10,212 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 69.61538461538461) internal successors, (905), 13 states have internal predecessors, (905), 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-14 16:36:10,212 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-14 16:36:10,212 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] [2021-12-14 16:36:10,212 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-14 16:36:10,212 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-12-14 16:36:10,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:36:10,212 INFO L85 PathProgramCache]: Analyzing trace with hash -571600922, now seen corresponding path program 2 times [2021-12-14 16:36:10,212 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:36:10,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581681028] [2021-12-14 16:36:10,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:36:10,213 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:36:10,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:36:10,376 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-14 16:36:10,377 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:36:10,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581681028] [2021-12-14 16:36:10,377 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581681028] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:36:10,377 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:36:10,377 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-12-14 16:36:10,378 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043400503] [2021-12-14 16:36:10,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:36:10,378 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-14 16:36:10,378 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:36:10,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-14 16:36:10,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-12-14 16:36:10,379 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 94 [2021-12-14 16:36:10,380 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 86 transitions, 290 flow. Second operand has 12 states, 12 states have (on average 70.66666666666667) internal successors, (848), 12 states have internal predecessors, (848), 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-14 16:36:10,380 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-14 16:36:10,380 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 94 [2021-12-14 16:36:10,380 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-14 16:36:10,533 INFO L129 PetriNetUnfolder]: 7/190 cut-off events. [2021-12-14 16:36:10,534 INFO L130 PetriNetUnfolder]: For 128/130 co-relation queries the response was YES. [2021-12-14 16:36:10,534 INFO L84 FinitePrefix]: Finished finitePrefix Result has 433 conditions, 190 events. 7/190 cut-off events. For 128/130 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 772 event pairs, 0 based on Foata normal form. 3/187 useless extension candidates. Maximal degree in co-relation 409. Up to 21 conditions per place. [2021-12-14 16:36:10,535 INFO L132 encePairwiseOnDemand]: 85/94 looper letters, 17 selfloop transitions, 4 changer transitions 8/93 dead transitions. [2021-12-14 16:36:10,535 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 93 transitions, 372 flow [2021-12-14 16:36:10,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-14 16:36:10,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-12-14 16:36:10,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 719 transitions. [2021-12-14 16:36:10,536 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7648936170212766 [2021-12-14 16:36:10,536 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 719 transitions. [2021-12-14 16:36:10,536 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 719 transitions. [2021-12-14 16:36:10,537 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 16:36:10,537 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 719 transitions. [2021-12-14 16:36:10,538 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 71.9) internal successors, (719), 10 states have internal predecessors, (719), 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-14 16:36:10,539 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 94.0) internal successors, (1034), 11 states have internal predecessors, (1034), 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-14 16:36:10,539 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 94.0) internal successors, (1034), 11 states have internal predecessors, (1034), 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-14 16:36:10,539 INFO L186 Difference]: Start difference. First operand has 126 places, 86 transitions, 290 flow. Second operand 10 states and 719 transitions. [2021-12-14 16:36:10,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 93 transitions, 372 flow [2021-12-14 16:36:10,541 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 93 transitions, 334 flow, removed 13 selfloop flow, removed 13 redundant places. [2021-12-14 16:36:10,542 INFO L242 Difference]: Finished difference. Result has 116 places, 84 transitions, 269 flow [2021-12-14 16:36:10,542 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=269, PETRI_PLACES=116, PETRI_TRANSITIONS=84} [2021-12-14 16:36:10,542 INFO L334 CegarLoopForPetriNet]: 97 programPoint places, 19 predicate places. [2021-12-14 16:36:10,542 INFO L470 AbstractCegarLoop]: Abstraction has has 116 places, 84 transitions, 269 flow [2021-12-14 16:36:10,543 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 70.66666666666667) internal successors, (848), 12 states have internal predecessors, (848), 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-14 16:36:10,543 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-14 16:36:10,543 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] [2021-12-14 16:36:10,559 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-14 16:36:10,559 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-12-14 16:36:10,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:36:10,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1820999590, now seen corresponding path program 3 times [2021-12-14 16:36:10,560 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:36:10,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586352393] [2021-12-14 16:36:10,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:36:10,560 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:36:10,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 16:36:10,598 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 16:36:10,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 16:36:10,687 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 16:36:10,687 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-14 16:36:10,688 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2021-12-14 16:36:10,689 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2021-12-14 16:36:10,690 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (2 of 5 remaining) [2021-12-14 16:36:10,690 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (1 of 5 remaining) [2021-12-14 16:36:10,690 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2021-12-14 16:36:10,690 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-14 16:36:10,692 INFO L732 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1] [2021-12-14 16:36:10,696 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-12-14 16:36:10,696 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-14 16:36:10,750 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 04:36:10 BasicIcfg [2021-12-14 16:36:10,751 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-14 16:36:10,751 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-14 16:36:10,751 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-14 16:36:10,751 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-14 16:36:10,752 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 04:36:06" (3/4) ... [2021-12-14 16:36:10,753 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-14 16:36:10,823 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-14 16:36:10,823 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-14 16:36:10,824 INFO L158 Benchmark]: Toolchain (without parser) took 6177.61ms. Allocated memory was 115.3MB in the beginning and 257.9MB in the end (delta: 142.6MB). Free memory was 87.4MB in the beginning and 211.3MB in the end (delta: -123.9MB). Peak memory consumption was 129.7MB. Max. memory is 16.1GB. [2021-12-14 16:36:10,824 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 115.3MB. Free memory is still 72.9MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-14 16:36:10,824 INFO L158 Benchmark]: CACSL2BoogieTranslator took 495.47ms. Allocated memory was 115.3MB in the beginning and 167.8MB in the end (delta: 52.4MB). Free memory was 87.4MB in the beginning and 131.1MB in the end (delta: -43.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-14 16:36:10,824 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.24ms. Allocated memory is still 167.8MB. Free memory was 131.1MB in the beginning and 128.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-14 16:36:10,824 INFO L158 Benchmark]: Boogie Preprocessor took 26.79ms. Allocated memory is still 167.8MB. Free memory was 128.5MB in the beginning and 126.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-14 16:36:10,825 INFO L158 Benchmark]: RCFGBuilder took 830.15ms. Allocated memory is still 167.8MB. Free memory was 126.4MB in the beginning and 63.0MB in the end (delta: 63.5MB). Peak memory consumption was 65.0MB. Max. memory is 16.1GB. [2021-12-14 16:36:10,825 INFO L158 Benchmark]: TraceAbstraction took 4683.90ms. Allocated memory was 167.8MB in the beginning and 213.9MB in the end (delta: 46.1MB). Free memory was 62.4MB in the beginning and 58.4MB in the end (delta: 4.0MB). Peak memory consumption was 51.3MB. Max. memory is 16.1GB. [2021-12-14 16:36:10,825 INFO L158 Benchmark]: Witness Printer took 71.98ms. Allocated memory was 213.9MB in the beginning and 257.9MB in the end (delta: 44.0MB). Free memory was 58.4MB in the beginning and 211.3MB in the end (delta: -152.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-14 16:36:10,826 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.19ms. Allocated memory is still 115.3MB. Free memory is still 72.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 495.47ms. Allocated memory was 115.3MB in the beginning and 167.8MB in the end (delta: 52.4MB). Free memory was 87.4MB in the beginning and 131.1MB in the end (delta: -43.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.24ms. Allocated memory is still 167.8MB. Free memory was 131.1MB in the beginning and 128.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 26.79ms. Allocated memory is still 167.8MB. Free memory was 128.5MB in the beginning and 126.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 830.15ms. Allocated memory is still 167.8MB. Free memory was 126.4MB in the beginning and 63.0MB in the end (delta: 63.5MB). Peak memory consumption was 65.0MB. Max. memory is 16.1GB. * TraceAbstraction took 4683.90ms. Allocated memory was 167.8MB in the beginning and 213.9MB in the end (delta: 46.1MB). Free memory was 62.4MB in the beginning and 58.4MB in the end (delta: 4.0MB). Peak memory consumption was 51.3MB. Max. memory is 16.1GB. * Witness Printer took 71.98ms. Allocated memory was 213.9MB in the beginning and 257.9MB in the end (delta: 44.0MB). Free memory was 58.4MB in the beginning and 211.3MB in the end (delta: -152.9MB). Peak memory consumption was 2.1MB. 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: [L708] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L710] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L711] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0] [L712] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L714] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L715] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L716] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L717] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L718] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L719] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L720] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L721] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L722] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L723] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L724] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L725] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L726] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L727] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L728] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L730] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L731] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L732] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L792] 0 pthread_t t1447; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1447={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L793] FCALL, FORK 0 pthread_create(&t1447, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1447, ((void *)0), P0, ((void *)0))=-1, t1447={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L794] 0 pthread_t t1448; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1447={5:0}, t1448={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L795] FCALL, FORK 0 pthread_create(&t1448, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1448, ((void *)0), P1, ((void *)0))=0, t1447={5:0}, t1448={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L756] 2 x$w_buff1 = x$w_buff0 [L757] 2 x$w_buff0 = 2 [L758] 2 x$w_buff1_used = x$w_buff0_used [L759] 2 x$w_buff0_used = (_Bool)1 [L760] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L760] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L761] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L762] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L763] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L764] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L767] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L736] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L739] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L742] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L742] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L742] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L742] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L743] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L743] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L744] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L744] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L745] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L745] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L746] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L746] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L770] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L770] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L771] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L771] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L772] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L772] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L773] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L773] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L774] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L774] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L749] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L797] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1447={5:0}, t1448={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L799] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L799] RET 0 assume_abort_if_not(main$tmp_guard0) [L801] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L801] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L801] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L801] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L802] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L802] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L803] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L803] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L804] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L804] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L805] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L805] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L808] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L809] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L810] 0 x$flush_delayed = weak$$choice2 [L811] 0 x$mem_tmp = x [L812] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L812] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L813] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L813] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L814] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L814] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L815] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L815] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L816] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L816] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L817] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L818] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L818] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L819] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0) [L820] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L820] 0 x = x$flush_delayed ? x$mem_tmp : x [L821] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1447={5:0}, t1448={3:0}, weak$$choice0=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L823] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=2, __unbuffered_p1_EAX=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=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=2, __unbuffered_p1_EAX=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=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] - 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: 795]: 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: 793]: 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 5 procedures, 112 locations, 5 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: 4.5s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 476 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 476 mSDsluCounter, 521 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 667 mSDsCounter, 159 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1276 IncrementalHoareTripleChecker+Invalid, 1435 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 159 mSolverCounterUnsat, 86 mSDtfsCounter, 1276 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 160 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 369 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=425occurred in iteration=6, InterpolantAutomatonStates: 120, 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.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 731 NumberOfCodeBlocks, 731 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 648 ConstructedInterpolants, 0 QuantifiedInterpolants, 4452 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-12-14 16:36:10,876 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