./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e19ca921 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/safe030_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 6e0191a7c0154db5e6d5798f5b20e5814ce0ff555e18a7acf1f1e5e323a36576 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-e19ca92 [2021-12-22 13:32:41,748 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-22 13:32:41,750 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-22 13:32:41,769 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-22 13:32:41,770 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-22 13:32:41,771 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-22 13:32:41,772 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-22 13:32:41,773 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-22 13:32:41,774 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-22 13:32:41,774 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-22 13:32:41,775 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-22 13:32:41,776 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-22 13:32:41,776 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-22 13:32:41,777 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-22 13:32:41,778 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-22 13:32:41,779 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-22 13:32:41,779 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-22 13:32:41,780 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-22 13:32:41,781 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-22 13:32:41,792 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-22 13:32:41,793 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-22 13:32:41,795 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-22 13:32:41,796 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-22 13:32:41,797 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-22 13:32:41,799 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-22 13:32:41,803 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-22 13:32:41,803 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-22 13:32:41,804 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-22 13:32:41,805 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-22 13:32:41,805 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-22 13:32:41,805 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-22 13:32:41,806 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-22 13:32:41,806 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-22 13:32:41,807 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-22 13:32:41,807 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-22 13:32:41,808 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-22 13:32:41,808 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-22 13:32:41,808 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-22 13:32:41,809 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-22 13:32:41,809 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-22 13:32:41,810 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-22 13:32:41,810 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-22 13:32:41,840 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-22 13:32:41,844 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-22 13:32:41,845 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-22 13:32:41,845 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-22 13:32:41,846 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-22 13:32:41,846 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-22 13:32:41,847 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-22 13:32:41,847 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-22 13:32:41,847 INFO L138 SettingsManager]: * Use SBE=true [2021-12-22 13:32:41,847 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-22 13:32:41,848 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-22 13:32:41,848 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-22 13:32:41,848 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-22 13:32:41,848 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-22 13:32:41,849 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-22 13:32:41,849 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-22 13:32:41,849 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-22 13:32:41,849 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-22 13:32:41,849 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-22 13:32:41,849 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-22 13:32:41,850 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-22 13:32:41,850 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-22 13:32:41,850 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-22 13:32:41,850 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-22 13:32:41,850 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-22 13:32:41,850 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-22 13:32:41,851 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-22 13:32:41,851 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-22 13:32:41,851 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-22 13:32:41,851 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-22 13:32:41,851 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-22 13:32:41,851 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-22 13:32:41,852 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-22 13:32:41,852 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-22 13:32:41,852 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 -> 6e0191a7c0154db5e6d5798f5b20e5814ce0ff555e18a7acf1f1e5e323a36576 [2021-12-22 13:32:42,076 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-22 13:32:42,109 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-22 13:32:42,111 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-22 13:32:42,112 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-22 13:32:42,112 INFO L275 PluginConnector]: CDTParser initialized [2021-12-22 13:32:42,113 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i [2021-12-22 13:32:42,171 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d579c99c/a8e085ba0cf9493a92532cb263144e18/FLAGf7ec23b28 [2021-12-22 13:32:42,562 INFO L306 CDTParser]: Found 1 translation units. [2021-12-22 13:32:42,562 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i [2021-12-22 13:32:42,577 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d579c99c/a8e085ba0cf9493a92532cb263144e18/FLAGf7ec23b28 [2021-12-22 13:32:42,588 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d579c99c/a8e085ba0cf9493a92532cb263144e18 [2021-12-22 13:32:42,589 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-22 13:32:42,591 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-22 13:32:42,592 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-22 13:32:42,592 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-22 13:32:42,595 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-22 13:32:42,595 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 01:32:42" (1/1) ... [2021-12-22 13:32:42,596 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49a55746 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:32:42, skipping insertion in model container [2021-12-22 13:32:42,596 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 01:32:42" (1/1) ... [2021-12-22 13:32:42,601 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-22 13:32:42,636 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-22 13:32:42,769 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/safe030_power.opt_pso.opt_rmo.opt.i[967,980] [2021-12-22 13:32:42,862 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-22 13:32:42,868 INFO L203 MainTranslator]: Completed pre-run [2021-12-22 13:32:42,880 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i[967,980] [2021-12-22 13:32:42,921 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-22 13:32:42,943 INFO L208 MainTranslator]: Completed translation [2021-12-22 13:32:42,943 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:32:42 WrapperNode [2021-12-22 13:32:42,944 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-22 13:32:42,944 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-22 13:32:42,945 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-22 13:32:42,945 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-22 13:32:42,950 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:32:42" (1/1) ... [2021-12-22 13:32:42,974 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:32:42" (1/1) ... [2021-12-22 13:32:43,008 INFO L137 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 273 [2021-12-22 13:32:43,008 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-22 13:32:43,009 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-22 13:32:43,009 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-22 13:32:43,009 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-22 13:32:43,015 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:32:42" (1/1) ... [2021-12-22 13:32:43,016 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:32:42" (1/1) ... [2021-12-22 13:32:43,019 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:32:42" (1/1) ... [2021-12-22 13:32:43,019 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:32:42" (1/1) ... [2021-12-22 13:32:43,024 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:32:42" (1/1) ... [2021-12-22 13:32:43,026 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:32:42" (1/1) ... [2021-12-22 13:32:43,028 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:32:42" (1/1) ... [2021-12-22 13:32:43,030 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-22 13:32:43,031 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-22 13:32:43,031 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-22 13:32:43,031 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-22 13:32:43,032 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:32:42" (1/1) ... [2021-12-22 13:32:43,044 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-22 13:32:43,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 13:32:43,088 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-22 13:32:43,106 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-22 13:32:43,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-22 13:32:43,115 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-12-22 13:32:43,115 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-22 13:32:43,115 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-22 13:32:43,115 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-22 13:32:43,115 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-12-22 13:32:43,115 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-12-22 13:32:43,115 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-12-22 13:32:43,116 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-12-22 13:32:43,116 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-12-22 13:32:43,116 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-12-22 13:32:43,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-22 13:32:43,116 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-12-22 13:32:43,116 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-22 13:32:43,116 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-22 13:32:43,117 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-12-22 13:32:43,231 INFO L234 CfgBuilder]: Building ICFG [2021-12-22 13:32:43,244 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-22 13:32:43,615 INFO L275 CfgBuilder]: Performing block encoding [2021-12-22 13:32:43,860 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-22 13:32:43,861 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2021-12-22 13:32:43,862 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 01:32:43 BoogieIcfgContainer [2021-12-22 13:32:43,863 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-22 13:32:43,864 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-22 13:32:43,864 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-22 13:32:43,866 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-22 13:32:43,866 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.12 01:32:42" (1/3) ... [2021-12-22 13:32:43,867 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4572e0a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 01:32:43, skipping insertion in model container [2021-12-22 13:32:43,867 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:32:42" (2/3) ... [2021-12-22 13:32:43,867 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4572e0a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 01:32:43, skipping insertion in model container [2021-12-22 13:32:43,867 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 01:32:43" (3/3) ... [2021-12-22 13:32:43,868 INFO L111 eAbstractionObserver]: Analyzing ICFG safe030_power.opt_pso.opt_rmo.opt.i [2021-12-22 13:32:43,874 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-12-22 13:32:43,874 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-22 13:32:43,874 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-12-22 13:32:43,875 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-12-22 13:32:43,919 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:43,919 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:43,919 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:43,920 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:43,920 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:43,920 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:43,920 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:43,920 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:43,920 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:43,921 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:43,921 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:43,921 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:43,922 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:43,922 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:43,922 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:43,922 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:43,922 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:43,923 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:43,923 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:43,923 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:43,923 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:43,924 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:43,924 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:43,924 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:43,924 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:43,925 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:43,925 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:43,925 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:43,926 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:43,926 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:43,926 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:43,926 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:43,926 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:43,926 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:43,927 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:43,927 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:43,927 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:43,927 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:43,928 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:43,928 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:43,928 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:43,928 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:43,928 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:43,928 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:43,929 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:43,929 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:43,929 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:43,929 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:43,929 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:43,930 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:43,930 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:43,930 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:43,930 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:43,930 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:43,931 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:43,931 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:43,931 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:43,931 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:43,931 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:43,931 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:43,931 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:43,932 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:43,932 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:43,932 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:43,932 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:43,932 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:43,933 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:43,933 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:43,934 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:43,934 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:43,934 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:43,934 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:43,937 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:43,937 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:43,937 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:43,937 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:43,937 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:43,938 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:43,938 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:43,939 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:43,940 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:43,941 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:43,942 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:43,942 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:43,943 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:43,943 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:43,943 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:43,943 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:43,943 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:43,947 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:43,947 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:43,947 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:43,948 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:43,948 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:43,948 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:43,948 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:43,949 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:43,949 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:43,949 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-12-22 13:32:43,994 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-22 13:32:43,998 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-22 13:32:43,999 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-12-22 13:32:44,006 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 120 places, 112 transitions, 239 flow [2021-12-22 13:32:44,046 INFO L129 PetriNetUnfolder]: 2/109 cut-off events. [2021-12-22 13:32:44,047 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-12-22 13:32:44,050 INFO L84 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 109 events. 2/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 49 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 72. Up to 2 conditions per place. [2021-12-22 13:32:44,050 INFO L82 GeneralOperation]: Start removeDead. Operand has 120 places, 112 transitions, 239 flow [2021-12-22 13:32:44,053 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 117 places, 109 transitions, 227 flow [2021-12-22 13:32:44,063 INFO L129 PetriNetUnfolder]: 0/72 cut-off events. [2021-12-22 13:32:44,063 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-12-22 13:32:44,079 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-22 13:32:44,080 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] [2021-12-22 13:32:44,080 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-22 13:32:44,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:32:44,084 INFO L85 PathProgramCache]: Analyzing trace with hash -2040665683, now seen corresponding path program 1 times [2021-12-22 13:32:44,090 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:32:44,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122570566] [2021-12-22 13:32:44,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:32:44,091 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:32:44,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:32:44,282 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-22 13:32:44,283 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:32:44,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122570566] [2021-12-22 13:32:44,284 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122570566] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:32:44,284 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:32:44,284 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-22 13:32:44,285 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243861940] [2021-12-22 13:32:44,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:32:44,292 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-22 13:32:44,292 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:32:44,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-22 13:32:44,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 13:32:44,318 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 112 [2021-12-22 13:32:44,322 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 109 transitions, 227 flow. Second operand has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 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-22 13:32:44,323 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-22 13:32:44,323 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 112 [2021-12-22 13:32:44,324 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-22 13:32:44,406 INFO L129 PetriNetUnfolder]: 17/241 cut-off events. [2021-12-22 13:32:44,406 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2021-12-22 13:32:44,407 INFO L84 FinitePrefix]: Finished finitePrefix Result has 293 conditions, 241 events. 17/241 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 751 event pairs, 7 based on Foata normal form. 8/237 useless extension candidates. Maximal degree in co-relation 243. Up to 27 conditions per place. [2021-12-22 13:32:44,409 INFO L132 encePairwiseOnDemand]: 107/112 looper letters, 10 selfloop transitions, 2 changer transitions 0/108 dead transitions. [2021-12-22 13:32:44,409 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 108 transitions, 249 flow [2021-12-22 13:32:44,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-22 13:32:44,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-12-22 13:32:44,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 314 transitions. [2021-12-22 13:32:44,421 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9345238095238095 [2021-12-22 13:32:44,421 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 314 transitions. [2021-12-22 13:32:44,422 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 314 transitions. [2021-12-22 13:32:44,424 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 13:32:44,433 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 314 transitions. [2021-12-22 13:32:44,436 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 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-22 13:32:44,443 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 112.0) internal successors, (448), 4 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-22 13:32:44,444 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 112.0) internal successors, (448), 4 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-22 13:32:44,446 INFO L186 Difference]: Start difference. First operand has 117 places, 109 transitions, 227 flow. Second operand 3 states and 314 transitions. [2021-12-22 13:32:44,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 108 transitions, 249 flow [2021-12-22 13:32:44,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 108 transitions, 246 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-12-22 13:32:44,450 INFO L242 Difference]: Finished difference. Result has 114 places, 105 transitions, 220 flow [2021-12-22 13:32:44,452 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=220, PETRI_PLACES=114, PETRI_TRANSITIONS=105} [2021-12-22 13:32:44,454 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, -3 predicate places. [2021-12-22 13:32:44,454 INFO L470 AbstractCegarLoop]: Abstraction has has 114 places, 105 transitions, 220 flow [2021-12-22 13:32:44,454 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 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-22 13:32:44,454 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-22 13:32:44,455 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-22 13:32:44,455 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-22 13:32:44,455 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-22 13:32:44,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:32:44,456 INFO L85 PathProgramCache]: Analyzing trace with hash -690634123, now seen corresponding path program 1 times [2021-12-22 13:32:44,456 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:32:44,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186592107] [2021-12-22 13:32:44,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:32:44,456 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:32:44,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:32:44,652 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-22 13:32:44,652 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:32:44,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186592107] [2021-12-22 13:32:44,652 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186592107] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:32:44,653 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:32:44,653 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-22 13:32:44,653 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483442110] [2021-12-22 13:32:44,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:32:44,654 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-22 13:32:44,655 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:32:44,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-22 13:32:44,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-22 13:32:44,656 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 112 [2021-12-22 13:32:44,657 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 105 transitions, 220 flow. Second operand has 6 states, 6 states have (on average 92.83333333333333) internal successors, (557), 6 states have internal predecessors, (557), 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-22 13:32:44,657 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-22 13:32:44,657 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 112 [2021-12-22 13:32:44,657 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-22 13:32:45,007 INFO L129 PetriNetUnfolder]: 282/963 cut-off events. [2021-12-22 13:32:45,007 INFO L130 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2021-12-22 13:32:45,012 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1495 conditions, 963 events. 282/963 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 6343 event pairs, 42 based on Foata normal form. 0/935 useless extension candidates. Maximal degree in co-relation 1445. Up to 249 conditions per place. [2021-12-22 13:32:45,015 INFO L132 encePairwiseOnDemand]: 105/112 looper letters, 20 selfloop transitions, 3 changer transitions 48/148 dead transitions. [2021-12-22 13:32:45,016 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 148 transitions, 444 flow [2021-12-22 13:32:45,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-22 13:32:45,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-22 13:32:45,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 881 transitions. [2021-12-22 13:32:45,021 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8740079365079365 [2021-12-22 13:32:45,022 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 881 transitions. [2021-12-22 13:32:45,022 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 881 transitions. [2021-12-22 13:32:45,023 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 13:32:45,023 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 881 transitions. [2021-12-22 13:32:45,025 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 97.88888888888889) internal successors, (881), 9 states have internal predecessors, (881), 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-22 13:32:45,029 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 112.0) internal successors, (1120), 10 states have internal predecessors, (1120), 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-22 13:32:45,029 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 112.0) internal successors, (1120), 10 states have internal predecessors, (1120), 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-22 13:32:45,030 INFO L186 Difference]: Start difference. First operand has 114 places, 105 transitions, 220 flow. Second operand 9 states and 881 transitions. [2021-12-22 13:32:45,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 148 transitions, 444 flow [2021-12-22 13:32:45,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 148 transitions, 426 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-12-22 13:32:45,039 INFO L242 Difference]: Finished difference. Result has 127 places, 95 transitions, 235 flow [2021-12-22 13:32:45,040 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=235, PETRI_PLACES=127, PETRI_TRANSITIONS=95} [2021-12-22 13:32:45,041 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 10 predicate places. [2021-12-22 13:32:45,041 INFO L470 AbstractCegarLoop]: Abstraction has has 127 places, 95 transitions, 235 flow [2021-12-22 13:32:45,041 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 92.83333333333333) internal successors, (557), 6 states have internal predecessors, (557), 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-22 13:32:45,041 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-22 13:32:45,042 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 13:32:45,042 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-22 13:32:45,043 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-22 13:32:45,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:32:45,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1140221050, now seen corresponding path program 1 times [2021-12-22 13:32:45,044 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:32:45,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572860151] [2021-12-22 13:32:45,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:32:45,044 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:32:45,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:32:45,243 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-22 13:32:45,244 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:32:45,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572860151] [2021-12-22 13:32:45,245 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572860151] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:32:45,245 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:32:45,245 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-22 13:32:45,246 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705721293] [2021-12-22 13:32:45,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:32:45,247 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-22 13:32:45,247 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:32:45,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-22 13:32:45,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-22 13:32:45,249 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 112 [2021-12-22 13:32:45,250 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 95 transitions, 235 flow. Second operand has 6 states, 6 states have (on average 92.83333333333333) internal successors, (557), 6 states have internal predecessors, (557), 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-22 13:32:45,250 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-22 13:32:45,250 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 112 [2021-12-22 13:32:45,250 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-22 13:32:45,518 INFO L129 PetriNetUnfolder]: 466/1063 cut-off events. [2021-12-22 13:32:45,519 INFO L130 PetriNetUnfolder]: For 760/760 co-relation queries the response was YES. [2021-12-22 13:32:45,522 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2396 conditions, 1063 events. 466/1063 cut-off events. For 760/760 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 6122 event pairs, 202 based on Foata normal form. 30/1068 useless extension candidates. Maximal degree in co-relation 2339. Up to 393 conditions per place. [2021-12-22 13:32:45,526 INFO L132 encePairwiseOnDemand]: 105/112 looper letters, 20 selfloop transitions, 3 changer transitions 34/136 dead transitions. [2021-12-22 13:32:45,526 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 136 transitions, 453 flow [2021-12-22 13:32:45,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-22 13:32:45,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-22 13:32:45,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 878 transitions. [2021-12-22 13:32:45,528 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.871031746031746 [2021-12-22 13:32:45,528 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 878 transitions. [2021-12-22 13:32:45,528 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 878 transitions. [2021-12-22 13:32:45,528 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 13:32:45,529 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 878 transitions. [2021-12-22 13:32:45,530 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 97.55555555555556) internal successors, (878), 9 states have internal predecessors, (878), 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-22 13:32:45,531 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 112.0) internal successors, (1120), 10 states have internal predecessors, (1120), 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-22 13:32:45,532 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 112.0) internal successors, (1120), 10 states have internal predecessors, (1120), 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-22 13:32:45,532 INFO L186 Difference]: Start difference. First operand has 127 places, 95 transitions, 235 flow. Second operand 9 states and 878 transitions. [2021-12-22 13:32:45,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 136 transitions, 453 flow [2021-12-22 13:32:45,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 136 transitions, 436 flow, removed 7 selfloop flow, removed 4 redundant places. [2021-12-22 13:32:45,540 INFO L242 Difference]: Finished difference. Result has 120 places, 97 transitions, 269 flow [2021-12-22 13:32:45,540 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=269, PETRI_PLACES=120, PETRI_TRANSITIONS=97} [2021-12-22 13:32:45,541 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 3 predicate places. [2021-12-22 13:32:45,542 INFO L470 AbstractCegarLoop]: Abstraction has has 120 places, 97 transitions, 269 flow [2021-12-22 13:32:45,542 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 92.83333333333333) internal successors, (557), 6 states have internal predecessors, (557), 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-22 13:32:45,542 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-22 13:32:45,542 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 13:32:45,543 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-22 13:32:45,543 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-22 13:32:45,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:32:45,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1834518823, now seen corresponding path program 1 times [2021-12-22 13:32:45,543 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:32:45,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344152454] [2021-12-22 13:32:45,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:32:45,544 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:32:45,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:32:45,666 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-22 13:32:45,666 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:32:45,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344152454] [2021-12-22 13:32:45,666 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344152454] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:32:45,666 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:32:45,667 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-22 13:32:45,667 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444671379] [2021-12-22 13:32:45,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:32:45,667 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-22 13:32:45,667 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:32:45,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-22 13:32:45,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-22 13:32:45,668 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 112 [2021-12-22 13:32:45,669 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 97 transitions, 269 flow. Second operand has 6 states, 6 states have (on average 93.0) internal successors, (558), 6 states have internal predecessors, (558), 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-22 13:32:45,669 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-22 13:32:45,669 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 112 [2021-12-22 13:32:45,669 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-22 13:32:45,919 INFO L129 PetriNetUnfolder]: 380/986 cut-off events. [2021-12-22 13:32:45,919 INFO L130 PetriNetUnfolder]: For 1656/1672 co-relation queries the response was YES. [2021-12-22 13:32:45,922 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2694 conditions, 986 events. 380/986 cut-off events. For 1656/1672 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 5965 event pairs, 175 based on Foata normal form. 20/976 useless extension candidates. Maximal degree in co-relation 2632. Up to 286 conditions per place. [2021-12-22 13:32:45,925 INFO L132 encePairwiseOnDemand]: 106/112 looper letters, 25 selfloop transitions, 3 changer transitions 28/135 dead transitions. [2021-12-22 13:32:45,926 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 135 transitions, 531 flow [2021-12-22 13:32:45,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-22 13:32:45,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-22 13:32:45,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 876 transitions. [2021-12-22 13:32:45,928 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8690476190476191 [2021-12-22 13:32:45,928 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 876 transitions. [2021-12-22 13:32:45,928 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 876 transitions. [2021-12-22 13:32:45,928 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 13:32:45,928 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 876 transitions. [2021-12-22 13:32:45,931 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 97.33333333333333) internal successors, (876), 9 states have internal predecessors, (876), 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-22 13:32:45,932 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 112.0) internal successors, (1120), 10 states have internal predecessors, (1120), 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-22 13:32:45,933 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 112.0) internal successors, (1120), 10 states have internal predecessors, (1120), 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-22 13:32:45,933 INFO L186 Difference]: Start difference. First operand has 120 places, 97 transitions, 269 flow. Second operand 9 states and 876 transitions. [2021-12-22 13:32:45,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 135 transitions, 531 flow [2021-12-22 13:32:45,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 135 transitions, 500 flow, removed 14 selfloop flow, removed 4 redundant places. [2021-12-22 13:32:45,941 INFO L242 Difference]: Finished difference. Result has 125 places, 97 transitions, 281 flow [2021-12-22 13:32:45,941 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=281, PETRI_PLACES=125, PETRI_TRANSITIONS=97} [2021-12-22 13:32:45,942 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 8 predicate places. [2021-12-22 13:32:45,942 INFO L470 AbstractCegarLoop]: Abstraction has has 125 places, 97 transitions, 281 flow [2021-12-22 13:32:45,942 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 93.0) internal successors, (558), 6 states have internal predecessors, (558), 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-22 13:32:45,942 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-22 13:32:45,943 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 13:32:45,943 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-22 13:32:45,943 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-22 13:32:45,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:32:45,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1187014733, now seen corresponding path program 1 times [2021-12-22 13:32:45,944 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:32:45,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977700634] [2021-12-22 13:32:45,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:32:45,945 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:32:45,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:32:46,133 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-22 13:32:46,133 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:32:46,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977700634] [2021-12-22 13:32:46,134 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977700634] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:32:46,134 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:32:46,134 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-22 13:32:46,134 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018865969] [2021-12-22 13:32:46,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:32:46,135 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-22 13:32:46,135 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:32:46,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-22 13:32:46,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2021-12-22 13:32:46,140 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 112 [2021-12-22 13:32:46,141 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 97 transitions, 281 flow. Second operand has 10 states, 10 states have (on average 90.4) internal successors, (904), 10 states have internal predecessors, (904), 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-22 13:32:46,141 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-22 13:32:46,141 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 112 [2021-12-22 13:32:46,141 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-22 13:32:46,462 INFO L129 PetriNetUnfolder]: 443/1241 cut-off events. [2021-12-22 13:32:46,463 INFO L130 PetriNetUnfolder]: For 3457/3505 co-relation queries the response was YES. [2021-12-22 13:32:46,467 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3493 conditions, 1241 events. 443/1241 cut-off events. For 3457/3505 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 8582 event pairs, 228 based on Foata normal form. 36/1182 useless extension candidates. Maximal degree in co-relation 3424. Up to 428 conditions per place. [2021-12-22 13:32:46,471 INFO L132 encePairwiseOnDemand]: 100/112 looper letters, 16 selfloop transitions, 10 changer transitions 34/139 dead transitions. [2021-12-22 13:32:46,472 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 139 transitions, 547 flow [2021-12-22 13:32:46,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-22 13:32:46,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2021-12-22 13:32:46,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1398 transitions. [2021-12-22 13:32:46,475 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8321428571428572 [2021-12-22 13:32:46,475 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1398 transitions. [2021-12-22 13:32:46,475 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1398 transitions. [2021-12-22 13:32:46,476 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 13:32:46,476 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1398 transitions. [2021-12-22 13:32:46,479 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 93.2) internal successors, (1398), 15 states have internal predecessors, (1398), 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-22 13:32:46,481 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 112.0) internal successors, (1792), 16 states have internal predecessors, (1792), 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-22 13:32:46,482 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 112.0) internal successors, (1792), 16 states have internal predecessors, (1792), 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-22 13:32:46,482 INFO L186 Difference]: Start difference. First operand has 125 places, 97 transitions, 281 flow. Second operand 15 states and 1398 transitions. [2021-12-22 13:32:46,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 139 transitions, 547 flow [2021-12-22 13:32:46,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 139 transitions, 502 flow, removed 21 selfloop flow, removed 7 redundant places. [2021-12-22 13:32:46,489 INFO L242 Difference]: Finished difference. Result has 137 places, 103 transitions, 350 flow [2021-12-22 13:32:46,489 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=350, PETRI_PLACES=137, PETRI_TRANSITIONS=103} [2021-12-22 13:32:46,491 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 20 predicate places. [2021-12-22 13:32:46,491 INFO L470 AbstractCegarLoop]: Abstraction has has 137 places, 103 transitions, 350 flow [2021-12-22 13:32:46,492 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 90.4) internal successors, (904), 10 states have internal predecessors, (904), 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-22 13:32:46,492 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-22 13:32:46,492 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 13:32:46,492 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-22 13:32:46,492 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-22 13:32:46,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:32:46,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1460208508, now seen corresponding path program 1 times [2021-12-22 13:32:46,493 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:32:46,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782970037] [2021-12-22 13:32:46,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:32:46,494 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:32:46,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:32:46,690 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-22 13:32:46,690 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:32:46,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782970037] [2021-12-22 13:32:46,690 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782970037] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:32:46,690 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:32:46,690 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-22 13:32:46,691 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727174931] [2021-12-22 13:32:46,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:32:46,692 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-22 13:32:46,692 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:32:46,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-22 13:32:46,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-12-22 13:32:46,694 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 112 [2021-12-22 13:32:46,694 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 103 transitions, 350 flow. Second operand has 10 states, 10 states have (on average 90.5) internal successors, (905), 10 states have internal predecessors, (905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:32:46,694 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-22 13:32:46,695 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 112 [2021-12-22 13:32:46,695 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-22 13:32:47,054 INFO L129 PetriNetUnfolder]: 371/1042 cut-off events. [2021-12-22 13:32:47,055 INFO L130 PetriNetUnfolder]: For 4485/4579 co-relation queries the response was YES. [2021-12-22 13:32:47,060 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3780 conditions, 1042 events. 371/1042 cut-off events. For 4485/4579 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 6636 event pairs, 119 based on Foata normal form. 29/992 useless extension candidates. Maximal degree in co-relation 3701. Up to 368 conditions per place. [2021-12-22 13:32:47,064 INFO L132 encePairwiseOnDemand]: 101/112 looper letters, 23 selfloop transitions, 9 changer transitions 29/140 dead transitions. [2021-12-22 13:32:47,064 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 140 transitions, 716 flow [2021-12-22 13:32:47,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-22 13:32:47,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-12-22 13:32:47,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1484 transitions. [2021-12-22 13:32:47,067 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.828125 [2021-12-22 13:32:47,067 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1484 transitions. [2021-12-22 13:32:47,067 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1484 transitions. [2021-12-22 13:32:47,068 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 13:32:47,068 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1484 transitions. [2021-12-22 13:32:47,070 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 92.75) internal successors, (1484), 16 states have internal predecessors, (1484), 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-22 13:32:47,072 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 112.0) internal successors, (1904), 17 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:32:47,073 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 112.0) internal successors, (1904), 17 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:32:47,073 INFO L186 Difference]: Start difference. First operand has 137 places, 103 transitions, 350 flow. Second operand 16 states and 1484 transitions. [2021-12-22 13:32:47,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 140 transitions, 716 flow [2021-12-22 13:32:47,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 140 transitions, 678 flow, removed 17 selfloop flow, removed 5 redundant places. [2021-12-22 13:32:47,079 INFO L242 Difference]: Finished difference. Result has 149 places, 106 transitions, 409 flow [2021-12-22 13:32:47,079 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=409, PETRI_PLACES=149, PETRI_TRANSITIONS=106} [2021-12-22 13:32:47,080 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 32 predicate places. [2021-12-22 13:32:47,080 INFO L470 AbstractCegarLoop]: Abstraction has has 149 places, 106 transitions, 409 flow [2021-12-22 13:32:47,081 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 90.5) internal successors, (905), 10 states have internal predecessors, (905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:32:47,081 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-22 13:32:47,081 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 13:32:47,081 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-22 13:32:47,081 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-22 13:32:47,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:32:47,082 INFO L85 PathProgramCache]: Analyzing trace with hash -1918933345, now seen corresponding path program 1 times [2021-12-22 13:32:47,082 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:32:47,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083320358] [2021-12-22 13:32:47,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:32:47,082 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:32:47,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:32:47,232 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-22 13:32:47,232 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:32:47,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083320358] [2021-12-22 13:32:47,232 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083320358] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:32:47,233 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:32:47,233 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-22 13:32:47,233 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813016026] [2021-12-22 13:32:47,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:32:47,233 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-22 13:32:47,234 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:32:47,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-22 13:32:47,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-12-22 13:32:47,235 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 112 [2021-12-22 13:32:47,236 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 106 transitions, 409 flow. Second operand has 10 states, 10 states have (on average 88.7) internal successors, (887), 10 states have internal predecessors, (887), 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-22 13:32:47,236 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-22 13:32:47,236 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 112 [2021-12-22 13:32:47,236 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-22 13:32:47,633 INFO L129 PetriNetUnfolder]: 410/1103 cut-off events. [2021-12-22 13:32:47,633 INFO L130 PetriNetUnfolder]: For 8171/8576 co-relation queries the response was YES. [2021-12-22 13:32:47,639 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4900 conditions, 1103 events. 410/1103 cut-off events. For 8171/8576 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 7159 event pairs, 129 based on Foata normal form. 40/1050 useless extension candidates. Maximal degree in co-relation 4809. Up to 387 conditions per place. [2021-12-22 13:32:47,643 INFO L132 encePairwiseOnDemand]: 100/112 looper letters, 28 selfloop transitions, 12 changer transitions 32/149 dead transitions. [2021-12-22 13:32:47,643 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 149 transitions, 937 flow [2021-12-22 13:32:47,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-22 13:32:47,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-12-22 13:32:47,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1457 transitions. [2021-12-22 13:32:47,646 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8130580357142857 [2021-12-22 13:32:47,646 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1457 transitions. [2021-12-22 13:32:47,647 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1457 transitions. [2021-12-22 13:32:47,647 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 13:32:47,647 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1457 transitions. [2021-12-22 13:32:47,650 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 91.0625) internal successors, (1457), 16 states have internal predecessors, (1457), 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-22 13:32:47,652 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 112.0) internal successors, (1904), 17 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:32:47,653 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 112.0) internal successors, (1904), 17 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:32:47,653 INFO L186 Difference]: Start difference. First operand has 149 places, 106 transitions, 409 flow. Second operand 16 states and 1457 transitions. [2021-12-22 13:32:47,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 149 transitions, 937 flow [2021-12-22 13:32:47,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 149 transitions, 855 flow, removed 34 selfloop flow, removed 13 redundant places. [2021-12-22 13:32:47,664 INFO L242 Difference]: Finished difference. Result has 154 places, 115 transitions, 516 flow [2021-12-22 13:32:47,665 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=366, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=516, PETRI_PLACES=154, PETRI_TRANSITIONS=115} [2021-12-22 13:32:47,665 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 37 predicate places. [2021-12-22 13:32:47,666 INFO L470 AbstractCegarLoop]: Abstraction has has 154 places, 115 transitions, 516 flow [2021-12-22 13:32:47,666 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 88.7) internal successors, (887), 10 states have internal predecessors, (887), 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-22 13:32:47,666 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-22 13:32:47,666 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 13:32:47,667 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-22 13:32:47,667 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-22 13:32:47,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:32:47,667 INFO L85 PathProgramCache]: Analyzing trace with hash 553289085, now seen corresponding path program 2 times [2021-12-22 13:32:47,668 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:32:47,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589430157] [2021-12-22 13:32:47,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:32:47,668 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:32:47,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:32:47,746 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-22 13:32:47,746 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:32:47,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589430157] [2021-12-22 13:32:47,747 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589430157] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:32:47,747 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:32:47,747 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-22 13:32:47,747 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963432857] [2021-12-22 13:32:47,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:32:47,748 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-22 13:32:47,748 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:32:47,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-22 13:32:47,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-22 13:32:47,749 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 112 [2021-12-22 13:32:47,750 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 115 transitions, 516 flow. Second operand has 6 states, 6 states have (on average 93.16666666666667) internal successors, (559), 6 states have internal predecessors, (559), 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-22 13:32:47,750 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-22 13:32:47,750 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 112 [2021-12-22 13:32:47,750 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-22 13:32:48,078 INFO L129 PetriNetUnfolder]: 520/1547 cut-off events. [2021-12-22 13:32:48,078 INFO L130 PetriNetUnfolder]: For 14860/15832 co-relation queries the response was YES. [2021-12-22 13:32:48,087 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7571 conditions, 1547 events. 520/1547 cut-off events. For 14860/15832 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 11391 event pairs, 134 based on Foata normal form. 46/1499 useless extension candidates. Maximal degree in co-relation 7482. Up to 317 conditions per place. [2021-12-22 13:32:48,094 INFO L132 encePairwiseOnDemand]: 106/112 looper letters, 41 selfloop transitions, 3 changer transitions 23/151 dead transitions. [2021-12-22 13:32:48,094 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 151 transitions, 1106 flow [2021-12-22 13:32:48,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-22 13:32:48,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-22 13:32:48,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 867 transitions. [2021-12-22 13:32:48,096 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8601190476190477 [2021-12-22 13:32:48,097 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 867 transitions. [2021-12-22 13:32:48,097 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 867 transitions. [2021-12-22 13:32:48,097 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 13:32:48,097 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 867 transitions. [2021-12-22 13:32:48,099 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 96.33333333333333) internal successors, (867), 9 states have internal predecessors, (867), 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-22 13:32:48,100 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 112.0) internal successors, (1120), 10 states have internal predecessors, (1120), 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-22 13:32:48,100 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 112.0) internal successors, (1120), 10 states have internal predecessors, (1120), 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-22 13:32:48,100 INFO L186 Difference]: Start difference. First operand has 154 places, 115 transitions, 516 flow. Second operand 9 states and 867 transitions. [2021-12-22 13:32:48,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 151 transitions, 1106 flow [2021-12-22 13:32:48,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 151 transitions, 966 flow, removed 68 selfloop flow, removed 8 redundant places. [2021-12-22 13:32:48,116 INFO L242 Difference]: Finished difference. Result has 152 places, 115 transitions, 495 flow [2021-12-22 13:32:48,116 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=470, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=495, PETRI_PLACES=152, PETRI_TRANSITIONS=115} [2021-12-22 13:32:48,118 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 35 predicate places. [2021-12-22 13:32:48,118 INFO L470 AbstractCegarLoop]: Abstraction has has 152 places, 115 transitions, 495 flow [2021-12-22 13:32:48,118 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 93.16666666666667) internal successors, (559), 6 states have internal predecessors, (559), 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-22 13:32:48,118 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-22 13:32:48,119 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 13:32:48,119 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-22 13:32:48,119 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-22 13:32:48,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:32:48,119 INFO L85 PathProgramCache]: Analyzing trace with hash 1997325553, now seen corresponding path program 1 times [2021-12-22 13:32:48,120 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:32:48,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925647574] [2021-12-22 13:32:48,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:32:48,120 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:32:48,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:32:48,314 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-22 13:32:48,314 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:32:48,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925647574] [2021-12-22 13:32:48,315 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925647574] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:32:48,315 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:32:48,315 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-12-22 13:32:48,315 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626904059] [2021-12-22 13:32:48,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:32:48,316 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-22 13:32:48,316 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:32:48,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-22 13:32:48,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2021-12-22 13:32:48,317 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 112 [2021-12-22 13:32:48,318 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 115 transitions, 495 flow. Second operand has 12 states, 12 states have (on average 88.41666666666667) internal successors, (1061), 12 states have internal predecessors, (1061), 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-22 13:32:48,318 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-22 13:32:48,318 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 112 [2021-12-22 13:32:48,318 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-22 13:32:48,644 INFO L129 PetriNetUnfolder]: 367/1195 cut-off events. [2021-12-22 13:32:48,644 INFO L130 PetriNetUnfolder]: For 10936/11329 co-relation queries the response was YES. [2021-12-22 13:32:48,649 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5648 conditions, 1195 events. 367/1195 cut-off events. For 10936/11329 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 8975 event pairs, 142 based on Foata normal form. 59/1145 useless extension candidates. Maximal degree in co-relation 5554. Up to 372 conditions per place. [2021-12-22 13:32:48,654 INFO L132 encePairwiseOnDemand]: 100/112 looper letters, 23 selfloop transitions, 15 changer transitions 22/137 dead transitions. [2021-12-22 13:32:48,654 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 137 transitions, 867 flow [2021-12-22 13:32:48,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-22 13:32:48,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2021-12-22 13:32:48,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1269 transitions. [2021-12-22 13:32:48,657 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8093112244897959 [2021-12-22 13:32:48,657 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1269 transitions. [2021-12-22 13:32:48,657 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1269 transitions. [2021-12-22 13:32:48,658 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 13:32:48,658 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1269 transitions. [2021-12-22 13:32:48,660 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 90.64285714285714) internal successors, (1269), 14 states have internal predecessors, (1269), 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-22 13:32:48,662 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 112.0) internal successors, (1680), 15 states have internal predecessors, (1680), 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-22 13:32:48,662 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 112.0) internal successors, (1680), 15 states have internal predecessors, (1680), 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-22 13:32:48,662 INFO L186 Difference]: Start difference. First operand has 152 places, 115 transitions, 495 flow. Second operand 14 states and 1269 transitions. [2021-12-22 13:32:48,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 137 transitions, 867 flow [2021-12-22 13:32:48,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 137 transitions, 830 flow, removed 17 selfloop flow, removed 7 redundant places. [2021-12-22 13:32:48,675 INFO L242 Difference]: Finished difference. Result has 158 places, 114 transitions, 515 flow [2021-12-22 13:32:48,675 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=474, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=515, PETRI_PLACES=158, PETRI_TRANSITIONS=114} [2021-12-22 13:32:48,676 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 41 predicate places. [2021-12-22 13:32:48,676 INFO L470 AbstractCegarLoop]: Abstraction has has 158 places, 114 transitions, 515 flow [2021-12-22 13:32:48,676 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 88.41666666666667) internal successors, (1061), 12 states have internal predecessors, (1061), 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-22 13:32:48,676 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-22 13:32:48,676 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 13:32:48,677 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-22 13:32:48,677 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-22 13:32:48,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:32:48,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1530405304, now seen corresponding path program 1 times [2021-12-22 13:32:48,677 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:32:48,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309797444] [2021-12-22 13:32:48,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:32:48,678 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:32:48,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:32:48,771 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-22 13:32:48,771 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:32:48,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309797444] [2021-12-22 13:32:48,771 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309797444] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:32:48,771 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:32:48,771 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-22 13:32:48,773 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079154588] [2021-12-22 13:32:48,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:32:48,775 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-22 13:32:48,775 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:32:48,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-22 13:32:48,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-22 13:32:48,776 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 112 [2021-12-22 13:32:48,777 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 114 transitions, 515 flow. Second operand has 8 states, 8 states have (on average 91.875) internal successors, (735), 8 states have internal predecessors, (735), 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-22 13:32:48,777 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-22 13:32:48,777 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 112 [2021-12-22 13:32:48,777 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-22 13:32:49,084 INFO L129 PetriNetUnfolder]: 327/1086 cut-off events. [2021-12-22 13:32:49,084 INFO L130 PetriNetUnfolder]: For 11546/11765 co-relation queries the response was YES. [2021-12-22 13:32:49,089 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5490 conditions, 1086 events. 327/1086 cut-off events. For 11546/11765 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 7710 event pairs, 114 based on Foata normal form. 40/1025 useless extension candidates. Maximal degree in co-relation 5394. Up to 385 conditions per place. [2021-12-22 13:32:49,095 INFO L132 encePairwiseOnDemand]: 102/112 looper letters, 30 selfloop transitions, 18 changer transitions 19/147 dead transitions. [2021-12-22 13:32:49,095 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 147 transitions, 1085 flow [2021-12-22 13:32:49,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-22 13:32:49,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-12-22 13:32:49,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1041 transitions. [2021-12-22 13:32:49,097 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8449675324675324 [2021-12-22 13:32:49,097 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1041 transitions. [2021-12-22 13:32:49,097 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1041 transitions. [2021-12-22 13:32:49,098 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 13:32:49,098 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1041 transitions. [2021-12-22 13:32:49,099 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 94.63636363636364) internal successors, (1041), 11 states have internal predecessors, (1041), 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-22 13:32:49,101 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 112.0) internal successors, (1344), 12 states have internal predecessors, (1344), 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-22 13:32:49,101 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 112.0) internal successors, (1344), 12 states have internal predecessors, (1344), 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-22 13:32:49,101 INFO L186 Difference]: Start difference. First operand has 158 places, 114 transitions, 515 flow. Second operand 11 states and 1041 transitions. [2021-12-22 13:32:49,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 147 transitions, 1085 flow [2021-12-22 13:32:49,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 147 transitions, 943 flow, removed 60 selfloop flow, removed 15 redundant places. [2021-12-22 13:32:49,114 INFO L242 Difference]: Finished difference. Result has 155 places, 122 transitions, 635 flow [2021-12-22 13:32:49,114 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=463, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=635, PETRI_PLACES=155, PETRI_TRANSITIONS=122} [2021-12-22 13:32:49,114 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 38 predicate places. [2021-12-22 13:32:49,115 INFO L470 AbstractCegarLoop]: Abstraction has has 155 places, 122 transitions, 635 flow [2021-12-22 13:32:49,115 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 91.875) internal successors, (735), 8 states have internal predecessors, (735), 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-22 13:32:49,115 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-22 13:32:49,115 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 13:32:49,115 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-22 13:32:49,116 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-22 13:32:49,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:32:49,116 INFO L85 PathProgramCache]: Analyzing trace with hash -126403070, now seen corresponding path program 2 times [2021-12-22 13:32:49,116 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:32:49,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209706172] [2021-12-22 13:32:49,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:32:49,117 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:32:49,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:32:49,243 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-22 13:32:49,243 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:32:49,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209706172] [2021-12-22 13:32:49,243 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209706172] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:32:49,243 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:32:49,243 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-22 13:32:49,244 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600943231] [2021-12-22 13:32:49,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:32:49,244 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-22 13:32:49,244 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:32:49,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-22 13:32:49,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-12-22 13:32:49,245 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 112 [2021-12-22 13:32:49,246 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 122 transitions, 635 flow. Second operand has 11 states, 11 states have (on average 89.54545454545455) internal successors, (985), 11 states have internal predecessors, (985), 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-22 13:32:49,246 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-22 13:32:49,246 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 112 [2021-12-22 13:32:49,246 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-22 13:32:49,598 INFO L129 PetriNetUnfolder]: 352/1135 cut-off events. [2021-12-22 13:32:49,598 INFO L130 PetriNetUnfolder]: For 10682/11596 co-relation queries the response was YES. [2021-12-22 13:32:49,605 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5741 conditions, 1135 events. 352/1135 cut-off events. For 10682/11596 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 8247 event pairs, 112 based on Foata normal form. 56/1079 useless extension candidates. Maximal degree in co-relation 5648. Up to 363 conditions per place. [2021-12-22 13:32:49,610 INFO L132 encePairwiseOnDemand]: 100/112 looper letters, 31 selfloop transitions, 23 changer transitions 19/151 dead transitions. [2021-12-22 13:32:49,610 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 151 transitions, 1145 flow [2021-12-22 13:32:49,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-22 13:32:49,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2021-12-22 13:32:49,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1289 transitions. [2021-12-22 13:32:49,612 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8220663265306123 [2021-12-22 13:32:49,612 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1289 transitions. [2021-12-22 13:32:49,612 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1289 transitions. [2021-12-22 13:32:49,612 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 13:32:49,612 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1289 transitions. [2021-12-22 13:32:49,614 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 92.07142857142857) internal successors, (1289), 14 states have internal predecessors, (1289), 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-22 13:32:49,616 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 112.0) internal successors, (1680), 15 states have internal predecessors, (1680), 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-22 13:32:49,616 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 112.0) internal successors, (1680), 15 states have internal predecessors, (1680), 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-22 13:32:49,616 INFO L186 Difference]: Start difference. First operand has 155 places, 122 transitions, 635 flow. Second operand 14 states and 1289 transitions. [2021-12-22 13:32:49,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 151 transitions, 1145 flow [2021-12-22 13:32:49,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 151 transitions, 1072 flow, removed 36 selfloop flow, removed 7 redundant places. [2021-12-22 13:32:49,632 INFO L242 Difference]: Finished difference. Result has 162 places, 124 transitions, 700 flow [2021-12-22 13:32:49,633 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=590, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=700, PETRI_PLACES=162, PETRI_TRANSITIONS=124} [2021-12-22 13:32:49,633 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 45 predicate places. [2021-12-22 13:32:49,633 INFO L470 AbstractCegarLoop]: Abstraction has has 162 places, 124 transitions, 700 flow [2021-12-22 13:32:49,633 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 89.54545454545455) internal successors, (985), 11 states have internal predecessors, (985), 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-22 13:32:49,634 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-22 13:32:49,634 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 13:32:49,634 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-22 13:32:49,634 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-22 13:32:49,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:32:49,634 INFO L85 PathProgramCache]: Analyzing trace with hash -1835443644, now seen corresponding path program 3 times [2021-12-22 13:32:49,634 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:32:49,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948738493] [2021-12-22 13:32:49,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:32:49,634 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:32:49,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:32:49,780 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-22 13:32:49,780 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:32:49,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948738493] [2021-12-22 13:32:49,781 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948738493] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:32:49,781 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:32:49,781 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-22 13:32:49,781 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292842168] [2021-12-22 13:32:49,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:32:49,781 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-22 13:32:49,781 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:32:49,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-22 13:32:49,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-12-22 13:32:49,782 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 112 [2021-12-22 13:32:49,783 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 124 transitions, 700 flow. Second operand has 9 states, 9 states have (on average 90.77777777777777) internal successors, (817), 9 states have internal predecessors, (817), 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-22 13:32:49,783 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-22 13:32:49,783 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 112 [2021-12-22 13:32:49,783 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-22 13:32:50,149 INFO L129 PetriNetUnfolder]: 269/978 cut-off events. [2021-12-22 13:32:50,150 INFO L130 PetriNetUnfolder]: For 12108/12813 co-relation queries the response was YES. [2021-12-22 13:32:50,156 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5352 conditions, 978 events. 269/978 cut-off events. For 12108/12813 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 7061 event pairs, 74 based on Foata normal form. 52/940 useless extension candidates. Maximal degree in co-relation 5256. Up to 240 conditions per place. [2021-12-22 13:32:50,162 INFO L132 encePairwiseOnDemand]: 101/112 looper letters, 29 selfloop transitions, 24 changer transitions 20/152 dead transitions. [2021-12-22 13:32:50,162 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 152 transitions, 1310 flow [2021-12-22 13:32:50,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-22 13:32:50,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2021-12-22 13:32:50,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1298 transitions. [2021-12-22 13:32:50,164 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8278061224489796 [2021-12-22 13:32:50,164 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1298 transitions. [2021-12-22 13:32:50,164 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1298 transitions. [2021-12-22 13:32:50,164 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 13:32:50,164 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1298 transitions. [2021-12-22 13:32:50,167 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 92.71428571428571) internal successors, (1298), 14 states have internal predecessors, (1298), 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-22 13:32:50,169 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 112.0) internal successors, (1680), 15 states have internal predecessors, (1680), 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-22 13:32:50,169 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 112.0) internal successors, (1680), 15 states have internal predecessors, (1680), 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-22 13:32:50,169 INFO L186 Difference]: Start difference. First operand has 162 places, 124 transitions, 700 flow. Second operand 14 states and 1298 transitions. [2021-12-22 13:32:50,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 152 transitions, 1310 flow [2021-12-22 13:32:50,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 152 transitions, 1230 flow, removed 25 selfloop flow, removed 9 redundant places. [2021-12-22 13:32:50,193 INFO L242 Difference]: Finished difference. Result has 167 places, 124 transitions, 735 flow [2021-12-22 13:32:50,194 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=636, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=735, PETRI_PLACES=167, PETRI_TRANSITIONS=124} [2021-12-22 13:32:50,194 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 50 predicate places. [2021-12-22 13:32:50,194 INFO L470 AbstractCegarLoop]: Abstraction has has 167 places, 124 transitions, 735 flow [2021-12-22 13:32:50,195 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 90.77777777777777) internal successors, (817), 9 states have internal predecessors, (817), 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-22 13:32:50,195 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-22 13:32:50,195 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 13:32:50,195 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-22 13:32:50,195 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-22 13:32:50,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:32:50,196 INFO L85 PathProgramCache]: Analyzing trace with hash 410291034, now seen corresponding path program 1 times [2021-12-22 13:32:50,196 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:32:50,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932508378] [2021-12-22 13:32:50,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:32:50,196 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:32:50,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:32:50,359 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-22 13:32:50,359 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:32:50,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932508378] [2021-12-22 13:32:50,359 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932508378] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:32:50,359 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:32:50,359 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-12-22 13:32:50,359 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268251970] [2021-12-22 13:32:50,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:32:50,360 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-22 13:32:50,360 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:32:50,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-22 13:32:50,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2021-12-22 13:32:50,361 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 112 [2021-12-22 13:32:50,361 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 124 transitions, 735 flow. Second operand has 12 states, 12 states have (on average 87.66666666666667) internal successors, (1052), 12 states have internal predecessors, (1052), 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-22 13:32:50,362 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-22 13:32:50,362 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 112 [2021-12-22 13:32:50,362 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-22 13:32:50,665 INFO L129 PetriNetUnfolder]: 198/804 cut-off events. [2021-12-22 13:32:50,665 INFO L130 PetriNetUnfolder]: For 11824/12532 co-relation queries the response was YES. [2021-12-22 13:32:50,670 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4518 conditions, 804 events. 198/804 cut-off events. For 11824/12532 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 5486 event pairs, 75 based on Foata normal form. 29/757 useless extension candidates. Maximal degree in co-relation 4415. Up to 300 conditions per place. [2021-12-22 13:32:50,674 INFO L132 encePairwiseOnDemand]: 100/112 looper letters, 40 selfloop transitions, 13 changer transitions 10/139 dead transitions. [2021-12-22 13:32:50,674 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 139 transitions, 1123 flow [2021-12-22 13:32:50,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-22 13:32:50,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-12-22 13:32:50,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1161 transitions. [2021-12-22 13:32:50,676 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7973901098901099 [2021-12-22 13:32:50,677 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1161 transitions. [2021-12-22 13:32:50,677 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1161 transitions. [2021-12-22 13:32:50,677 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 13:32:50,677 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1161 transitions. [2021-12-22 13:32:50,678 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 89.3076923076923) internal successors, (1161), 13 states have internal predecessors, (1161), 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-22 13:32:50,680 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 112.0) internal successors, (1568), 14 states have internal predecessors, (1568), 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-22 13:32:50,680 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 112.0) internal successors, (1568), 14 states have internal predecessors, (1568), 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-22 13:32:50,680 INFO L186 Difference]: Start difference. First operand has 167 places, 124 transitions, 735 flow. Second operand 13 states and 1161 transitions. [2021-12-22 13:32:50,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 139 transitions, 1123 flow [2021-12-22 13:32:50,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 139 transitions, 1012 flow, removed 40 selfloop flow, removed 12 redundant places. [2021-12-22 13:32:50,703 INFO L242 Difference]: Finished difference. Result has 168 places, 125 transitions, 747 flow [2021-12-22 13:32:50,703 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=674, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=747, PETRI_PLACES=168, PETRI_TRANSITIONS=125} [2021-12-22 13:32:50,703 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 51 predicate places. [2021-12-22 13:32:50,703 INFO L470 AbstractCegarLoop]: Abstraction has has 168 places, 125 transitions, 747 flow [2021-12-22 13:32:50,704 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 87.66666666666667) internal successors, (1052), 12 states have internal predecessors, (1052), 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-22 13:32:50,704 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-22 13:32:50,704 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 13:32:50,704 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-22 13:32:50,705 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-22 13:32:50,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:32:50,705 INFO L85 PathProgramCache]: Analyzing trace with hash -1381626304, now seen corresponding path program 2 times [2021-12-22 13:32:50,705 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:32:50,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675967221] [2021-12-22 13:32:50,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:32:50,705 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:32:50,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:32:50,932 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-22 13:32:50,932 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:32:50,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675967221] [2021-12-22 13:32:50,932 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675967221] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:32:50,933 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:32:50,933 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-12-22 13:32:50,933 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714647310] [2021-12-22 13:32:50,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:32:50,934 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-22 13:32:50,934 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:32:50,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-22 13:32:50,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2021-12-22 13:32:50,935 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 112 [2021-12-22 13:32:50,936 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 125 transitions, 747 flow. Second operand has 13 states, 13 states have (on average 87.53846153846153) internal successors, (1138), 13 states have internal predecessors, (1138), 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-22 13:32:50,936 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-22 13:32:50,936 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 112 [2021-12-22 13:32:50,936 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-22 13:32:51,192 INFO L129 PetriNetUnfolder]: 204/830 cut-off events. [2021-12-22 13:32:51,192 INFO L130 PetriNetUnfolder]: For 11863/12149 co-relation queries the response was YES. [2021-12-22 13:32:51,197 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4615 conditions, 830 events. 204/830 cut-off events. For 11863/12149 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 5541 event pairs, 73 based on Foata normal form. 25/777 useless extension candidates. Maximal degree in co-relation 4512. Up to 309 conditions per place. [2021-12-22 13:32:51,204 INFO L132 encePairwiseOnDemand]: 100/112 looper letters, 43 selfloop transitions, 15 changer transitions 7/141 dead transitions. [2021-12-22 13:32:51,204 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 141 transitions, 1166 flow [2021-12-22 13:32:51,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-22 13:32:51,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-12-22 13:32:51,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 984 transitions. [2021-12-22 13:32:51,206 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7987012987012987 [2021-12-22 13:32:51,206 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 984 transitions. [2021-12-22 13:32:51,206 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 984 transitions. [2021-12-22 13:32:51,206 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 13:32:51,206 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 984 transitions. [2021-12-22 13:32:51,208 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 89.45454545454545) internal successors, (984), 11 states have internal predecessors, (984), 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-22 13:32:51,209 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 112.0) internal successors, (1344), 12 states have internal predecessors, (1344), 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-22 13:32:51,209 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 112.0) internal successors, (1344), 12 states have internal predecessors, (1344), 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-22 13:32:51,209 INFO L186 Difference]: Start difference. First operand has 168 places, 125 transitions, 747 flow. Second operand 11 states and 984 transitions. [2021-12-22 13:32:51,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 141 transitions, 1166 flow [2021-12-22 13:32:51,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 141 transitions, 1063 flow, removed 39 selfloop flow, removed 11 redundant places. [2021-12-22 13:32:51,227 INFO L242 Difference]: Finished difference. Result has 165 places, 130 transitions, 815 flow [2021-12-22 13:32:51,227 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=692, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=815, PETRI_PLACES=165, PETRI_TRANSITIONS=130} [2021-12-22 13:32:51,228 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 48 predicate places. [2021-12-22 13:32:51,228 INFO L470 AbstractCegarLoop]: Abstraction has has 165 places, 130 transitions, 815 flow [2021-12-22 13:32:51,228 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 87.53846153846153) internal successors, (1138), 13 states have internal predecessors, (1138), 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-22 13:32:51,228 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-22 13:32:51,228 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 13:32:51,229 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-22 13:32:51,229 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-22 13:32:51,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:32:51,229 INFO L85 PathProgramCache]: Analyzing trace with hash -767177424, now seen corresponding path program 3 times [2021-12-22 13:32:51,229 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:32:51,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538449678] [2021-12-22 13:32:51,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:32:51,230 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:32:51,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:32:51,349 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-22 13:32:51,349 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:32:51,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538449678] [2021-12-22 13:32:51,349 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538449678] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:32:51,349 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:32:51,349 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-22 13:32:51,350 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756332736] [2021-12-22 13:32:51,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:32:51,350 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-22 13:32:51,350 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:32:51,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-22 13:32:51,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-12-22 13:32:51,351 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 112 [2021-12-22 13:32:51,351 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 130 transitions, 815 flow. Second operand has 11 states, 11 states have (on average 89.63636363636364) internal successors, (986), 11 states have internal predecessors, (986), 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-22 13:32:51,352 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-22 13:32:51,352 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 112 [2021-12-22 13:32:51,352 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-22 13:32:51,629 INFO L129 PetriNetUnfolder]: 162/750 cut-off events. [2021-12-22 13:32:51,630 INFO L130 PetriNetUnfolder]: For 7986/9059 co-relation queries the response was YES. [2021-12-22 13:32:51,633 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3830 conditions, 750 events. 162/750 cut-off events. For 7986/9059 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 5117 event pairs, 51 based on Foata normal form. 32/714 useless extension candidates. Maximal degree in co-relation 3730. Up to 158 conditions per place. [2021-12-22 13:32:51,635 INFO L132 encePairwiseOnDemand]: 103/112 looper letters, 44 selfloop transitions, 14 changer transitions 11/147 dead transitions. [2021-12-22 13:32:51,635 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 147 transitions, 1211 flow [2021-12-22 13:32:51,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-22 13:32:51,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-12-22 13:32:51,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1097 transitions. [2021-12-22 13:32:51,637 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8162202380952381 [2021-12-22 13:32:51,637 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1097 transitions. [2021-12-22 13:32:51,637 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1097 transitions. [2021-12-22 13:32:51,637 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 13:32:51,637 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1097 transitions. [2021-12-22 13:32:51,639 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 91.41666666666667) internal successors, (1097), 12 states have internal predecessors, (1097), 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-22 13:32:51,640 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 112.0) internal successors, (1456), 13 states have internal predecessors, (1456), 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-22 13:32:51,640 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 112.0) internal successors, (1456), 13 states have internal predecessors, (1456), 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-22 13:32:51,641 INFO L186 Difference]: Start difference. First operand has 165 places, 130 transitions, 815 flow. Second operand 12 states and 1097 transitions. [2021-12-22 13:32:51,641 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 147 transitions, 1211 flow [2021-12-22 13:32:51,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 147 transitions, 1120 flow, removed 34 selfloop flow, removed 9 redundant places. [2021-12-22 13:32:51,655 INFO L242 Difference]: Finished difference. Result has 171 places, 129 transitions, 775 flow [2021-12-22 13:32:51,656 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=750, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=775, PETRI_PLACES=171, PETRI_TRANSITIONS=129} [2021-12-22 13:32:51,656 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 54 predicate places. [2021-12-22 13:32:51,656 INFO L470 AbstractCegarLoop]: Abstraction has has 171 places, 129 transitions, 775 flow [2021-12-22 13:32:51,657 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 89.63636363636364) internal successors, (986), 11 states have internal predecessors, (986), 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-22 13:32:51,657 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-22 13:32:51,657 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 13:32:51,657 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-22 13:32:51,657 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-22 13:32:51,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:32:51,658 INFO L85 PathProgramCache]: Analyzing trace with hash -260464144, now seen corresponding path program 1 times [2021-12-22 13:32:51,658 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:32:51,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104189398] [2021-12-22 13:32:51,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:32:51,658 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:32:51,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:32:51,717 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-22 13:32:51,717 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:32:51,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104189398] [2021-12-22 13:32:51,718 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104189398] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:32:51,718 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:32:51,718 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-22 13:32:51,718 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013152833] [2021-12-22 13:32:51,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:32:51,718 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-22 13:32:51,718 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:32:51,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-22 13:32:51,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-22 13:32:51,719 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 112 [2021-12-22 13:32:51,720 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 129 transitions, 775 flow. Second operand has 6 states, 6 states have (on average 91.33333333333333) internal successors, (548), 6 states have internal predecessors, (548), 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-22 13:32:51,720 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-22 13:32:51,720 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 112 [2021-12-22 13:32:51,720 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-22 13:32:52,489 INFO L129 PetriNetUnfolder]: 3092/6011 cut-off events. [2021-12-22 13:32:52,490 INFO L130 PetriNetUnfolder]: For 47549/48135 co-relation queries the response was YES. [2021-12-22 13:32:52,519 INFO L84 FinitePrefix]: Finished finitePrefix Result has 23600 conditions, 6011 events. 3092/6011 cut-off events. For 47549/48135 co-relation queries the response was YES. Maximal size of possible extension queue 560. Compared 49224 event pairs, 121 based on Foata normal form. 457/6072 useless extension candidates. Maximal degree in co-relation 23502. Up to 2112 conditions per place. [2021-12-22 13:32:52,528 INFO L132 encePairwiseOnDemand]: 102/112 looper letters, 54 selfloop transitions, 6 changer transitions 118/259 dead transitions. [2021-12-22 13:32:52,528 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 259 transitions, 2539 flow [2021-12-22 13:32:52,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-22 13:32:52,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-12-22 13:32:52,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 964 transitions. [2021-12-22 13:32:52,530 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8607142857142858 [2021-12-22 13:32:52,530 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 964 transitions. [2021-12-22 13:32:52,530 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 964 transitions. [2021-12-22 13:32:52,530 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 13:32:52,531 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 964 transitions. [2021-12-22 13:32:52,532 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 96.4) internal successors, (964), 10 states have internal predecessors, (964), 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-22 13:32:52,533 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 112.0) internal successors, (1232), 11 states have internal predecessors, (1232), 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-22 13:32:52,533 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 112.0) internal successors, (1232), 11 states have internal predecessors, (1232), 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-22 13:32:52,534 INFO L186 Difference]: Start difference. First operand has 171 places, 129 transitions, 775 flow. Second operand 10 states and 964 transitions. [2021-12-22 13:32:52,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 259 transitions, 2539 flow [2021-12-22 13:32:52,589 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 259 transitions, 2290 flow, removed 73 selfloop flow, removed 14 redundant places. [2021-12-22 13:32:52,591 INFO L242 Difference]: Finished difference. Result has 166 places, 121 transitions, 652 flow [2021-12-22 13:32:52,592 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=701, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=652, PETRI_PLACES=166, PETRI_TRANSITIONS=121} [2021-12-22 13:32:52,592 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 49 predicate places. [2021-12-22 13:32:52,592 INFO L470 AbstractCegarLoop]: Abstraction has has 166 places, 121 transitions, 652 flow [2021-12-22 13:32:52,592 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 91.33333333333333) internal successors, (548), 6 states have internal predecessors, (548), 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-22 13:32:52,593 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-22 13:32:52,593 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 13:32:52,593 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-22 13:32:52,593 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-22 13:32:52,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:32:52,593 INFO L85 PathProgramCache]: Analyzing trace with hash -607762605, now seen corresponding path program 1 times [2021-12-22 13:32:52,594 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:32:52,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420190207] [2021-12-22 13:32:52,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:32:52,594 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:32:52,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:32:52,710 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-22 13:32:52,711 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:32:52,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420190207] [2021-12-22 13:32:52,711 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420190207] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:32:52,711 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:32:52,711 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-22 13:32:52,711 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768663702] [2021-12-22 13:32:52,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:32:52,712 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-22 13:32:52,712 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:32:52,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-22 13:32:52,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-22 13:32:52,713 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 112 [2021-12-22 13:32:52,713 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 121 transitions, 652 flow. Second operand has 7 states, 7 states have (on average 91.14285714285714) internal successors, (638), 7 states have internal predecessors, (638), 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-22 13:32:52,713 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-22 13:32:52,714 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 112 [2021-12-22 13:32:52,714 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-22 13:32:53,169 INFO L129 PetriNetUnfolder]: 1184/2851 cut-off events. [2021-12-22 13:32:53,169 INFO L130 PetriNetUnfolder]: For 17044/17320 co-relation queries the response was YES. [2021-12-22 13:32:53,182 INFO L84 FinitePrefix]: Finished finitePrefix Result has 12768 conditions, 2851 events. 1184/2851 cut-off events. For 17044/17320 co-relation queries the response was YES. Maximal size of possible extension queue 259. Compared 23252 event pairs, 11 based on Foata normal form. 298/3077 useless extension candidates. Maximal degree in co-relation 12674. Up to 965 conditions per place. [2021-12-22 13:32:53,188 INFO L132 encePairwiseOnDemand]: 103/112 looper letters, 42 selfloop transitions, 9 changer transitions 80/210 dead transitions. [2021-12-22 13:32:53,188 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 210 transitions, 1863 flow [2021-12-22 13:32:53,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-22 13:32:53,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-12-22 13:32:53,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 962 transitions. [2021-12-22 13:32:53,190 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8589285714285714 [2021-12-22 13:32:53,190 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 962 transitions. [2021-12-22 13:32:53,190 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 962 transitions. [2021-12-22 13:32:53,190 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 13:32:53,191 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 962 transitions. [2021-12-22 13:32:53,192 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 96.2) internal successors, (962), 10 states have internal predecessors, (962), 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-22 13:32:53,194 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 112.0) internal successors, (1232), 11 states have internal predecessors, (1232), 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-22 13:32:53,195 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 112.0) internal successors, (1232), 11 states have internal predecessors, (1232), 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-22 13:32:53,195 INFO L186 Difference]: Start difference. First operand has 166 places, 121 transitions, 652 flow. Second operand 10 states and 962 transitions. [2021-12-22 13:32:53,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 210 transitions, 1863 flow [2021-12-22 13:32:53,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 210 transitions, 1753 flow, removed 31 selfloop flow, removed 12 redundant places. [2021-12-22 13:32:53,215 INFO L242 Difference]: Finished difference. Result has 163 places, 114 transitions, 601 flow [2021-12-22 13:32:53,215 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=556, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=601, PETRI_PLACES=163, PETRI_TRANSITIONS=114} [2021-12-22 13:32:53,215 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 46 predicate places. [2021-12-22 13:32:53,216 INFO L470 AbstractCegarLoop]: Abstraction has has 163 places, 114 transitions, 601 flow [2021-12-22 13:32:53,216 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 91.14285714285714) internal successors, (638), 7 states have internal predecessors, (638), 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-22 13:32:53,216 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-22 13:32:53,216 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 13:32:53,216 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-22 13:32:53,216 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-22 13:32:53,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:32:53,217 INFO L85 PathProgramCache]: Analyzing trace with hash 547691252, now seen corresponding path program 1 times [2021-12-22 13:32:53,217 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:32:53,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019969021] [2021-12-22 13:32:53,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:32:53,217 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:32:53,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:32:53,294 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-22 13:32:53,294 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:32:53,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019969021] [2021-12-22 13:32:53,294 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019969021] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:32:53,294 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:32:53,294 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-22 13:32:53,295 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477716853] [2021-12-22 13:32:53,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:32:53,295 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-22 13:32:53,295 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:32:53,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-22 13:32:53,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-22 13:32:53,296 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 112 [2021-12-22 13:32:53,297 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 114 transitions, 601 flow. Second operand has 8 states, 8 states have (on average 91.0) internal successors, (728), 8 states have internal predecessors, (728), 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-22 13:32:53,297 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-22 13:32:53,297 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 112 [2021-12-22 13:32:53,297 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-22 13:32:53,521 INFO L129 PetriNetUnfolder]: 188/768 cut-off events. [2021-12-22 13:32:53,522 INFO L130 PetriNetUnfolder]: For 4050/4145 co-relation queries the response was YES. [2021-12-22 13:32:53,525 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3216 conditions, 768 events. 188/768 cut-off events. For 4050/4145 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 5127 event pairs, 3 based on Foata normal form. 67/816 useless extension candidates. Maximal degree in co-relation 3124. Up to 213 conditions per place. [2021-12-22 13:32:53,526 INFO L132 encePairwiseOnDemand]: 103/112 looper letters, 20 selfloop transitions, 12 changer transitions 56/162 dead transitions. [2021-12-22 13:32:53,526 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 162 transitions, 1281 flow [2021-12-22 13:32:53,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-22 13:32:53,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-12-22 13:32:53,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1033 transitions. [2021-12-22 13:32:53,528 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.838474025974026 [2021-12-22 13:32:53,528 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1033 transitions. [2021-12-22 13:32:53,528 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1033 transitions. [2021-12-22 13:32:53,529 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 13:32:53,529 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1033 transitions. [2021-12-22 13:32:53,530 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 93.9090909090909) internal successors, (1033), 11 states have internal predecessors, (1033), 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-22 13:32:53,532 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 112.0) internal successors, (1344), 12 states have internal predecessors, (1344), 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-22 13:32:53,532 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 112.0) internal successors, (1344), 12 states have internal predecessors, (1344), 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-22 13:32:53,533 INFO L186 Difference]: Start difference. First operand has 163 places, 114 transitions, 601 flow. Second operand 11 states and 1033 transitions. [2021-12-22 13:32:53,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 162 transitions, 1281 flow [2021-12-22 13:32:53,541 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 162 transitions, 1008 flow, removed 99 selfloop flow, removed 24 redundant places. [2021-12-22 13:32:53,543 INFO L242 Difference]: Finished difference. Result has 151 places, 100 transitions, 385 flow [2021-12-22 13:32:53,543 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=448, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=385, PETRI_PLACES=151, PETRI_TRANSITIONS=100} [2021-12-22 13:32:53,543 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 34 predicate places. [2021-12-22 13:32:53,544 INFO L470 AbstractCegarLoop]: Abstraction has has 151 places, 100 transitions, 385 flow [2021-12-22 13:32:53,544 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 91.0) internal successors, (728), 8 states have internal predecessors, (728), 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-22 13:32:53,544 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-22 13:32:53,544 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 13:32:53,544 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-22 13:32:53,544 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-22 13:32:53,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:32:53,545 INFO L85 PathProgramCache]: Analyzing trace with hash 364523768, now seen corresponding path program 1 times [2021-12-22 13:32:53,545 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:32:53,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612327643] [2021-12-22 13:32:53,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:32:53,545 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:32:53,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 13:32:53,582 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 13:32:53,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 13:32:53,649 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-22 13:32:53,649 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-22 13:32:53,651 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2021-12-22 13:32:53,652 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2021-12-22 13:32:53,652 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (3 of 6 remaining) [2021-12-22 13:32:53,652 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (2 of 6 remaining) [2021-12-22 13:32:53,652 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION (1 of 6 remaining) [2021-12-22 13:32:53,652 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2021-12-22 13:32:53,653 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-12-22 13:32:53,655 INFO L732 BasicCegarLoop]: Path program histogram: [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 13:32:53,659 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-12-22 13:32:53,659 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-22 13:32:53,739 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.12 01:32:53 BasicIcfg [2021-12-22 13:32:53,739 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-22 13:32:53,740 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-22 13:32:53,740 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-22 13:32:53,740 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-22 13:32:53,740 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 01:32:43" (3/4) ... [2021-12-22 13:32:53,742 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-22 13:32:53,837 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-22 13:32:53,838 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-22 13:32:53,838 INFO L158 Benchmark]: Toolchain (without parser) took 11246.87ms. Allocated memory was 81.8MB in the beginning and 635.4MB in the end (delta: 553.6MB). Free memory was 42.3MB in the beginning and 414.5MB in the end (delta: -372.2MB). Peak memory consumption was 180.1MB. Max. memory is 16.1GB. [2021-12-22 13:32:53,838 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 81.8MB. Free memory is still 60.5MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-22 13:32:53,839 INFO L158 Benchmark]: CACSL2BoogieTranslator took 351.53ms. Allocated memory was 81.8MB in the beginning and 98.6MB in the end (delta: 16.8MB). Free memory was 42.1MB in the beginning and 59.2MB in the end (delta: -17.1MB). Peak memory consumption was 6.5MB. Max. memory is 16.1GB. [2021-12-22 13:32:53,839 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.95ms. Allocated memory is still 98.6MB. Free memory was 59.2MB in the beginning and 56.3MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-22 13:32:53,839 INFO L158 Benchmark]: Boogie Preprocessor took 21.67ms. Allocated memory is still 98.6MB. Free memory was 56.3MB in the beginning and 54.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-22 13:32:53,839 INFO L158 Benchmark]: RCFGBuilder took 831.62ms. Allocated memory is still 98.6MB. Free memory was 54.2MB in the beginning and 53.6MB in the end (delta: 633.8kB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2021-12-22 13:32:53,840 INFO L158 Benchmark]: TraceAbstraction took 9875.79ms. Allocated memory was 98.6MB in the beginning and 635.4MB in the end (delta: 536.9MB). Free memory was 53.1MB in the beginning and 440.7MB in the end (delta: -387.6MB). Peak memory consumption was 150.3MB. Max. memory is 16.1GB. [2021-12-22 13:32:53,840 INFO L158 Benchmark]: Witness Printer took 97.84ms. Allocated memory is still 635.4MB. Free memory was 439.7MB in the beginning and 414.5MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2021-12-22 13:32:53,841 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 81.8MB. Free memory is still 60.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 351.53ms. Allocated memory was 81.8MB in the beginning and 98.6MB in the end (delta: 16.8MB). Free memory was 42.1MB in the beginning and 59.2MB in the end (delta: -17.1MB). Peak memory consumption was 6.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.95ms. Allocated memory is still 98.6MB. Free memory was 59.2MB in the beginning and 56.3MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 21.67ms. Allocated memory is still 98.6MB. Free memory was 56.3MB in the beginning and 54.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 831.62ms. Allocated memory is still 98.6MB. Free memory was 54.2MB in the beginning and 53.6MB in the end (delta: 633.8kB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 9875.79ms. Allocated memory was 98.6MB in the beginning and 635.4MB in the end (delta: 536.9MB). Free memory was 53.1MB in the beginning and 440.7MB in the end (delta: -387.6MB). Peak memory consumption was 150.3MB. Max. memory is 16.1GB. * Witness Printer took 97.84ms. Allocated memory is still 635.4MB. Free memory was 439.7MB in the beginning and 414.5MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. 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: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L710] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0] [L711] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0] [L713] 0 int x = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L715] 0 int y = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L716] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L717] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L718] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L719] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L720] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L721] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L722] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0] [L723] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L724] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L725] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L726] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L727] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L728] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L729] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L730] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L731] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L733] 0 int z = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L734] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L735] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L811] 0 pthread_t t2492; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2492={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L812] FCALL, FORK 0 pthread_create(&t2492, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2492, ((void *)0), P0, ((void *)0))=-2, t2492={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L813] 0 pthread_t t2493; VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2492={5:0}, t2493={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L814] FCALL, FORK 0 pthread_create(&t2493, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2493, ((void *)0), P1, ((void *)0))=-1, t2492={5:0}, t2493={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L815] 0 pthread_t t2494; VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2492={5:0}, t2493={6:0}, t2494={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L816] FCALL, FORK 0 pthread_create(&t2494, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2494, ((void *)0), P2, ((void *)0))=0, t2492={5:0}, t2493={6:0}, t2494={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L774] 3 y$w_buff1 = y$w_buff0 [L775] 3 y$w_buff0 = 2 [L776] 3 y$w_buff1_used = y$w_buff0_used [L777] 3 y$w_buff0_used = (_Bool)1 [L778] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L778] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L779] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L780] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L781] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L782] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L783] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L786] 3 z = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L739] 1 z = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L742] 1 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L754] 2 x = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L757] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L789] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L789] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L790] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L790] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L791] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L791] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L792] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L792] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L793] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L793] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L760] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L760] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L760] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L760] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L761] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L761] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L762] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L762] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L763] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L763] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L764] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L764] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L747] 1 __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, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L767] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L796] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L818] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2492={5:0}, t2493={6:0}, t2494={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L820] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L820] RET 0 assume_abort_if_not(main$tmp_guard0) [L822] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L822] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L822] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L822] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L823] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L823] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L824] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L824] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L825] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L825] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L826] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L826] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L829] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L830] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L831] 0 y$flush_delayed = weak$$choice2 [L832] 0 y$mem_tmp = y [L833] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L833] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L834] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L834] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0) [L834] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L834] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L835] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L835] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L835] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L835] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L836] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L836] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used) [L836] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L836] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L837] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L837] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L837] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L837] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L838] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L838] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0) [L838] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L838] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L839] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L839] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L839] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L839] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2) [L841] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L841] 0 y = y$flush_delayed ? y$mem_tmp : y [L842] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2492={5:0}, t2493={6:0}, t2494={3:0}, weak$$choice0=49, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L844] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=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: 812]: 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: 816]: 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: 814]: 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 7 procedures, 138 locations, 6 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: 9.7s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 6.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 781 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 781 mSDsluCounter, 824 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1232 mSDsCounter, 263 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2062 IncrementalHoareTripleChecker+Invalid, 2325 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 263 mSolverCounterUnsat, 166 mSDtfsCounter, 2062 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 261 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 224 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 479 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=815occurred in iteration=14, InterpolantAutomatonStates: 206, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 1470 NumberOfCodeBlocks, 1470 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1366 ConstructedInterpolants, 0 QuantifiedInterpolants, 7561 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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-22 13:32:53,868 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