./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c3fed411 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/safe029_power.opt_pso.opt_rmo.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9df54eb091d78e0f82ec179542e5b1e4fed45243a056538ca557e474796bb018 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-17 22:22:46,907 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-17 22:22:46,909 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-17 22:22:46,938 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-17 22:22:46,940 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-17 22:22:46,947 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-17 22:22:46,948 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-17 22:22:46,950 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-17 22:22:46,952 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-17 22:22:46,956 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-17 22:22:46,956 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-17 22:22:46,958 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-17 22:22:46,958 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-17 22:22:46,960 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-17 22:22:46,961 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-17 22:22:46,963 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-17 22:22:46,964 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-17 22:22:46,964 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-17 22:22:46,976 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-17 22:22:46,977 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-17 22:22:46,978 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-17 22:22:46,978 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-17 22:22:46,979 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-17 22:22:46,980 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-17 22:22:46,981 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-17 22:22:46,981 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-17 22:22:46,981 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-17 22:22:46,982 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-17 22:22:46,982 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-17 22:22:46,983 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-17 22:22:46,983 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-17 22:22:46,983 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-17 22:22:46,984 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-17 22:22:46,984 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-17 22:22:46,985 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-17 22:22:46,985 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-17 22:22:46,986 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-17 22:22:46,986 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-17 22:22:46,986 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-17 22:22:46,987 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-17 22:22:46,987 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-17 22:22:46,990 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-17 22:22:47,015 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-17 22:22:47,016 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-17 22:22:47,016 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-17 22:22:47,016 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-17 22:22:47,017 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-17 22:22:47,017 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-17 22:22:47,018 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-17 22:22:47,018 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-17 22:22:47,018 INFO L138 SettingsManager]: * Use SBE=true [2021-12-17 22:22:47,018 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-17 22:22:47,019 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-17 22:22:47,019 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-17 22:22:47,019 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-17 22:22:47,019 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-17 22:22:47,019 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-17 22:22:47,019 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-17 22:22:47,020 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-17 22:22:47,020 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-17 22:22:47,020 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-17 22:22:47,020 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-17 22:22:47,020 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-17 22:22:47,020 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-17 22:22:47,020 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-17 22:22:47,021 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-17 22:22:47,021 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 22:22:47,021 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-17 22:22:47,021 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-17 22:22:47,021 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-17 22:22:47,021 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-17 22:22:47,021 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-17 22:22:47,022 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-17 22:22:47,022 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-17 22:22:47,022 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-17 22:22:47,022 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-17 22:22:47,022 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 -> 9df54eb091d78e0f82ec179542e5b1e4fed45243a056538ca557e474796bb018 [2021-12-17 22:22:47,249 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-17 22:22:47,270 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-17 22:22:47,272 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-17 22:22:47,272 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-17 22:22:47,273 INFO L275 PluginConnector]: CDTParser initialized [2021-12-17 22:22:47,274 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i [2021-12-17 22:22:47,325 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4329ecb70/1bc792b52b39408a9b760c3fc04894f4/FLAGfa65589c9 [2021-12-17 22:22:47,679 INFO L306 CDTParser]: Found 1 translation units. [2021-12-17 22:22:47,690 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i [2021-12-17 22:22:47,701 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4329ecb70/1bc792b52b39408a9b760c3fc04894f4/FLAGfa65589c9 [2021-12-17 22:22:48,084 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4329ecb70/1bc792b52b39408a9b760c3fc04894f4 [2021-12-17 22:22:48,086 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-17 22:22:48,087 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-17 22:22:48,092 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-17 22:22:48,092 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-17 22:22:48,094 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-17 22:22:48,095 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 10:22:48" (1/1) ... [2021-12-17 22:22:48,095 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2cf8829f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:22:48, skipping insertion in model container [2021-12-17 22:22:48,096 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 10:22:48" (1/1) ... [2021-12-17 22:22:48,100 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-17 22:22:48,142 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-17 22:22:48,252 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/safe029_power.opt_pso.opt_rmo.opt.i[967,980] [2021-12-17 22:22:48,392 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 22:22:48,401 INFO L203 MainTranslator]: Completed pre-run [2021-12-17 22:22:48,412 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/safe029_power.opt_pso.opt_rmo.opt.i[967,980] [2021-12-17 22:22:48,446 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 22:22:48,476 INFO L208 MainTranslator]: Completed translation [2021-12-17 22:22:48,476 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:22:48 WrapperNode [2021-12-17 22:22:48,477 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-17 22:22:48,478 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-17 22:22:48,478 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-17 22:22:48,478 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-17 22:22:48,483 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:22:48" (1/1) ... [2021-12-17 22:22:48,507 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:22:48" (1/1) ... [2021-12-17 22:22:48,537 INFO L137 Inliner]: procedures = 175, calls = 41, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 258 [2021-12-17 22:22:48,537 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-17 22:22:48,538 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-17 22:22:48,538 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-17 22:22:48,538 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-17 22:22:48,544 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:22:48" (1/1) ... [2021-12-17 22:22:48,544 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:22:48" (1/1) ... [2021-12-17 22:22:48,554 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:22:48" (1/1) ... [2021-12-17 22:22:48,559 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:22:48" (1/1) ... [2021-12-17 22:22:48,564 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:22:48" (1/1) ... [2021-12-17 22:22:48,566 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:22:48" (1/1) ... [2021-12-17 22:22:48,568 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:22:48" (1/1) ... [2021-12-17 22:22:48,570 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-17 22:22:48,571 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-17 22:22:48,571 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-17 22:22:48,571 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-17 22:22:48,575 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:22:48" (1/1) ... [2021-12-17 22:22:48,588 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 22:22:48,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 22:22:48,609 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-17 22:22:48,615 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-17 22:22:48,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-17 22:22:48,634 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-12-17 22:22:48,634 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-17 22:22:48,635 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-17 22:22:48,635 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-17 22:22:48,635 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-12-17 22:22:48,635 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-12-17 22:22:48,635 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-12-17 22:22:48,635 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-12-17 22:22:48,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-17 22:22:48,635 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-12-17 22:22:48,636 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-17 22:22:48,636 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-17 22:22:48,637 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-12-17 22:22:48,806 INFO L236 CfgBuilder]: Building ICFG [2021-12-17 22:22:48,808 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-17 22:22:49,117 INFO L277 CfgBuilder]: Performing block encoding [2021-12-17 22:22:49,349 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-17 22:22:49,349 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-12-17 22:22:49,351 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 10:22:49 BoogieIcfgContainer [2021-12-17 22:22:49,351 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-17 22:22:49,352 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-17 22:22:49,352 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-17 22:22:49,354 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-17 22:22:49,355 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.12 10:22:48" (1/3) ... [2021-12-17 22:22:49,355 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b73f107 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 10:22:49, skipping insertion in model container [2021-12-17 22:22:49,355 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:22:48" (2/3) ... [2021-12-17 22:22:49,356 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b73f107 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 10:22:49, skipping insertion in model container [2021-12-17 22:22:49,356 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 10:22:49" (3/3) ... [2021-12-17 22:22:49,357 INFO L111 eAbstractionObserver]: Analyzing ICFG safe029_power.opt_pso.opt_rmo.opt.i [2021-12-17 22:22:49,361 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-12-17 22:22:49,361 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-17 22:22:49,361 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-12-17 22:22:49,361 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-12-17 22:22:49,383 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:22:49,383 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:22:49,383 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:22:49,383 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:22:49,383 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:22:49,384 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:22:49,384 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:22:49,384 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:22:49,384 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:22:49,384 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:22:49,384 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:22:49,384 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:22:49,385 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:22:49,385 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:22:49,385 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:22:49,385 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:22:49,385 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:22:49,385 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:22:49,386 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:22:49,386 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:22:49,386 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:22:49,386 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:22:49,387 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:22:49,387 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:22:49,387 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:22:49,388 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:22:49,388 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:22:49,388 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:22:49,388 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:22:49,388 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:22:49,389 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:22:49,389 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:22:49,389 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:22:49,389 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:22:49,389 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:22:49,389 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:22:49,389 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:22:49,390 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:22:49,390 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:22:49,390 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:22:49,390 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:22:49,390 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:22:49,390 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:22:49,391 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:22:49,391 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:22:49,391 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:22:49,391 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:22:49,391 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:22:49,391 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:22:49,392 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:22:49,392 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:22:49,392 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:22:49,392 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:22:49,392 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:22:49,392 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:22:49,393 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:22:49,393 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:22:49,393 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:22:49,393 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:22:49,393 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:22:49,397 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:22:49,397 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:22:49,398 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:22:49,398 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:22:49,398 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:22:49,398 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:22:49,399 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:22:49,399 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:22:49,399 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:22:49,399 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:22:49,399 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:22:49,400 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:22:49,400 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:22:49,400 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:22:49,400 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:22:49,401 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:22:49,401 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:22:49,401 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:22:49,401 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:22:49,401 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:22:49,402 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:22:49,403 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:22:49,405 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-12-17 22:22:49,436 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-17 22:22:49,440 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-17 22:22:49,440 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-12-17 22:22:49,450 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 98 places, 93 transitions, 196 flow [2021-12-17 22:22:49,484 INFO L129 PetriNetUnfolder]: 2/91 cut-off events. [2021-12-17 22:22:49,486 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-12-17 22:22:49,488 INFO L84 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 91 events. 2/91 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/87 useless extension candidates. Maximal degree in co-relation 55. Up to 2 conditions per place. [2021-12-17 22:22:49,488 INFO L82 GeneralOperation]: Start removeDead. Operand has 98 places, 93 transitions, 196 flow [2021-12-17 22:22:49,496 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 96 places, 91 transitions, 188 flow [2021-12-17 22:22:49,516 INFO L129 PetriNetUnfolder]: 0/55 cut-off events. [2021-12-17 22:22:49,516 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-12-17 22:22:49,517 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:22:49,517 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] [2021-12-17 22:22:49,518 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-12-17 22:22:49,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:22:49,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1568406000, now seen corresponding path program 1 times [2021-12-17 22:22:49,529 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 22:22:49,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814920023] [2021-12-17 22:22:49,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:22:49,531 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 22:22:49,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:22:49,753 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-17 22:22:49,753 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 22:22:49,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814920023] [2021-12-17 22:22:49,754 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814920023] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 22:22:49,754 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 22:22:49,754 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-17 22:22:49,756 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936333496] [2021-12-17 22:22:49,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 22:22:49,763 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 22:22:49,763 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 22:22:49,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 22:22:49,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-17 22:22:49,789 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 93 [2021-12-17 22:22:49,793 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 91 transitions, 188 flow. Second operand has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 3 states have internal predecessors, (247), 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-17 22:22:49,794 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:22:49,794 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 93 [2021-12-17 22:22:49,795 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:22:49,899 INFO L129 PetriNetUnfolder]: 17/213 cut-off events. [2021-12-17 22:22:49,899 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-12-17 22:22:49,901 INFO L84 FinitePrefix]: Finished finitePrefix Result has 261 conditions, 213 events. 17/213 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 691 event pairs, 7 based on Foata normal form. 8/209 useless extension candidates. Maximal degree in co-relation 215. Up to 27 conditions per place. [2021-12-17 22:22:49,903 INFO L132 encePairwiseOnDemand]: 88/93 looper letters, 9 selfloop transitions, 2 changer transitions 0/90 dead transitions. [2021-12-17 22:22:49,903 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 90 transitions, 208 flow [2021-12-17 22:22:49,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 22:22:49,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-12-17 22:22:49,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 259 transitions. [2021-12-17 22:22:49,918 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9283154121863799 [2021-12-17 22:22:49,919 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 259 transitions. [2021-12-17 22:22:49,919 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 259 transitions. [2021-12-17 22:22:49,922 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 22:22:49,924 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 259 transitions. [2021-12-17 22:22:49,928 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 86.33333333333333) internal successors, (259), 3 states have internal predecessors, (259), 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-17 22:22:49,938 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 93.0) internal successors, (372), 4 states have internal predecessors, (372), 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-17 22:22:49,939 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 93.0) internal successors, (372), 4 states have internal predecessors, (372), 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-17 22:22:49,940 INFO L186 Difference]: Start difference. First operand has 96 places, 91 transitions, 188 flow. Second operand 3 states and 259 transitions. [2021-12-17 22:22:49,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 90 transitions, 208 flow [2021-12-17 22:22:49,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 90 transitions, 206 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-12-17 22:22:49,947 INFO L242 Difference]: Finished difference. Result has 94 places, 87 transitions, 182 flow [2021-12-17 22:22:49,948 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=182, PETRI_PLACES=94, PETRI_TRANSITIONS=87} [2021-12-17 22:22:49,952 INFO L334 CegarLoopForPetriNet]: 96 programPoint places, -2 predicate places. [2021-12-17 22:22:49,952 INFO L470 AbstractCegarLoop]: Abstraction has has 94 places, 87 transitions, 182 flow [2021-12-17 22:22:49,953 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 3 states have internal predecessors, (247), 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-17 22:22:49,953 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:22:49,953 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 22:22:49,954 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-17 22:22:49,954 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-17 22:22:49,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:22:49,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1291529996, now seen corresponding path program 1 times [2021-12-17 22:22:49,955 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 22:22:49,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14364711] [2021-12-17 22:22:49,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:22:49,956 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 22:22:50,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:22:50,141 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-17 22:22:50,142 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 22:22:50,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14364711] [2021-12-17 22:22:50,142 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14364711] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 22:22:50,142 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 22:22:50,142 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-17 22:22:50,142 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911760339] [2021-12-17 22:22:50,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 22:22:50,143 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-17 22:22:50,143 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 22:22:50,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-17 22:22:50,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-17 22:22:50,145 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 93 [2021-12-17 22:22:50,145 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 87 transitions, 182 flow. Second operand has 6 states, 6 states have (on average 74.66666666666667) internal successors, (448), 6 states have internal predecessors, (448), 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-17 22:22:50,145 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:22:50,145 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 93 [2021-12-17 22:22:50,146 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:22:50,394 INFO L129 PetriNetUnfolder]: 178/649 cut-off events. [2021-12-17 22:22:50,394 INFO L130 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2021-12-17 22:22:50,397 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1021 conditions, 649 events. 178/649 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3793 event pairs, 61 based on Foata normal form. 0/627 useless extension candidates. Maximal degree in co-relation 974. Up to 186 conditions per place. [2021-12-17 22:22:50,399 INFO L132 encePairwiseOnDemand]: 86/93 looper letters, 17 selfloop transitions, 3 changer transitions 43/125 dead transitions. [2021-12-17 22:22:50,399 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 125 transitions, 382 flow [2021-12-17 22:22:50,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-17 22:22:50,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-17 22:22:50,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 713 transitions. [2021-12-17 22:22:50,402 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8518518518518519 [2021-12-17 22:22:50,402 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 713 transitions. [2021-12-17 22:22:50,402 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 713 transitions. [2021-12-17 22:22:50,402 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 22:22:50,402 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 713 transitions. [2021-12-17 22:22:50,404 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 79.22222222222223) internal successors, (713), 9 states have internal predecessors, (713), 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-17 22:22:50,407 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 93.0) internal successors, (930), 10 states have internal predecessors, (930), 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-17 22:22:50,407 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 93.0) internal successors, (930), 10 states have internal predecessors, (930), 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-17 22:22:50,407 INFO L186 Difference]: Start difference. First operand has 94 places, 87 transitions, 182 flow. Second operand 9 states and 713 transitions. [2021-12-17 22:22:50,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 125 transitions, 382 flow [2021-12-17 22:22:50,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 125 transitions, 364 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-12-17 22:22:50,410 INFO L242 Difference]: Finished difference. Result has 107 places, 79 transitions, 201 flow [2021-12-17 22:22:50,411 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=201, PETRI_PLACES=107, PETRI_TRANSITIONS=79} [2021-12-17 22:22:50,411 INFO L334 CegarLoopForPetriNet]: 96 programPoint places, 11 predicate places. [2021-12-17 22:22:50,411 INFO L470 AbstractCegarLoop]: Abstraction has has 107 places, 79 transitions, 201 flow [2021-12-17 22:22:50,412 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 74.66666666666667) internal successors, (448), 6 states have internal predecessors, (448), 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-17 22:22:50,412 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:22:50,412 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] [2021-12-17 22:22:50,412 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-17 22:22:50,413 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-17 22:22:50,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:22:50,413 INFO L85 PathProgramCache]: Analyzing trace with hash -2040361013, now seen corresponding path program 1 times [2021-12-17 22:22:50,413 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 22:22:50,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948577478] [2021-12-17 22:22:50,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:22:50,414 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 22:22:50,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:22:50,634 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-17 22:22:50,637 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 22:22:50,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948577478] [2021-12-17 22:22:50,638 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948577478] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 22:22:50,638 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 22:22:50,638 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-17 22:22:50,638 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709841042] [2021-12-17 22:22:50,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 22:22:50,640 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-17 22:22:50,640 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 22:22:50,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-17 22:22:50,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-12-17 22:22:50,642 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 93 [2021-12-17 22:22:50,643 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 79 transitions, 201 flow. Second operand has 9 states, 9 states have (on average 73.33333333333333) internal successors, (660), 9 states have internal predecessors, (660), 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-17 22:22:50,643 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:22:50,643 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 93 [2021-12-17 22:22:50,644 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:22:50,898 INFO L129 PetriNetUnfolder]: 159/434 cut-off events. [2021-12-17 22:22:50,898 INFO L130 PetriNetUnfolder]: For 360/360 co-relation queries the response was YES. [2021-12-17 22:22:50,900 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1014 conditions, 434 events. 159/434 cut-off events. For 360/360 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1923 event pairs, 63 based on Foata normal form. 12/428 useless extension candidates. Maximal degree in co-relation 958. Up to 170 conditions per place. [2021-12-17 22:22:50,901 INFO L132 encePairwiseOnDemand]: 82/93 looper letters, 15 selfloop transitions, 9 changer transitions 34/121 dead transitions. [2021-12-17 22:22:50,901 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 121 transitions, 431 flow [2021-12-17 22:22:50,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-17 22:22:50,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2021-12-17 22:22:50,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1069 transitions. [2021-12-17 22:22:50,904 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8210445468509985 [2021-12-17 22:22:50,904 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1069 transitions. [2021-12-17 22:22:50,904 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1069 transitions. [2021-12-17 22:22:50,904 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 22:22:50,904 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1069 transitions. [2021-12-17 22:22:50,906 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 76.35714285714286) internal successors, (1069), 14 states have internal predecessors, (1069), 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-17 22:22:50,908 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 93.0) internal successors, (1395), 15 states have internal predecessors, (1395), 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-17 22:22:50,909 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 93.0) internal successors, (1395), 15 states have internal predecessors, (1395), 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-17 22:22:50,910 INFO L186 Difference]: Start difference. First operand has 107 places, 79 transitions, 201 flow. Second operand 14 states and 1069 transitions. [2021-12-17 22:22:50,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 121 transitions, 431 flow [2021-12-17 22:22:50,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 121 transitions, 410 flow, removed 9 selfloop flow, removed 4 redundant places. [2021-12-17 22:22:50,918 INFO L242 Difference]: Finished difference. Result has 111 places, 85 transitions, 276 flow [2021-12-17 22:22:50,918 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=276, PETRI_PLACES=111, PETRI_TRANSITIONS=85} [2021-12-17 22:22:50,920 INFO L334 CegarLoopForPetriNet]: 96 programPoint places, 15 predicate places. [2021-12-17 22:22:50,920 INFO L470 AbstractCegarLoop]: Abstraction has has 111 places, 85 transitions, 276 flow [2021-12-17 22:22:50,920 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 73.33333333333333) internal successors, (660), 9 states have internal predecessors, (660), 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-17 22:22:50,920 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:22:50,921 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] [2021-12-17 22:22:50,921 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-17 22:22:50,921 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-17 22:22:50,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:22:50,930 INFO L85 PathProgramCache]: Analyzing trace with hash 516845962, now seen corresponding path program 1 times [2021-12-17 22:22:50,930 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 22:22:50,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624650415] [2021-12-17 22:22:50,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:22:50,931 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 22:22:50,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:22:51,179 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-17 22:22:51,180 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 22:22:51,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624650415] [2021-12-17 22:22:51,180 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624650415] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 22:22:51,180 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 22:22:51,180 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-17 22:22:51,181 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350110327] [2021-12-17 22:22:51,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 22:22:51,181 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-17 22:22:51,182 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 22:22:51,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-17 22:22:51,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-12-17 22:22:51,185 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 93 [2021-12-17 22:22:51,186 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 85 transitions, 276 flow. Second operand has 9 states, 9 states have (on average 73.44444444444444) internal successors, (661), 9 states have internal predecessors, (661), 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-17 22:22:51,186 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:22:51,186 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 93 [2021-12-17 22:22:51,186 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:22:51,557 INFO L129 PetriNetUnfolder]: 128/378 cut-off events. [2021-12-17 22:22:51,557 INFO L130 PetriNetUnfolder]: For 1139/1189 co-relation queries the response was YES. [2021-12-17 22:22:51,559 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1278 conditions, 378 events. 128/378 cut-off events. For 1139/1189 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1620 event pairs, 29 based on Foata normal form. 10/373 useless extension candidates. Maximal degree in co-relation 1210. Up to 141 conditions per place. [2021-12-17 22:22:51,561 INFO L132 encePairwiseOnDemand]: 84/93 looper letters, 25 selfloop transitions, 7 changer transitions 25/120 dead transitions. [2021-12-17 22:22:51,562 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 120 transitions, 630 flow [2021-12-17 22:22:51,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-17 22:22:51,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2021-12-17 22:22:51,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1063 transitions. [2021-12-17 22:22:51,565 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8164362519201229 [2021-12-17 22:22:51,565 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1063 transitions. [2021-12-17 22:22:51,565 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1063 transitions. [2021-12-17 22:22:51,566 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 22:22:51,566 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1063 transitions. [2021-12-17 22:22:51,568 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 75.92857142857143) internal successors, (1063), 14 states have internal predecessors, (1063), 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-17 22:22:51,570 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 93.0) internal successors, (1395), 15 states have internal predecessors, (1395), 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-17 22:22:51,571 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 93.0) internal successors, (1395), 15 states have internal predecessors, (1395), 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-17 22:22:51,571 INFO L186 Difference]: Start difference. First operand has 111 places, 85 transitions, 276 flow. Second operand 14 states and 1063 transitions. [2021-12-17 22:22:51,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 120 transitions, 630 flow [2021-12-17 22:22:51,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 120 transitions, 604 flow, removed 12 selfloop flow, removed 4 redundant places. [2021-12-17 22:22:51,577 INFO L242 Difference]: Finished difference. Result has 121 places, 87 transitions, 325 flow [2021-12-17 22:22:51,577 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=325, PETRI_PLACES=121, PETRI_TRANSITIONS=87} [2021-12-17 22:22:51,578 INFO L334 CegarLoopForPetriNet]: 96 programPoint places, 25 predicate places. [2021-12-17 22:22:51,578 INFO L470 AbstractCegarLoop]: Abstraction has has 121 places, 87 transitions, 325 flow [2021-12-17 22:22:51,579 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 73.44444444444444) internal successors, (661), 9 states have internal predecessors, (661), 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-17 22:22:51,579 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:22:51,579 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] [2021-12-17 22:22:51,579 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-17 22:22:51,579 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-17 22:22:51,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:22:51,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1667123167, now seen corresponding path program 1 times [2021-12-17 22:22:51,580 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 22:22:51,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333020259] [2021-12-17 22:22:51,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:22:51,581 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 22:22:51,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:22:51,660 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-17 22:22:51,660 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 22:22:51,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333020259] [2021-12-17 22:22:51,661 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333020259] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 22:22:51,661 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 22:22:51,661 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-17 22:22:51,661 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461823501] [2021-12-17 22:22:51,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 22:22:51,662 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-17 22:22:51,662 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 22:22:51,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-17 22:22:51,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-17 22:22:51,663 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 93 [2021-12-17 22:22:51,664 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 87 transitions, 325 flow. Second operand has 6 states, 6 states have (on average 75.0) internal successors, (450), 6 states have internal predecessors, (450), 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-17 22:22:51,664 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:22:51,664 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 93 [2021-12-17 22:22:51,664 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:22:51,896 INFO L129 PetriNetUnfolder]: 164/525 cut-off events. [2021-12-17 22:22:51,896 INFO L130 PetriNetUnfolder]: For 2786/2907 co-relation queries the response was YES. [2021-12-17 22:22:51,900 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2171 conditions, 525 events. 164/525 cut-off events. For 2786/2907 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2780 event pairs, 32 based on Foata normal form. 12/517 useless extension candidates. Maximal degree in co-relation 2096. Up to 145 conditions per place. [2021-12-17 22:22:51,903 INFO L132 encePairwiseOnDemand]: 87/93 looper letters, 29 selfloop transitions, 3 changer transitions 23/119 dead transitions. [2021-12-17 22:22:51,903 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 119 transitions, 740 flow [2021-12-17 22:22:51,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-17 22:22:51,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-17 22:22:51,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 704 transitions. [2021-12-17 22:22:51,906 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8410991636798089 [2021-12-17 22:22:51,906 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 704 transitions. [2021-12-17 22:22:51,906 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 704 transitions. [2021-12-17 22:22:51,907 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 22:22:51,907 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 704 transitions. [2021-12-17 22:22:51,910 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 78.22222222222223) internal successors, (704), 9 states have internal predecessors, (704), 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-17 22:22:51,911 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 93.0) internal successors, (930), 10 states have internal predecessors, (930), 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-17 22:22:51,912 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 93.0) internal successors, (930), 10 states have internal predecessors, (930), 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-17 22:22:51,912 INFO L186 Difference]: Start difference. First operand has 121 places, 87 transitions, 325 flow. Second operand 9 states and 704 transitions. [2021-12-17 22:22:51,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 119 transitions, 740 flow [2021-12-17 22:22:51,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 119 transitions, 678 flow, removed 28 selfloop flow, removed 8 redundant places. [2021-12-17 22:22:51,921 INFO L242 Difference]: Finished difference. Result has 119 places, 87 transitions, 322 flow [2021-12-17 22:22:51,921 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=297, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=322, PETRI_PLACES=119, PETRI_TRANSITIONS=87} [2021-12-17 22:22:51,924 INFO L334 CegarLoopForPetriNet]: 96 programPoint places, 23 predicate places. [2021-12-17 22:22:51,924 INFO L470 AbstractCegarLoop]: Abstraction has has 119 places, 87 transitions, 322 flow [2021-12-17 22:22:51,924 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 75.0) internal successors, (450), 6 states have internal predecessors, (450), 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-17 22:22:51,925 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:22:51,925 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-17 22:22:51,925 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-17 22:22:51,925 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-17 22:22:51,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:22:51,926 INFO L85 PathProgramCache]: Analyzing trace with hash -71306102, now seen corresponding path program 1 times [2021-12-17 22:22:51,926 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 22:22:51,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130509443] [2021-12-17 22:22:51,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:22:51,927 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 22:22:51,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:22:52,184 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-17 22:22:52,184 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 22:22:52,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130509443] [2021-12-17 22:22:52,185 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130509443] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 22:22:52,185 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 22:22:52,185 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-12-17 22:22:52,185 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126876723] [2021-12-17 22:22:52,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 22:22:52,186 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-17 22:22:52,186 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 22:22:52,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-17 22:22:52,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2021-12-17 22:22:52,187 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 93 [2021-12-17 22:22:52,188 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 87 transitions, 322 flow. Second operand has 12 states, 12 states have (on average 71.33333333333333) internal successors, (856), 12 states have internal predecessors, (856), 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-17 22:22:52,188 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:22:52,188 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 93 [2021-12-17 22:22:52,188 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:22:52,488 INFO L129 PetriNetUnfolder]: 118/401 cut-off events. [2021-12-17 22:22:52,489 INFO L130 PetriNetUnfolder]: For 2062/2186 co-relation queries the response was YES. [2021-12-17 22:22:52,492 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1561 conditions, 401 events. 118/401 cut-off events. For 2062/2186 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1879 event pairs, 45 based on Foata normal form. 6/386 useless extension candidates. Maximal degree in co-relation 1482. Up to 190 conditions per place. [2021-12-17 22:22:52,494 INFO L132 encePairwiseOnDemand]: 83/93 looper letters, 21 selfloop transitions, 8 changer transitions 13/103 dead transitions. [2021-12-17 22:22:52,494 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 103 transitions, 553 flow [2021-12-17 22:22:52,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-17 22:22:52,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-12-17 22:22:52,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 949 transitions. [2021-12-17 22:22:52,496 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7849462365591398 [2021-12-17 22:22:52,497 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 949 transitions. [2021-12-17 22:22:52,497 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 949 transitions. [2021-12-17 22:22:52,497 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 22:22:52,497 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 949 transitions. [2021-12-17 22:22:52,500 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 73.0) internal successors, (949), 13 states have internal predecessors, (949), 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-17 22:22:52,501 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 93.0) internal successors, (1302), 14 states have internal predecessors, (1302), 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-17 22:22:52,502 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 93.0) internal successors, (1302), 14 states have internal predecessors, (1302), 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-17 22:22:52,502 INFO L186 Difference]: Start difference. First operand has 119 places, 87 transitions, 322 flow. Second operand 13 states and 949 transitions. [2021-12-17 22:22:52,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 103 transitions, 553 flow [2021-12-17 22:22:52,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 103 transitions, 508 flow, removed 21 selfloop flow, removed 7 redundant places. [2021-12-17 22:22:52,507 INFO L242 Difference]: Finished difference. Result has 125 places, 87 transitions, 332 flow [2021-12-17 22:22:52,507 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=299, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=332, PETRI_PLACES=125, PETRI_TRANSITIONS=87} [2021-12-17 22:22:52,509 INFO L334 CegarLoopForPetriNet]: 96 programPoint places, 29 predicate places. [2021-12-17 22:22:52,509 INFO L470 AbstractCegarLoop]: Abstraction has has 125 places, 87 transitions, 332 flow [2021-12-17 22:22:52,509 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 71.33333333333333) internal successors, (856), 12 states have internal predecessors, (856), 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-17 22:22:52,509 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:22:52,509 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-17 22:22:52,510 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-17 22:22:52,510 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-17 22:22:52,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:22:52,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1808634961, now seen corresponding path program 1 times [2021-12-17 22:22:52,511 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 22:22:52,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309111336] [2021-12-17 22:22:52,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:22:52,511 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 22:22:52,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:22:52,676 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-17 22:22:52,677 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 22:22:52,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309111336] [2021-12-17 22:22:52,677 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309111336] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 22:22:52,677 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 22:22:52,677 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-17 22:22:52,677 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707588351] [2021-12-17 22:22:52,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 22:22:52,681 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-17 22:22:52,681 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 22:22:52,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-17 22:22:52,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2021-12-17 22:22:52,683 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 93 [2021-12-17 22:22:52,683 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 87 transitions, 332 flow. Second operand has 11 states, 11 states have (on average 70.45454545454545) internal successors, (775), 11 states have internal predecessors, (775), 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-17 22:22:52,683 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:22:52,684 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 93 [2021-12-17 22:22:52,684 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:22:53,013 INFO L129 PetriNetUnfolder]: 166/509 cut-off events. [2021-12-17 22:22:53,014 INFO L130 PetriNetUnfolder]: For 2919/3046 co-relation queries the response was YES. [2021-12-17 22:22:53,015 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2106 conditions, 509 events. 166/509 cut-off events. For 2919/3046 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2671 event pairs, 41 based on Foata normal form. 21/501 useless extension candidates. Maximal degree in co-relation 2021. Up to 199 conditions per place. [2021-12-17 22:22:53,017 INFO L132 encePairwiseOnDemand]: 80/93 looper letters, 25 selfloop transitions, 13 changer transitions 32/130 dead transitions. [2021-12-17 22:22:53,017 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 130 transitions, 840 flow [2021-12-17 22:22:53,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-17 22:22:53,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2021-12-17 22:22:53,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1237 transitions. [2021-12-17 22:22:53,020 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.782416192283365 [2021-12-17 22:22:53,020 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1237 transitions. [2021-12-17 22:22:53,020 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1237 transitions. [2021-12-17 22:22:53,021 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 22:22:53,021 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1237 transitions. [2021-12-17 22:22:53,023 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 72.76470588235294) internal successors, (1237), 17 states have internal predecessors, (1237), 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-17 22:22:53,025 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 93.0) internal successors, (1674), 18 states have internal predecessors, (1674), 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-17 22:22:53,025 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 93.0) internal successors, (1674), 18 states have internal predecessors, (1674), 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-17 22:22:53,025 INFO L186 Difference]: Start difference. First operand has 125 places, 87 transitions, 332 flow. Second operand 17 states and 1237 transitions. [2021-12-17 22:22:53,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 130 transitions, 840 flow [2021-12-17 22:22:53,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 130 transitions, 764 flow, removed 30 selfloop flow, removed 14 redundant places. [2021-12-17 22:22:53,031 INFO L242 Difference]: Finished difference. Result has 133 places, 96 transitions, 449 flow [2021-12-17 22:22:53,031 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=295, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=449, PETRI_PLACES=133, PETRI_TRANSITIONS=96} [2021-12-17 22:22:53,032 INFO L334 CegarLoopForPetriNet]: 96 programPoint places, 37 predicate places. [2021-12-17 22:22:53,032 INFO L470 AbstractCegarLoop]: Abstraction has has 133 places, 96 transitions, 449 flow [2021-12-17 22:22:53,032 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 70.45454545454545) internal successors, (775), 11 states have internal predecessors, (775), 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-17 22:22:53,032 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:22:53,032 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-17 22:22:53,033 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-17 22:22:53,033 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-17 22:22:53,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:22:53,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1207883511, now seen corresponding path program 2 times [2021-12-17 22:22:53,033 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 22:22:53,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584141718] [2021-12-17 22:22:53,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:22:53,034 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 22:22:53,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:22:53,196 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-17 22:22:53,197 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 22:22:53,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584141718] [2021-12-17 22:22:53,197 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584141718] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 22:22:53,197 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 22:22:53,197 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-17 22:22:53,197 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606608411] [2021-12-17 22:22:53,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 22:22:53,198 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-17 22:22:53,198 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 22:22:53,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-17 22:22:53,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-12-17 22:22:53,199 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 93 [2021-12-17 22:22:53,200 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 96 transitions, 449 flow. Second operand has 9 states, 9 states have (on average 73.44444444444444) internal successors, (661), 9 states have internal predecessors, (661), 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-17 22:22:53,200 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:22:53,200 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 93 [2021-12-17 22:22:53,200 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:22:53,389 INFO L129 PetriNetUnfolder]: 136/446 cut-off events. [2021-12-17 22:22:53,389 INFO L130 PetriNetUnfolder]: For 3991/4245 co-relation queries the response was YES. [2021-12-17 22:22:53,391 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2209 conditions, 446 events. 136/446 cut-off events. For 3991/4245 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2222 event pairs, 35 based on Foata normal form. 24/444 useless extension candidates. Maximal degree in co-relation 2124. Up to 160 conditions per place. [2021-12-17 22:22:53,392 INFO L132 encePairwiseOnDemand]: 84/93 looper letters, 22 selfloop transitions, 11 changer transitions 22/118 dead transitions. [2021-12-17 22:22:53,392 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 118 transitions, 821 flow [2021-12-17 22:22:53,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-17 22:22:53,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-12-17 22:22:53,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 837 transitions. [2021-12-17 22:22:53,395 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8181818181818182 [2021-12-17 22:22:53,395 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 837 transitions. [2021-12-17 22:22:53,395 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 837 transitions. [2021-12-17 22:22:53,395 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 22:22:53,396 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 837 transitions. [2021-12-17 22:22:53,397 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 76.0909090909091) internal successors, (837), 11 states have internal predecessors, (837), 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-17 22:22:53,398 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 93.0) internal successors, (1116), 12 states have internal predecessors, (1116), 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-17 22:22:53,398 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 93.0) internal successors, (1116), 12 states have internal predecessors, (1116), 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-17 22:22:53,399 INFO L186 Difference]: Start difference. First operand has 133 places, 96 transitions, 449 flow. Second operand 11 states and 837 transitions. [2021-12-17 22:22:53,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 118 transitions, 821 flow [2021-12-17 22:22:53,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 118 transitions, 743 flow, removed 36 selfloop flow, removed 9 redundant places. [2021-12-17 22:22:53,406 INFO L242 Difference]: Finished difference. Result has 131 places, 95 transitions, 442 flow [2021-12-17 22:22:53,406 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=405, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=442, PETRI_PLACES=131, PETRI_TRANSITIONS=95} [2021-12-17 22:22:53,408 INFO L334 CegarLoopForPetriNet]: 96 programPoint places, 35 predicate places. [2021-12-17 22:22:53,408 INFO L470 AbstractCegarLoop]: Abstraction has has 131 places, 95 transitions, 442 flow [2021-12-17 22:22:53,408 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 73.44444444444444) internal successors, (661), 9 states have internal predecessors, (661), 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-17 22:22:53,408 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:22:53,408 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-17 22:22:53,409 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-17 22:22:53,409 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-17 22:22:53,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:22:53,409 INFO L85 PathProgramCache]: Analyzing trace with hash -969276638, now seen corresponding path program 1 times [2021-12-17 22:22:53,409 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 22:22:53,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271127396] [2021-12-17 22:22:53,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:22:53,410 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 22:22:53,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:22:53,566 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-17 22:22:53,566 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 22:22:53,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271127396] [2021-12-17 22:22:53,567 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271127396] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 22:22:53,567 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 22:22:53,567 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-17 22:22:53,567 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759315282] [2021-12-17 22:22:53,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 22:22:53,568 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-17 22:22:53,568 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 22:22:53,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-17 22:22:53,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2021-12-17 22:22:53,570 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 93 [2021-12-17 22:22:53,571 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 95 transitions, 442 flow. Second operand has 11 states, 11 states have (on average 72.36363636363636) internal successors, (796), 11 states have internal predecessors, (796), 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-17 22:22:53,571 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:22:53,571 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 93 [2021-12-17 22:22:53,571 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:22:53,886 INFO L129 PetriNetUnfolder]: 96/365 cut-off events. [2021-12-17 22:22:53,886 INFO L130 PetriNetUnfolder]: For 3156/3330 co-relation queries the response was YES. [2021-12-17 22:22:53,888 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1724 conditions, 365 events. 96/365 cut-off events. For 3156/3330 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1688 event pairs, 18 based on Foata normal form. 20/365 useless extension candidates. Maximal degree in co-relation 1637. Up to 98 conditions per place. [2021-12-17 22:22:53,889 INFO L132 encePairwiseOnDemand]: 82/93 looper letters, 25 selfloop transitions, 18 changer transitions 19/124 dead transitions. [2021-12-17 22:22:53,889 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 124 transitions, 920 flow [2021-12-17 22:22:53,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-17 22:22:53,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-12-17 22:22:53,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 974 transitions. [2021-12-17 22:22:53,892 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8056244830438379 [2021-12-17 22:22:53,892 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 974 transitions. [2021-12-17 22:22:53,892 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 974 transitions. [2021-12-17 22:22:53,893 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 22:22:53,893 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 974 transitions. [2021-12-17 22:22:53,895 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 74.92307692307692) internal successors, (974), 13 states have internal predecessors, (974), 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-17 22:22:53,896 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 93.0) internal successors, (1302), 14 states have internal predecessors, (1302), 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-17 22:22:53,896 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 93.0) internal successors, (1302), 14 states have internal predecessors, (1302), 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-17 22:22:53,897 INFO L186 Difference]: Start difference. First operand has 131 places, 95 transitions, 442 flow. Second operand 13 states and 974 transitions. [2021-12-17 22:22:53,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 124 transitions, 920 flow [2021-12-17 22:22:53,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 124 transitions, 793 flow, removed 57 selfloop flow, removed 12 redundant places. [2021-12-17 22:22:53,903 INFO L242 Difference]: Finished difference. Result has 132 places, 97 transitions, 498 flow [2021-12-17 22:22:53,903 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=498, PETRI_PLACES=132, PETRI_TRANSITIONS=97} [2021-12-17 22:22:53,904 INFO L334 CegarLoopForPetriNet]: 96 programPoint places, 36 predicate places. [2021-12-17 22:22:53,904 INFO L470 AbstractCegarLoop]: Abstraction has has 132 places, 97 transitions, 498 flow [2021-12-17 22:22:53,905 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 72.36363636363636) internal successors, (796), 11 states have internal predecessors, (796), 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-17 22:22:53,905 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:22:53,905 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-17 22:22:53,905 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-17 22:22:53,905 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-17 22:22:53,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:22:53,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1583004974, now seen corresponding path program 1 times [2021-12-17 22:22:53,906 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 22:22:53,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595023117] [2021-12-17 22:22:53,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:22:53,906 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 22:22:53,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:22:54,052 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-17 22:22:54,052 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 22:22:54,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595023117] [2021-12-17 22:22:54,053 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595023117] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 22:22:54,053 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 22:22:54,053 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-12-17 22:22:54,053 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131163270] [2021-12-17 22:22:54,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 22:22:54,053 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-17 22:22:54,054 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 22:22:54,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-17 22:22:54,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2021-12-17 22:22:54,055 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 93 [2021-12-17 22:22:54,055 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 97 transitions, 498 flow. Second operand has 12 states, 12 states have (on average 71.41666666666667) internal successors, (857), 12 states have internal predecessors, (857), 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-17 22:22:54,055 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:22:54,056 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 93 [2021-12-17 22:22:54,056 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:22:54,312 INFO L129 PetriNetUnfolder]: 71/291 cut-off events. [2021-12-17 22:22:54,312 INFO L130 PetriNetUnfolder]: For 2508/2816 co-relation queries the response was YES. [2021-12-17 22:22:54,313 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1414 conditions, 291 events. 71/291 cut-off events. For 2508/2816 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1170 event pairs, 16 based on Foata normal form. 14/285 useless extension candidates. Maximal degree in co-relation 1327. Up to 111 conditions per place. [2021-12-17 22:22:54,315 INFO L132 encePairwiseOnDemand]: 81/93 looper letters, 28 selfloop transitions, 18 changer transitions 14/121 dead transitions. [2021-12-17 22:22:54,315 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 121 transitions, 893 flow [2021-12-17 22:22:54,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-17 22:22:54,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2021-12-17 22:22:54,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1026 transitions. [2021-12-17 22:22:54,329 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7880184331797235 [2021-12-17 22:22:54,329 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1026 transitions. [2021-12-17 22:22:54,329 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1026 transitions. [2021-12-17 22:22:54,330 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 22:22:54,330 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1026 transitions. [2021-12-17 22:22:54,331 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 73.28571428571429) internal successors, (1026), 14 states have internal predecessors, (1026), 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-17 22:22:54,333 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 93.0) internal successors, (1395), 15 states have internal predecessors, (1395), 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-17 22:22:54,333 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 93.0) internal successors, (1395), 15 states have internal predecessors, (1395), 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-17 22:22:54,333 INFO L186 Difference]: Start difference. First operand has 132 places, 97 transitions, 498 flow. Second operand 14 states and 1026 transitions. [2021-12-17 22:22:54,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 121 transitions, 893 flow [2021-12-17 22:22:54,338 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 121 transitions, 847 flow, removed 16 selfloop flow, removed 7 redundant places. [2021-12-17 22:22:54,340 INFO L242 Difference]: Finished difference. Result has 140 places, 100 transitions, 588 flow [2021-12-17 22:22:54,340 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=472, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=588, PETRI_PLACES=140, PETRI_TRANSITIONS=100} [2021-12-17 22:22:54,340 INFO L334 CegarLoopForPetriNet]: 96 programPoint places, 44 predicate places. [2021-12-17 22:22:54,341 INFO L470 AbstractCegarLoop]: Abstraction has has 140 places, 100 transitions, 588 flow [2021-12-17 22:22:54,341 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 71.41666666666667) internal successors, (857), 12 states have internal predecessors, (857), 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-17 22:22:54,341 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:22:54,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, 1] [2021-12-17 22:22:54,342 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-17 22:22:54,342 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-17 22:22:54,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:22:54,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1726596724, now seen corresponding path program 2 times [2021-12-17 22:22:54,342 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 22:22:54,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785523767] [2021-12-17 22:22:54,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:22:54,343 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 22:22:54,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:22:54,486 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-17 22:22:54,486 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 22:22:54,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785523767] [2021-12-17 22:22:54,486 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785523767] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 22:22:54,486 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 22:22:54,486 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-17 22:22:54,487 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713096596] [2021-12-17 22:22:54,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 22:22:54,487 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-17 22:22:54,487 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 22:22:54,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-17 22:22:54,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2021-12-17 22:22:54,488 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 93 [2021-12-17 22:22:54,489 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 100 transitions, 588 flow. Second operand has 11 states, 11 states have (on average 69.72727272727273) internal successors, (767), 11 states have internal predecessors, (767), 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-17 22:22:54,489 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:22:54,489 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 93 [2021-12-17 22:22:54,489 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:22:54,770 INFO L129 PetriNetUnfolder]: 65/293 cut-off events. [2021-12-17 22:22:54,771 INFO L130 PetriNetUnfolder]: For 3523/3912 co-relation queries the response was YES. [2021-12-17 22:22:54,772 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1564 conditions, 293 events. 65/293 cut-off events. For 3523/3912 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1204 event pairs, 16 based on Foata normal form. 9/284 useless extension candidates. Maximal degree in co-relation 1469. Up to 116 conditions per place. [2021-12-17 22:22:54,773 INFO L132 encePairwiseOnDemand]: 82/93 looper letters, 33 selfloop transitions, 13 changer transitions 15/120 dead transitions. [2021-12-17 22:22:54,774 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 120 transitions, 993 flow [2021-12-17 22:22:54,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-17 22:22:54,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-12-17 22:22:54,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 860 transitions. [2021-12-17 22:22:54,775 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7706093189964157 [2021-12-17 22:22:54,776 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 860 transitions. [2021-12-17 22:22:54,776 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 860 transitions. [2021-12-17 22:22:54,776 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 22:22:54,776 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 860 transitions. [2021-12-17 22:22:54,777 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 71.66666666666667) internal successors, (860), 12 states have internal predecessors, (860), 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-17 22:22:54,778 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 93.0) internal successors, (1209), 13 states have internal predecessors, (1209), 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-17 22:22:54,779 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 93.0) internal successors, (1209), 13 states have internal predecessors, (1209), 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-17 22:22:54,779 INFO L186 Difference]: Start difference. First operand has 140 places, 100 transitions, 588 flow. Second operand 12 states and 860 transitions. [2021-12-17 22:22:54,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 120 transitions, 993 flow [2021-12-17 22:22:54,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 120 transitions, 852 flow, removed 56 selfloop flow, removed 14 redundant places. [2021-12-17 22:22:54,787 INFO L242 Difference]: Finished difference. Result has 139 places, 100 transitions, 585 flow [2021-12-17 22:22:54,787 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=524, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=585, PETRI_PLACES=139, PETRI_TRANSITIONS=100} [2021-12-17 22:22:54,788 INFO L334 CegarLoopForPetriNet]: 96 programPoint places, 43 predicate places. [2021-12-17 22:22:54,788 INFO L470 AbstractCegarLoop]: Abstraction has has 139 places, 100 transitions, 585 flow [2021-12-17 22:22:54,788 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 69.72727272727273) internal successors, (767), 11 states have internal predecessors, (767), 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-17 22:22:54,789 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:22:54,789 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-17 22:22:54,789 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-17 22:22:54,789 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-12-17 22:22:54,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:22:54,789 INFO L85 PathProgramCache]: Analyzing trace with hash -589798524, now seen corresponding path program 3 times [2021-12-17 22:22:54,790 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 22:22:54,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148985731] [2021-12-17 22:22:54,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:22:54,790 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 22:22:54,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:22:55,004 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-17 22:22:55,004 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 22:22:55,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148985731] [2021-12-17 22:22:55,004 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148985731] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 22:22:55,005 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 22:22:55,005 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-12-17 22:22:55,005 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581258732] [2021-12-17 22:22:55,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 22:22:55,005 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-17 22:22:55,005 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 22:22:55,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-17 22:22:55,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2021-12-17 22:22:55,006 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 93 [2021-12-17 22:22:55,007 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 100 transitions, 585 flow. Second operand has 13 states, 13 states have (on average 70.38461538461539) internal successors, (915), 13 states have internal predecessors, (915), 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-17 22:22:55,007 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:22:55,007 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 93 [2021-12-17 22:22:55,007 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:22:55,390 INFO L129 PetriNetUnfolder]: 61/281 cut-off events. [2021-12-17 22:22:55,390 INFO L130 PetriNetUnfolder]: For 3628/4124 co-relation queries the response was YES. [2021-12-17 22:22:55,391 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1536 conditions, 281 events. 61/281 cut-off events. For 3628/4124 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1138 event pairs, 15 based on Foata normal form. 16/279 useless extension candidates. Maximal degree in co-relation 1443. Up to 102 conditions per place. [2021-12-17 22:22:55,393 INFO L132 encePairwiseOnDemand]: 81/93 looper letters, 23 selfloop transitions, 17 changer transitions 16/116 dead transitions. [2021-12-17 22:22:55,393 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 116 transitions, 935 flow [2021-12-17 22:22:55,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-17 22:22:55,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2021-12-17 22:22:55,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1080 transitions. [2021-12-17 22:22:55,395 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7741935483870968 [2021-12-17 22:22:55,395 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1080 transitions. [2021-12-17 22:22:55,395 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1080 transitions. [2021-12-17 22:22:55,396 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 22:22:55,396 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1080 transitions. [2021-12-17 22:22:55,397 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 72.0) internal successors, (1080), 15 states have internal predecessors, (1080), 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-17 22:22:55,398 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 93.0) internal successors, (1488), 16 states have internal predecessors, (1488), 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-17 22:22:55,399 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 93.0) internal successors, (1488), 16 states have internal predecessors, (1488), 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-17 22:22:55,399 INFO L186 Difference]: Start difference. First operand has 139 places, 100 transitions, 585 flow. Second operand 15 states and 1080 transitions. [2021-12-17 22:22:55,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 116 transitions, 935 flow [2021-12-17 22:22:55,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 116 transitions, 830 flow, removed 45 selfloop flow, removed 10 redundant places. [2021-12-17 22:22:55,409 INFO L242 Difference]: Finished difference. Result has 143 places, 96 transitions, 563 flow [2021-12-17 22:22:55,410 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=542, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=563, PETRI_PLACES=143, PETRI_TRANSITIONS=96} [2021-12-17 22:22:55,410 INFO L334 CegarLoopForPetriNet]: 96 programPoint places, 47 predicate places. [2021-12-17 22:22:55,411 INFO L470 AbstractCegarLoop]: Abstraction has has 143 places, 96 transitions, 563 flow [2021-12-17 22:22:55,411 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 70.38461538461539) internal successors, (915), 13 states have internal predecessors, (915), 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-17 22:22:55,411 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:22:55,411 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-17 22:22:55,411 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-17 22:22:55,412 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-12-17 22:22:55,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:22:55,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1376149048, now seen corresponding path program 4 times [2021-12-17 22:22:55,412 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 22:22:55,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599106358] [2021-12-17 22:22:55,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:22:55,413 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 22:22:55,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:22:55,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 22:22:55,591 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 22:22:55,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599106358] [2021-12-17 22:22:55,591 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599106358] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 22:22:55,591 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 22:22:55,591 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-12-17 22:22:55,592 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247303214] [2021-12-17 22:22:55,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 22:22:55,592 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-17 22:22:55,592 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 22:22:55,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-17 22:22:55,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2021-12-17 22:22:55,593 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 93 [2021-12-17 22:22:55,594 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 96 transitions, 563 flow. Second operand has 12 states, 12 states have (on average 71.41666666666667) internal successors, (857), 12 states have internal predecessors, (857), 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-17 22:22:55,594 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:22:55,594 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 93 [2021-12-17 22:22:55,594 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:22:55,813 INFO L129 PetriNetUnfolder]: 47/263 cut-off events. [2021-12-17 22:22:55,813 INFO L130 PetriNetUnfolder]: For 2955/3390 co-relation queries the response was YES. [2021-12-17 22:22:55,815 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1371 conditions, 263 events. 47/263 cut-off events. For 2955/3390 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1067 event pairs, 2 based on Foata normal form. 15/262 useless extension candidates. Maximal degree in co-relation 1277. Up to 55 conditions per place. [2021-12-17 22:22:55,816 INFO L132 encePairwiseOnDemand]: 82/93 looper letters, 25 selfloop transitions, 14 changer transitions 13/111 dead transitions. [2021-12-17 22:22:55,816 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 111 transitions, 879 flow [2021-12-17 22:22:55,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-17 22:22:55,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2021-12-17 22:22:55,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1018 transitions. [2021-12-17 22:22:55,817 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7818740399385561 [2021-12-17 22:22:55,817 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1018 transitions. [2021-12-17 22:22:55,817 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1018 transitions. [2021-12-17 22:22:55,818 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 22:22:55,818 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1018 transitions. [2021-12-17 22:22:55,819 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 72.71428571428571) internal successors, (1018), 14 states have internal predecessors, (1018), 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-17 22:22:55,820 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 93.0) internal successors, (1395), 15 states have internal predecessors, (1395), 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-17 22:22:55,821 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 93.0) internal successors, (1395), 15 states have internal predecessors, (1395), 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-17 22:22:55,821 INFO L186 Difference]: Start difference. First operand has 143 places, 96 transitions, 563 flow. Second operand 14 states and 1018 transitions. [2021-12-17 22:22:55,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 111 transitions, 879 flow [2021-12-17 22:22:55,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 111 transitions, 718 flow, removed 53 selfloop flow, removed 17 redundant places. [2021-12-17 22:22:55,828 INFO L242 Difference]: Finished difference. Result has 136 places, 93 transitions, 493 flow [2021-12-17 22:22:55,828 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=472, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=493, PETRI_PLACES=136, PETRI_TRANSITIONS=93} [2021-12-17 22:22:55,828 INFO L334 CegarLoopForPetriNet]: 96 programPoint places, 40 predicate places. [2021-12-17 22:22:55,829 INFO L470 AbstractCegarLoop]: Abstraction has has 136 places, 93 transitions, 493 flow [2021-12-17 22:22:55,829 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 71.41666666666667) internal successors, (857), 12 states have internal predecessors, (857), 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-17 22:22:55,829 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:22:55,829 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-17 22:22:55,829 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-17 22:22:55,830 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-12-17 22:22:55,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:22:55,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1370930184, now seen corresponding path program 1 times [2021-12-17 22:22:55,830 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 22:22:55,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425076022] [2021-12-17 22:22:55,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:22:55,830 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 22:22:55,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:22:55,909 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-17 22:22:55,910 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 22:22:55,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425076022] [2021-12-17 22:22:55,910 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425076022] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 22:22:55,910 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 22:22:55,910 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-17 22:22:55,910 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606480796] [2021-12-17 22:22:55,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 22:22:55,911 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-17 22:22:55,911 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 22:22:55,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-17 22:22:55,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-17 22:22:55,912 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 93 [2021-12-17 22:22:55,912 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 93 transitions, 493 flow. Second operand has 6 states, 6 states have (on average 74.16666666666667) internal successors, (445), 6 states have internal predecessors, (445), 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-17 22:22:55,912 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:22:55,912 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 93 [2021-12-17 22:22:55,912 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:22:56,071 INFO L129 PetriNetUnfolder]: 163/557 cut-off events. [2021-12-17 22:22:56,072 INFO L130 PetriNetUnfolder]: For 2778/2807 co-relation queries the response was YES. [2021-12-17 22:22:56,074 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1869 conditions, 557 events. 163/557 cut-off events. For 2778/2807 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3121 event pairs, 12 based on Foata normal form. 29/573 useless extension candidates. Maximal degree in co-relation 1782. Up to 116 conditions per place. [2021-12-17 22:22:56,075 INFO L132 encePairwiseOnDemand]: 84/93 looper letters, 23 selfloop transitions, 5 changer transitions 46/135 dead transitions. [2021-12-17 22:22:56,075 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 135 transitions, 1024 flow [2021-12-17 22:22:56,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-17 22:22:56,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-12-17 22:22:56,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 778 transitions. [2021-12-17 22:22:56,077 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8365591397849462 [2021-12-17 22:22:56,077 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 778 transitions. [2021-12-17 22:22:56,077 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 778 transitions. [2021-12-17 22:22:56,077 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 22:22:56,077 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 778 transitions. [2021-12-17 22:22:56,078 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 77.8) internal successors, (778), 10 states have internal predecessors, (778), 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-17 22:22:56,080 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 93.0) internal successors, (1023), 11 states have internal predecessors, (1023), 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-17 22:22:56,080 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 93.0) internal successors, (1023), 11 states have internal predecessors, (1023), 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-17 22:22:56,080 INFO L186 Difference]: Start difference. First operand has 136 places, 93 transitions, 493 flow. Second operand 10 states and 778 transitions. [2021-12-17 22:22:56,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 135 transitions, 1024 flow [2021-12-17 22:22:56,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 135 transitions, 802 flow, removed 53 selfloop flow, removed 26 redundant places. [2021-12-17 22:22:56,086 INFO L242 Difference]: Finished difference. Result has 119 places, 83 transitions, 327 flow [2021-12-17 22:22:56,086 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=289, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=327, PETRI_PLACES=119, PETRI_TRANSITIONS=83} [2021-12-17 22:22:56,087 INFO L334 CegarLoopForPetriNet]: 96 programPoint places, 23 predicate places. [2021-12-17 22:22:56,087 INFO L470 AbstractCegarLoop]: Abstraction has has 119 places, 83 transitions, 327 flow [2021-12-17 22:22:56,087 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 74.16666666666667) internal successors, (445), 6 states have internal predecessors, (445), 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-17 22:22:56,088 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:22:56,088 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] [2021-12-17 22:22:56,088 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-17 22:22:56,088 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-12-17 22:22:56,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:22:56,089 INFO L85 PathProgramCache]: Analyzing trace with hash 64661565, now seen corresponding path program 1 times [2021-12-17 22:22:56,089 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 22:22:56,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761774967] [2021-12-17 22:22:56,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:22:56,089 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 22:22:56,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:22:56,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 22:22:56,146 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 22:22:56,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761774967] [2021-12-17 22:22:56,146 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761774967] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 22:22:56,146 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 22:22:56,146 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-17 22:22:56,146 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689845329] [2021-12-17 22:22:56,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 22:22:56,147 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-17 22:22:56,147 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 22:22:56,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-17 22:22:56,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-17 22:22:56,148 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 93 [2021-12-17 22:22:56,148 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 83 transitions, 327 flow. Second operand has 7 states, 7 states have (on average 74.0) internal successors, (518), 7 states have internal predecessors, (518), 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-17 22:22:56,148 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:22:56,148 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 93 [2021-12-17 22:22:56,149 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:22:56,261 INFO L129 PetriNetUnfolder]: 32/185 cut-off events. [2021-12-17 22:22:56,262 INFO L130 PetriNetUnfolder]: For 475/479 co-relation queries the response was YES. [2021-12-17 22:22:56,262 INFO L84 FinitePrefix]: Finished finitePrefix Result has 600 conditions, 185 events. 32/185 cut-off events. For 475/479 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 553 event pairs, 1 based on Foata normal form. 13/198 useless extension candidates. Maximal degree in co-relation 535. Up to 39 conditions per place. [2021-12-17 22:22:56,263 INFO L132 encePairwiseOnDemand]: 85/93 looper letters, 15 selfloop transitions, 7 changer transitions 21/103 dead transitions. [2021-12-17 22:22:56,263 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 103 transitions, 587 flow [2021-12-17 22:22:56,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-17 22:22:56,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-12-17 22:22:56,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 757 transitions. [2021-12-17 22:22:56,265 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8139784946236559 [2021-12-17 22:22:56,265 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 757 transitions. [2021-12-17 22:22:56,265 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 757 transitions. [2021-12-17 22:22:56,265 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 22:22:56,265 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 757 transitions. [2021-12-17 22:22:56,266 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 75.7) internal successors, (757), 10 states have internal predecessors, (757), 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-17 22:22:56,267 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 93.0) internal successors, (1023), 11 states have internal predecessors, (1023), 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-17 22:22:56,267 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 93.0) internal successors, (1023), 11 states have internal predecessors, (1023), 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-17 22:22:56,267 INFO L186 Difference]: Start difference. First operand has 119 places, 83 transitions, 327 flow. Second operand 10 states and 757 transitions. [2021-12-17 22:22:56,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 103 transitions, 587 flow [2021-12-17 22:22:56,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 103 transitions, 444 flow, removed 62 selfloop flow, removed 15 redundant places. [2021-12-17 22:22:56,270 INFO L242 Difference]: Finished difference. Result has 113 places, 80 transitions, 263 flow [2021-12-17 22:22:56,270 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=253, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=263, PETRI_PLACES=113, PETRI_TRANSITIONS=80} [2021-12-17 22:22:56,271 INFO L334 CegarLoopForPetriNet]: 96 programPoint places, 17 predicate places. [2021-12-17 22:22:56,271 INFO L470 AbstractCegarLoop]: Abstraction has has 113 places, 80 transitions, 263 flow [2021-12-17 22:22:56,272 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 74.0) internal successors, (518), 7 states have internal predecessors, (518), 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-17 22:22:56,272 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:22:56,272 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] [2021-12-17 22:22:56,272 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-17 22:22:56,272 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-12-17 22:22:56,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:22:56,273 INFO L85 PathProgramCache]: Analyzing trace with hash 115375875, now seen corresponding path program 1 times [2021-12-17 22:22:56,273 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 22:22:56,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066489126] [2021-12-17 22:22:56,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:22:56,273 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 22:22:56,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-17 22:22:56,310 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-17 22:22:56,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-17 22:22:56,354 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-17 22:22:56,354 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-17 22:22:56,355 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2021-12-17 22:22:56,357 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2021-12-17 22:22:56,357 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (2 of 5 remaining) [2021-12-17 22:22:56,357 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (1 of 5 remaining) [2021-12-17 22:22:56,357 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2021-12-17 22:22:56,357 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-17 22:22:56,360 INFO L732 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 22:22:56,364 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-12-17 22:22:56,364 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-17 22:22:56,433 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.12 10:22:56 BasicIcfg [2021-12-17 22:22:56,433 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-17 22:22:56,433 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-17 22:22:56,434 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-17 22:22:56,434 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-17 22:22:56,434 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 10:22:49" (3/4) ... [2021-12-17 22:22:56,435 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-17 22:22:56,521 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-17 22:22:56,521 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-17 22:22:56,522 INFO L158 Benchmark]: Toolchain (without parser) took 8435.08ms. Allocated memory was 83.9MB in the beginning and 255.9MB in the end (delta: 172.0MB). Free memory was 42.1MB in the beginning and 177.4MB in the end (delta: -135.3MB). Peak memory consumption was 38.5MB. Max. memory is 16.1GB. [2021-12-17 22:22:56,522 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 83.9MB. Free memory is still 59.7MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-17 22:22:56,523 INFO L158 Benchmark]: CACSL2BoogieTranslator took 384.94ms. Allocated memory was 83.9MB in the beginning and 113.2MB in the end (delta: 29.4MB). Free memory was 41.9MB in the beginning and 72.9MB in the end (delta: -31.0MB). Peak memory consumption was 7.0MB. Max. memory is 16.1GB. [2021-12-17 22:22:56,523 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.79ms. Allocated memory is still 113.2MB. Free memory was 72.9MB in the beginning and 70.0MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-17 22:22:56,523 INFO L158 Benchmark]: Boogie Preprocessor took 32.71ms. Allocated memory is still 113.2MB. Free memory was 70.0MB in the beginning and 68.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-17 22:22:56,523 INFO L158 Benchmark]: RCFGBuilder took 780.10ms. Allocated memory is still 113.2MB. Free memory was 68.0MB in the beginning and 84.1MB in the end (delta: -16.2MB). Peak memory consumption was 40.4MB. Max. memory is 16.1GB. [2021-12-17 22:22:56,524 INFO L158 Benchmark]: TraceAbstraction took 7080.99ms. Allocated memory was 113.2MB in the beginning and 255.9MB in the end (delta: 142.6MB). Free memory was 84.1MB in the beginning and 195.3MB in the end (delta: -111.1MB). Peak memory consumption was 31.0MB. Max. memory is 16.1GB. [2021-12-17 22:22:56,524 INFO L158 Benchmark]: Witness Printer took 87.88ms. Allocated memory is still 255.9MB. Free memory was 195.3MB in the beginning and 177.4MB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2021-12-17 22:22:56,527 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.16ms. Allocated memory is still 83.9MB. Free memory is still 59.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 384.94ms. Allocated memory was 83.9MB in the beginning and 113.2MB in the end (delta: 29.4MB). Free memory was 41.9MB in the beginning and 72.9MB in the end (delta: -31.0MB). Peak memory consumption was 7.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.79ms. Allocated memory is still 113.2MB. Free memory was 72.9MB in the beginning and 70.0MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.71ms. Allocated memory is still 113.2MB. Free memory was 70.0MB in the beginning and 68.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 780.10ms. Allocated memory is still 113.2MB. Free memory was 68.0MB in the beginning and 84.1MB in the end (delta: -16.2MB). Peak memory consumption was 40.4MB. Max. memory is 16.1GB. * TraceAbstraction took 7080.99ms. Allocated memory was 113.2MB in the beginning and 255.9MB in the end (delta: 142.6MB). Free memory was 84.1MB in the beginning and 195.3MB in the end (delta: -111.1MB). Peak memory consumption was 31.0MB. Max. memory is 16.1GB. * Witness Printer took 87.88ms. Allocated memory is still 255.9MB. Free memory was 195.3MB in the beginning and 177.4MB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. 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] [L709] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0] [L710] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0] [L712] 0 int x = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L713] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L714] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L715] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L716] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=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] [L717] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=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] [L718] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=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] [L719] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=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] [L720] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=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] [L721] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=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] [L722] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=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}] [L723] 0 int x$w_buff0; VAL [__unbuffered_cnt=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] [L724] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=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] [L725] 0 int x$w_buff1; VAL [__unbuffered_cnt=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] [L726] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=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] [L728] 0 int y = 0; VAL [__unbuffered_cnt=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] [L729] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=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] [L730] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=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] [L790] 0 pthread_t t2475; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2475={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] [L791] FCALL, FORK 0 pthread_create(&t2475, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2475, ((void *)0), P0, ((void *)0))=-1, t2475={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] [L792] 0 pthread_t t2476; VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2475={5:0}, t2476={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] [L793] FCALL, FORK 0 pthread_create(&t2476, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2476, ((void *)0), P1, ((void *)0))=0, t2475={5:0}, t2476={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] [L754] 2 x$w_buff1 = x$w_buff0 [L755] 2 x$w_buff0 = 2 [L756] 2 x$w_buff1_used = x$w_buff0_used [L757] 2 x$w_buff0_used = (_Bool)1 [L758] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L758] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L759] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L760] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L761] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L762] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=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] [L765] 2 y = 1 VAL [__unbuffered_cnt=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=1] [L734] 1 y = 2 VAL [__unbuffered_cnt=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=2] [L737] 1 x = 1 VAL [__unbuffered_cnt=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=2] [L768] 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) [L768] 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) [L769] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L769] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L770] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L770] 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 [L771] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L771] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L772] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L772] 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 [L740] 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) [L740] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L740] 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) [L740] 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) [L741] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L741] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L742] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L742] 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 [L743] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L743] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L744] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L744] 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 [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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=2] [L747] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, 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=2] [L795] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2475={5:0}, t2476={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=2] [L797] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=2, 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=2] [L797] RET 0 assume_abort_if_not(main$tmp_guard0) [L799] 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) [L799] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L799] 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) [L799] 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) [L800] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L800] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L801] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L801] 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 [L802] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L802] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L803] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L803] 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 [L806] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 0 x$flush_delayed = weak$$choice2 [L809] 0 x$mem_tmp = x [L810] 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) [L810] 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) [L811] 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)) [L811] 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)) [L812] 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)) [L812] 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)) [L813] 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)) [L813] 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)) [L814] 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)) [L814] 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)) [L815] 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)) [L815] 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)) [L816] 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)) [L816] 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)) [L817] 0 main$tmp_guard1 = !(x == 2 && y == 2) [L818] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L818] 0 x = x$flush_delayed ? x$mem_tmp : x [L819] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2475={5:0}, t2476={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=2] [L821] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=2, 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=2] [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=2, 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=2] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 791]: 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, 111 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: 6.9s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 576 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 576 mSDsluCounter, 783 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 959 mSDsCounter, 210 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1722 IncrementalHoareTripleChecker+Invalid, 1932 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 210 mSolverCounterUnsat, 135 mSDtfsCounter, 1722 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 234 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 494 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=588occurred in iteration=10, InterpolantAutomatonStates: 178, 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.5s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 1049 NumberOfCodeBlocks, 1049 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 962 ConstructedInterpolants, 0 QuantifiedInterpolants, 6214 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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-17 22:22:56,554 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