./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/safe029_power.oepc_pso.oepc_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version ff03de63 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/safe029_power.oepc_pso.oepc_rmo.oepc.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 7db5da573de5a20455a36e013b1614f5d7f4dede9c4027ebf8a62a657a5ca5e2 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ff03de6 [2021-12-21 15:06:58,036 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-21 15:06:58,038 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-21 15:06:58,082 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-21 15:06:58,082 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-21 15:06:58,091 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-21 15:06:58,092 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-21 15:06:58,096 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-21 15:06:58,097 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-21 15:06:58,099 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-21 15:06:58,099 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-21 15:06:58,101 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-21 15:06:58,101 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-21 15:06:58,103 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-21 15:06:58,104 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-21 15:06:58,105 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-21 15:06:58,105 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-21 15:06:58,106 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-21 15:06:58,107 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-21 15:06:58,108 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-21 15:06:58,109 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-21 15:06:58,110 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-21 15:06:58,110 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-21 15:06:58,111 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-21 15:06:58,113 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-21 15:06:58,113 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-21 15:06:58,113 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-21 15:06:58,114 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-21 15:06:58,114 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-21 15:06:58,115 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-21 15:06:58,115 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-21 15:06:58,116 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-21 15:06:58,116 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-21 15:06:58,117 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-21 15:06:58,117 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-21 15:06:58,117 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-21 15:06:58,118 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-21 15:06:58,118 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-21 15:06:58,118 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-21 15:06:58,119 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-21 15:06:58,119 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-21 15:06:58,120 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-21 15:06:58,157 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-21 15:06:58,158 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-21 15:06:58,158 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-21 15:06:58,159 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-21 15:06:58,159 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-21 15:06:58,159 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-21 15:06:58,160 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-21 15:06:58,160 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-21 15:06:58,160 INFO L138 SettingsManager]: * Use SBE=true [2021-12-21 15:06:58,160 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-21 15:06:58,161 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-21 15:06:58,161 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-21 15:06:58,161 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-21 15:06:58,161 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-21 15:06:58,161 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-21 15:06:58,162 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-21 15:06:58,162 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-21 15:06:58,162 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-21 15:06:58,162 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-21 15:06:58,162 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-21 15:06:58,162 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-21 15:06:58,162 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-21 15:06:58,163 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-21 15:06:58,163 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-21 15:06:58,163 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-21 15:06:58,163 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-21 15:06:58,163 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-21 15:06:58,164 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-21 15:06:58,164 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-21 15:06:58,164 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-21 15:06:58,164 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-21 15:06:58,165 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-21 15:06:58,165 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-21 15:06:58,165 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-21 15:06:58,165 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 -> 7db5da573de5a20455a36e013b1614f5d7f4dede9c4027ebf8a62a657a5ca5e2 [2021-12-21 15:06:58,380 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-21 15:06:58,407 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-21 15:06:58,409 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-21 15:06:58,410 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-21 15:06:58,412 INFO L275 PluginConnector]: CDTParser initialized [2021-12-21 15:06:58,413 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe029_power.oepc_pso.oepc_rmo.oepc.i [2021-12-21 15:06:58,456 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75bc2d331/146733ed8afe4231a923396bce3b185d/FLAGd4a48388a [2021-12-21 15:06:58,904 INFO L306 CDTParser]: Found 1 translation units. [2021-12-21 15:06:58,904 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe029_power.oepc_pso.oepc_rmo.oepc.i [2021-12-21 15:06:58,921 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75bc2d331/146733ed8afe4231a923396bce3b185d/FLAGd4a48388a [2021-12-21 15:06:59,249 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75bc2d331/146733ed8afe4231a923396bce3b185d [2021-12-21 15:06:59,252 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-21 15:06:59,255 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-21 15:06:59,257 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-21 15:06:59,257 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-21 15:06:59,259 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-21 15:06:59,260 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 03:06:59" (1/1) ... [2021-12-21 15:06:59,261 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66dc6cf4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:06:59, skipping insertion in model container [2021-12-21 15:06:59,262 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 03:06:59" (1/1) ... [2021-12-21 15:06:59,267 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-21 15:06:59,305 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-21 15:06:59,448 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe029_power.oepc_pso.oepc_rmo.oepc.i[970,983] [2021-12-21 15:06:59,629 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 15:06:59,637 INFO L203 MainTranslator]: Completed pre-run [2021-12-21 15:06:59,646 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe029_power.oepc_pso.oepc_rmo.oepc.i[970,983] [2021-12-21 15:06:59,689 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 15:06:59,717 INFO L208 MainTranslator]: Completed translation [2021-12-21 15:06:59,718 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:06:59 WrapperNode [2021-12-21 15:06:59,718 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-21 15:06:59,719 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-21 15:06:59,719 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-21 15:06:59,719 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-21 15:06:59,724 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:06:59" (1/1) ... [2021-12-21 15:06:59,748 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:06:59" (1/1) ... [2021-12-21 15:06:59,784 INFO L137 Inliner]: procedures = 175, calls = 41, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 258 [2021-12-21 15:06:59,784 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-21 15:06:59,785 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-21 15:06:59,785 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-21 15:06:59,785 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-21 15:06:59,791 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:06:59" (1/1) ... [2021-12-21 15:06:59,791 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:06:59" (1/1) ... [2021-12-21 15:06:59,806 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:06:59" (1/1) ... [2021-12-21 15:06:59,808 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:06:59" (1/1) ... [2021-12-21 15:06:59,813 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:06:59" (1/1) ... [2021-12-21 15:06:59,825 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:06:59" (1/1) ... [2021-12-21 15:06:59,827 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:06:59" (1/1) ... [2021-12-21 15:06:59,841 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-21 15:06:59,841 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-21 15:06:59,841 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-21 15:06:59,842 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-21 15:06:59,842 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:06:59" (1/1) ... [2021-12-21 15:06:59,854 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-21 15:06:59,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 15:06:59,897 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-21 15:06:59,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-21 15:06:59,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-21 15:06:59,931 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-12-21 15:06:59,931 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-21 15:06:59,932 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-21 15:06:59,932 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-21 15:06:59,932 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-12-21 15:06:59,932 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-12-21 15:06:59,932 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-12-21 15:06:59,932 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-12-21 15:06:59,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-21 15:06:59,932 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-12-21 15:06:59,933 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-21 15:06:59,933 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-21 15:06:59,934 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-12-21 15:07:00,010 INFO L234 CfgBuilder]: Building ICFG [2021-12-21 15:07:00,011 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-21 15:07:00,357 INFO L275 CfgBuilder]: Performing block encoding [2021-12-21 15:07:00,634 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-21 15:07:00,642 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2021-12-21 15:07:00,645 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 03:07:00 BoogieIcfgContainer [2021-12-21 15:07:00,645 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-21 15:07:00,646 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-21 15:07:00,647 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-21 15:07:00,649 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-21 15:07:00,650 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 03:06:59" (1/3) ... [2021-12-21 15:07:00,650 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b68b299 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 03:07:00, skipping insertion in model container [2021-12-21 15:07:00,651 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:06:59" (2/3) ... [2021-12-21 15:07:00,651 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b68b299 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 03:07:00, skipping insertion in model container [2021-12-21 15:07:00,651 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 03:07:00" (3/3) ... [2021-12-21 15:07:00,652 INFO L111 eAbstractionObserver]: Analyzing ICFG safe029_power.oepc_pso.oepc_rmo.oepc.i [2021-12-21 15:07:00,657 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-12-21 15:07:00,657 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-21 15:07:00,658 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-12-21 15:07:00,658 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-12-21 15:07:00,687 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:07:00,687 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:07:00,687 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:07:00,687 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:07:00,687 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:07:00,688 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:07:00,688 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:07:00,688 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:07:00,688 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:07:00,688 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:07:00,688 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:07:00,688 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:07:00,689 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:07:00,689 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:07:00,690 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:07:00,690 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:07:00,690 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:07:00,690 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:07:00,690 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:07:00,690 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:07:00,691 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:07:00,691 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:07:00,691 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:07:00,692 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:07:00,692 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:07:00,692 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:07:00,693 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:07:00,693 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:07:00,693 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:07:00,694 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:07:00,694 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:07:00,694 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:07:00,694 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:07:00,695 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:07:00,695 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:07:00,695 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:07:00,695 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:07:00,695 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:07:00,695 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:07:00,696 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:07:00,696 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:07:00,696 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:07:00,696 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:07:00,696 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:07:00,696 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:07:00,696 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:07:00,697 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:07:00,697 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:07:00,697 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:07:00,697 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:07:00,698 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:07:00,698 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:07:00,698 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:07:00,698 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:07:00,698 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:07:00,698 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:07:00,699 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:07:00,699 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:07:00,699 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:07:00,699 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:07:00,701 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:07:00,701 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:07:00,702 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:07:00,702 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:07:00,702 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:07:00,703 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:07:00,704 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:07:00,704 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:07:00,704 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:07:00,704 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:07:00,705 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:07:00,705 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:07:00,705 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:07:00,706 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:07:00,706 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:07:00,706 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:07:00,706 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:07:00,707 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:07:00,707 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:07:00,707 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:07:00,708 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:07:00,708 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:07:00,710 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-12-21 15:07:00,751 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-21 15:07:00,757 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-21 15:07:00,758 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-12-21 15:07:00,766 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 98 places, 93 transitions, 196 flow [2021-12-21 15:07:00,805 INFO L129 PetriNetUnfolder]: 2/91 cut-off events. [2021-12-21 15:07:00,805 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-12-21 15:07:00,808 INFO L84 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 91 events. 2/91 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 44 event pairs, 0 based on Foata normal form. 0/87 useless extension candidates. Maximal degree in co-relation 55. Up to 2 conditions per place. [2021-12-21 15:07:00,809 INFO L82 GeneralOperation]: Start removeDead. Operand has 98 places, 93 transitions, 196 flow [2021-12-21 15:07:00,817 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 96 places, 91 transitions, 188 flow [2021-12-21 15:07:00,832 INFO L129 PetriNetUnfolder]: 0/42 cut-off events. [2021-12-21 15:07:00,833 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-12-21 15:07:00,833 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 15:07:00,834 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] [2021-12-21 15:07:00,834 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-12-21 15:07:00,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:07:00,839 INFO L85 PathProgramCache]: Analyzing trace with hash -761824995, now seen corresponding path program 1 times [2021-12-21 15:07:00,844 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:07:00,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972743237] [2021-12-21 15:07:00,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:07:00,846 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:07:00,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:07:01,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 15:07:01,090 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:07:01,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972743237] [2021-12-21 15:07:01,092 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972743237] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:07:01,093 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 15:07:01,093 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-21 15:07:01,094 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33628857] [2021-12-21 15:07:01,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:07:01,105 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-21 15:07:01,105 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:07:01,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 15:07:01,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 15:07:01,124 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 93 [2021-12-21 15:07:01,127 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 91 transitions, 188 flow. Second operand has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:07:01,127 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-21 15:07:01,127 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 93 [2021-12-21 15:07:01,128 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-21 15:07:01,224 INFO L129 PetriNetUnfolder]: 18/233 cut-off events. [2021-12-21 15:07:01,224 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2021-12-21 15:07:01,225 INFO L84 FinitePrefix]: Finished finitePrefix Result has 285 conditions, 233 events. 18/233 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 794 event pairs, 12 based on Foata normal form. 8/227 useless extension candidates. Maximal degree in co-relation 239. Up to 31 conditions per place. [2021-12-21 15:07:01,227 INFO L132 encePairwiseOnDemand]: 88/93 looper letters, 10 selfloop transitions, 2 changer transitions 0/91 dead transitions. [2021-12-21 15:07:01,227 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 91 transitions, 215 flow [2021-12-21 15:07:01,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 15:07:01,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-12-21 15:07:01,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 260 transitions. [2021-12-21 15:07:01,236 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.931899641577061 [2021-12-21 15:07:01,237 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 260 transitions. [2021-12-21 15:07:01,237 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 260 transitions. [2021-12-21 15:07:01,238 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 15:07:01,239 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 260 transitions. [2021-12-21 15:07:01,242 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 86.66666666666667) internal successors, (260), 3 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:07:01,246 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 93.0) internal successors, (372), 4 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:07:01,246 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 93.0) internal successors, (372), 4 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:07:01,247 INFO L186 Difference]: Start difference. First operand has 96 places, 91 transitions, 188 flow. Second operand 3 states and 260 transitions. [2021-12-21 15:07:01,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 91 transitions, 215 flow [2021-12-21 15:07:01,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 91 transitions, 212 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-12-21 15:07:01,252 INFO L242 Difference]: Finished difference. Result has 94 places, 87 transitions, 182 flow [2021-12-21 15:07:01,253 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=182, PETRI_PLACES=94, PETRI_TRANSITIONS=87} [2021-12-21 15:07:01,256 INFO L334 CegarLoopForPetriNet]: 96 programPoint places, -2 predicate places. [2021-12-21 15:07:01,256 INFO L470 AbstractCegarLoop]: Abstraction has has 94 places, 87 transitions, 182 flow [2021-12-21 15:07:01,256 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:07:01,257 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 15:07:01,257 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 15:07:01,257 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-21 15:07:01,257 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-12-21 15:07:01,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:07:01,258 INFO L85 PathProgramCache]: Analyzing trace with hash -29849764, now seen corresponding path program 1 times [2021-12-21 15:07:01,258 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:07:01,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343216242] [2021-12-21 15:07:01,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:07:01,258 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:07:01,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:07:01,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 15:07:01,420 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:07:01,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343216242] [2021-12-21 15:07:01,420 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343216242] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:07:01,421 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 15:07:01,421 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-21 15:07:01,421 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502066739] [2021-12-21 15:07:01,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:07:01,422 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-21 15:07:01,422 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:07:01,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-21 15:07:01,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-21 15:07:01,424 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 93 [2021-12-21 15:07:01,424 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 87 transitions, 182 flow. Second operand has 6 states, 6 states have (on average 74.66666666666667) internal successors, (448), 6 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:07:01,424 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-21 15:07:01,424 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 93 [2021-12-21 15:07:01,424 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-21 15:07:01,647 INFO L129 PetriNetUnfolder]: 179/654 cut-off events. [2021-12-21 15:07:01,647 INFO L130 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2021-12-21 15:07:01,650 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1031 conditions, 654 events. 179/654 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 3783 event pairs, 62 based on Foata normal form. 0/631 useless extension candidates. Maximal degree in co-relation 984. Up to 186 conditions per place. [2021-12-21 15:07:01,652 INFO L132 encePairwiseOnDemand]: 86/93 looper letters, 17 selfloop transitions, 3 changer transitions 43/125 dead transitions. [2021-12-21 15:07:01,652 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 125 transitions, 382 flow [2021-12-21 15:07:01,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-21 15:07:01,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-21 15:07:01,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 713 transitions. [2021-12-21 15:07:01,658 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8518518518518519 [2021-12-21 15:07:01,658 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 713 transitions. [2021-12-21 15:07:01,658 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 713 transitions. [2021-12-21 15:07:01,659 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 15:07:01,659 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 713 transitions. [2021-12-21 15:07:01,661 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 79.22222222222223) internal successors, (713), 9 states have internal predecessors, (713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:07:01,664 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 93.0) internal successors, (930), 10 states have internal predecessors, (930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:07:01,664 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 93.0) internal successors, (930), 10 states have internal predecessors, (930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:07:01,664 INFO L186 Difference]: Start difference. First operand has 94 places, 87 transitions, 182 flow. Second operand 9 states and 713 transitions. [2021-12-21 15:07:01,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 125 transitions, 382 flow [2021-12-21 15:07:01,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 125 transitions, 364 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-12-21 15:07:01,667 INFO L242 Difference]: Finished difference. Result has 107 places, 79 transitions, 201 flow [2021-12-21 15:07:01,667 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=201, PETRI_PLACES=107, PETRI_TRANSITIONS=79} [2021-12-21 15:07:01,668 INFO L334 CegarLoopForPetriNet]: 96 programPoint places, 11 predicate places. [2021-12-21 15:07:01,668 INFO L470 AbstractCegarLoop]: Abstraction has has 107 places, 79 transitions, 201 flow [2021-12-21 15:07:01,668 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 74.66666666666667) internal successors, (448), 6 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:07:01,668 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 15:07:01,668 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 15:07:01,668 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-21 15:07:01,669 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-12-21 15:07:01,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:07:01,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1473150781, now seen corresponding path program 1 times [2021-12-21 15:07:01,669 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:07:01,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319519271] [2021-12-21 15:07:01,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:07:01,670 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:07:01,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:07:01,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 15:07:01,829 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:07:01,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319519271] [2021-12-21 15:07:01,829 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319519271] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:07:01,830 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 15:07:01,830 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-21 15:07:01,830 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272707235] [2021-12-21 15:07:01,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:07:01,830 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-21 15:07:01,831 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:07:01,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-21 15:07:01,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2021-12-21 15:07:01,832 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 93 [2021-12-21 15:07:01,833 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 79 transitions, 201 flow. Second operand has 10 states, 10 states have (on average 72.3) internal successors, (723), 10 states have internal predecessors, (723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:07:01,833 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-21 15:07:01,833 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 93 [2021-12-21 15:07:01,833 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-21 15:07:02,097 INFO L129 PetriNetUnfolder]: 141/410 cut-off events. [2021-12-21 15:07:02,097 INFO L130 PetriNetUnfolder]: For 307/308 co-relation queries the response was YES. [2021-12-21 15:07:02,098 INFO L84 FinitePrefix]: Finished finitePrefix Result has 929 conditions, 410 events. 141/410 cut-off events. For 307/308 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1854 event pairs, 34 based on Foata normal form. 14/414 useless extension candidates. Maximal degree in co-relation 872. Up to 133 conditions per place. [2021-12-21 15:07:02,099 INFO L132 encePairwiseOnDemand]: 82/93 looper letters, 17 selfloop transitions, 8 changer transitions 35/122 dead transitions. [2021-12-21 15:07:02,099 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 122 transitions, 439 flow [2021-12-21 15:07:02,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-21 15:07:02,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2021-12-21 15:07:02,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1128 transitions. [2021-12-21 15:07:02,102 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8086021505376344 [2021-12-21 15:07:02,102 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1128 transitions. [2021-12-21 15:07:02,102 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1128 transitions. [2021-12-21 15:07:02,103 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 15:07:02,103 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1128 transitions. [2021-12-21 15:07:02,105 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 75.2) internal successors, (1128), 15 states have internal predecessors, (1128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:07:02,107 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 93.0) internal successors, (1488), 16 states have internal predecessors, (1488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:07:02,107 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 93.0) internal successors, (1488), 16 states have internal predecessors, (1488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:07:02,107 INFO L186 Difference]: Start difference. First operand has 107 places, 79 transitions, 201 flow. Second operand 15 states and 1128 transitions. [2021-12-21 15:07:02,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 122 transitions, 439 flow [2021-12-21 15:07:02,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 122 transitions, 418 flow, removed 9 selfloop flow, removed 4 redundant places. [2021-12-21 15:07:02,112 INFO L242 Difference]: Finished difference. Result has 112 places, 83 transitions, 264 flow [2021-12-21 15:07:02,112 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=264, PETRI_PLACES=112, PETRI_TRANSITIONS=83} [2021-12-21 15:07:02,112 INFO L334 CegarLoopForPetriNet]: 96 programPoint places, 16 predicate places. [2021-12-21 15:07:02,113 INFO L470 AbstractCegarLoop]: Abstraction has has 112 places, 83 transitions, 264 flow [2021-12-21 15:07:02,113 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 72.3) internal successors, (723), 10 states have internal predecessors, (723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:07:02,113 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 15:07:02,113 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 15:07:02,113 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-21 15:07:02,114 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-12-21 15:07:02,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:07:02,114 INFO L85 PathProgramCache]: Analyzing trace with hash -226472556, now seen corresponding path program 1 times [2021-12-21 15:07:02,114 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:07:02,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970447444] [2021-12-21 15:07:02,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:07:02,115 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:07:02,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:07:02,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 15:07:02,216 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:07:02,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970447444] [2021-12-21 15:07:02,217 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970447444] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:07:02,217 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 15:07:02,217 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-21 15:07:02,217 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936302634] [2021-12-21 15:07:02,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:07:02,218 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-21 15:07:02,218 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:07:02,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-21 15:07:02,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-21 15:07:02,219 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 93 [2021-12-21 15:07:02,219 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 83 transitions, 264 flow. Second operand has 7 states, 7 states have (on average 74.71428571428571) internal successors, (523), 7 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:07:02,219 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-21 15:07:02,220 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 93 [2021-12-21 15:07:02,220 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-21 15:07:02,451 INFO L129 PetriNetUnfolder]: 110/344 cut-off events. [2021-12-21 15:07:02,451 INFO L130 PetriNetUnfolder]: For 938/946 co-relation queries the response was YES. [2021-12-21 15:07:02,452 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1096 conditions, 344 events. 110/344 cut-off events. For 938/946 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1424 event pairs, 29 based on Foata normal form. 10/343 useless extension candidates. Maximal degree in co-relation 1028. Up to 119 conditions per place. [2021-12-21 15:07:02,455 INFO L132 encePairwiseOnDemand]: 84/93 looper letters, 23 selfloop transitions, 7 changer transitions 25/119 dead transitions. [2021-12-21 15:07:02,455 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 119 transitions, 612 flow [2021-12-21 15:07:02,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-21 15:07:02,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-12-21 15:07:02,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1004 transitions. [2021-12-21 15:07:02,457 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8304383788254756 [2021-12-21 15:07:02,458 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1004 transitions. [2021-12-21 15:07:02,458 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1004 transitions. [2021-12-21 15:07:02,458 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 15:07:02,458 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1004 transitions. [2021-12-21 15:07:02,460 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 77.23076923076923) internal successors, (1004), 13 states have internal predecessors, (1004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:07:02,461 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 93.0) internal successors, (1302), 14 states have internal predecessors, (1302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:07:02,462 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 93.0) internal successors, (1302), 14 states have internal predecessors, (1302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:07:02,462 INFO L186 Difference]: Start difference. First operand has 112 places, 83 transitions, 264 flow. Second operand 13 states and 1004 transitions. [2021-12-21 15:07:02,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 119 transitions, 612 flow [2021-12-21 15:07:02,480 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 119 transitions, 584 flow, removed 12 selfloop flow, removed 5 redundant places. [2021-12-21 15:07:02,482 INFO L242 Difference]: Finished difference. Result has 120 places, 86 transitions, 316 flow [2021-12-21 15:07:02,482 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=254, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=316, PETRI_PLACES=120, PETRI_TRANSITIONS=86} [2021-12-21 15:07:02,482 INFO L334 CegarLoopForPetriNet]: 96 programPoint places, 24 predicate places. [2021-12-21 15:07:02,482 INFO L470 AbstractCegarLoop]: Abstraction has has 120 places, 86 transitions, 316 flow [2021-12-21 15:07:02,483 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 74.71428571428571) internal successors, (523), 7 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:07:02,483 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 15:07:02,483 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 15:07:02,483 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-21 15:07:02,483 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-12-21 15:07:02,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:07:02,483 INFO L85 PathProgramCache]: Analyzing trace with hash -2075845646, now seen corresponding path program 2 times [2021-12-21 15:07:02,483 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:07:02,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590764062] [2021-12-21 15:07:02,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:07:02,484 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:07:02,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:07:02,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 15:07:02,604 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:07:02,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590764062] [2021-12-21 15:07:02,605 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590764062] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:07:02,605 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 15:07:02,605 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-21 15:07:02,605 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102025666] [2021-12-21 15:07:02,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:07:02,606 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-21 15:07:02,606 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:07:02,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-21 15:07:02,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-21 15:07:02,607 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 93 [2021-12-21 15:07:02,607 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 86 transitions, 316 flow. Second operand has 8 states, 8 states have (on average 73.625) internal successors, (589), 8 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:07:02,607 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-21 15:07:02,607 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 93 [2021-12-21 15:07:02,608 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-21 15:07:02,839 INFO L129 PetriNetUnfolder]: 92/336 cut-off events. [2021-12-21 15:07:02,839 INFO L130 PetriNetUnfolder]: For 1684/1752 co-relation queries the response was YES. [2021-12-21 15:07:02,841 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1296 conditions, 336 events. 92/336 cut-off events. For 1684/1752 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1461 event pairs, 9 based on Foata normal form. 10/333 useless extension candidates. Maximal degree in co-relation 1220. Up to 90 conditions per place. [2021-12-21 15:07:02,842 INFO L132 encePairwiseOnDemand]: 84/93 looper letters, 23 selfloop transitions, 8 changer transitions 25/119 dead transitions. [2021-12-21 15:07:02,842 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 119 transitions, 770 flow [2021-12-21 15:07:02,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-21 15:07:02,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-12-21 15:07:02,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 843 transitions. [2021-12-21 15:07:02,844 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8240469208211144 [2021-12-21 15:07:02,844 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 843 transitions. [2021-12-21 15:07:02,844 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 843 transitions. [2021-12-21 15:07:02,845 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 15:07:02,845 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 843 transitions. [2021-12-21 15:07:02,846 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 76.63636363636364) internal successors, (843), 11 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:07:02,848 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 93.0) internal successors, (1116), 12 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:07:02,848 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 93.0) internal successors, (1116), 12 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:07:02,848 INFO L186 Difference]: Start difference. First operand has 120 places, 86 transitions, 316 flow. Second operand 11 states and 843 transitions. [2021-12-21 15:07:02,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 119 transitions, 770 flow [2021-12-21 15:07:02,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 119 transitions, 711 flow, removed 24 selfloop flow, removed 7 redundant places. [2021-12-21 15:07:02,853 INFO L242 Difference]: Finished difference. Result has 121 places, 88 transitions, 364 flow [2021-12-21 15:07:02,854 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=364, PETRI_PLACES=121, PETRI_TRANSITIONS=88} [2021-12-21 15:07:02,854 INFO L334 CegarLoopForPetriNet]: 96 programPoint places, 25 predicate places. [2021-12-21 15:07:02,854 INFO L470 AbstractCegarLoop]: Abstraction has has 121 places, 88 transitions, 364 flow [2021-12-21 15:07:02,855 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 73.625) internal successors, (589), 8 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:07:02,855 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 15:07:02,855 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 15:07:02,855 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-21 15:07:02,855 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-12-21 15:07:02,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:07:02,856 INFO L85 PathProgramCache]: Analyzing trace with hash 92241519, now seen corresponding path program 1 times [2021-12-21 15:07:02,856 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:07:02,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577772544] [2021-12-21 15:07:02,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:07:02,856 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:07:02,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:07:02,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 15:07:02,927 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:07:02,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577772544] [2021-12-21 15:07:02,927 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577772544] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:07:02,927 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 15:07:02,927 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-21 15:07:02,927 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912535751] [2021-12-21 15:07:02,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:07:02,928 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-21 15:07:02,928 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:07:02,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-21 15:07:02,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-21 15:07:02,929 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 93 [2021-12-21 15:07:02,929 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 88 transitions, 364 flow. Second operand has 6 states, 6 states have (on average 75.16666666666667) internal successors, (451), 6 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:07:02,929 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-21 15:07:02,929 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 93 [2021-12-21 15:07:02,929 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-21 15:07:03,100 INFO L129 PetriNetUnfolder]: 86/366 cut-off events. [2021-12-21 15:07:03,101 INFO L130 PetriNetUnfolder]: For 2587/2661 co-relation queries the response was YES. [2021-12-21 15:07:03,102 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1501 conditions, 366 events. 86/366 cut-off events. For 2587/2661 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1756 event pairs, 18 based on Foata normal form. 23/370 useless extension candidates. Maximal degree in co-relation 1424. Up to 103 conditions per place. [2021-12-21 15:07:03,103 INFO L132 encePairwiseOnDemand]: 87/93 looper letters, 29 selfloop transitions, 3 changer transitions 25/121 dead transitions. [2021-12-21 15:07:03,103 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 121 transitions, 885 flow [2021-12-21 15:07:03,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-21 15:07:03,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-21 15:07:03,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 702 transitions. [2021-12-21 15:07:03,105 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8387096774193549 [2021-12-21 15:07:03,105 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 702 transitions. [2021-12-21 15:07:03,106 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 702 transitions. [2021-12-21 15:07:03,106 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 15:07:03,106 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 702 transitions. [2021-12-21 15:07:03,107 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 78.0) internal successors, (702), 9 states have internal predecessors, (702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:07:03,108 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 93.0) internal successors, (930), 10 states have internal predecessors, (930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:07:03,109 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 93.0) internal successors, (930), 10 states have internal predecessors, (930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:07:03,109 INFO L186 Difference]: Start difference. First operand has 121 places, 88 transitions, 364 flow. Second operand 9 states and 702 transitions. [2021-12-21 15:07:03,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 121 transitions, 885 flow [2021-12-21 15:07:03,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 121 transitions, 835 flow, removed 16 selfloop flow, removed 6 redundant places. [2021-12-21 15:07:03,116 INFO L242 Difference]: Finished difference. Result has 124 places, 88 transitions, 367 flow [2021-12-21 15:07:03,116 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=367, PETRI_PLACES=124, PETRI_TRANSITIONS=88} [2021-12-21 15:07:03,116 INFO L334 CegarLoopForPetriNet]: 96 programPoint places, 28 predicate places. [2021-12-21 15:07:03,117 INFO L470 AbstractCegarLoop]: Abstraction has has 124 places, 88 transitions, 367 flow [2021-12-21 15:07:03,117 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 75.16666666666667) internal successors, (451), 6 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:07:03,117 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 15:07:03,117 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 15:07:03,117 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-21 15:07:03,117 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-12-21 15:07:03,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:07:03,118 INFO L85 PathProgramCache]: Analyzing trace with hash 300251994, now seen corresponding path program 1 times [2021-12-21 15:07:03,118 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:07:03,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740933524] [2021-12-21 15:07:03,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:07:03,119 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:07:03,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:07:03,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 15:07:03,267 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:07:03,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740933524] [2021-12-21 15:07:03,267 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740933524] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:07:03,267 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 15:07:03,267 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-21 15:07:03,267 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096287243] [2021-12-21 15:07:03,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:07:03,270 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-21 15:07:03,271 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:07:03,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-21 15:07:03,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-12-21 15:07:03,272 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 93 [2021-12-21 15:07:03,273 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 88 transitions, 367 flow. Second operand has 10 states, 10 states have (on average 72.5) internal successors, (725), 10 states have internal predecessors, (725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:07:03,273 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-21 15:07:03,273 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 93 [2021-12-21 15:07:03,273 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-21 15:07:03,466 INFO L129 PetriNetUnfolder]: 64/306 cut-off events. [2021-12-21 15:07:03,466 INFO L130 PetriNetUnfolder]: For 2083/2149 co-relation queries the response was YES. [2021-12-21 15:07:03,467 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1221 conditions, 306 events. 64/306 cut-off events. For 2083/2149 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1297 event pairs, 31 based on Foata normal form. 8/294 useless extension candidates. Maximal degree in co-relation 1139. Up to 118 conditions per place. [2021-12-21 15:07:03,468 INFO L132 encePairwiseOnDemand]: 82/93 looper letters, 21 selfloop transitions, 9 changer transitions 13/105 dead transitions. [2021-12-21 15:07:03,468 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 105 transitions, 646 flow [2021-12-21 15:07:03,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-21 15:07:03,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-12-21 15:07:03,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 964 transitions. [2021-12-21 15:07:03,471 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7973531844499586 [2021-12-21 15:07:03,471 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 964 transitions. [2021-12-21 15:07:03,471 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 964 transitions. [2021-12-21 15:07:03,471 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 15:07:03,471 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 964 transitions. [2021-12-21 15:07:03,473 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 74.15384615384616) internal successors, (964), 13 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-21 15:07:03,474 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 93.0) internal successors, (1302), 14 states have internal predecessors, (1302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:07:03,475 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 93.0) internal successors, (1302), 14 states have internal predecessors, (1302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:07:03,475 INFO L186 Difference]: Start difference. First operand has 124 places, 88 transitions, 367 flow. Second operand 13 states and 964 transitions. [2021-12-21 15:07:03,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 105 transitions, 646 flow [2021-12-21 15:07:03,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 105 transitions, 601 flow, removed 21 selfloop flow, removed 7 redundant places. [2021-12-21 15:07:03,481 INFO L242 Difference]: Finished difference. Result has 130 places, 88 transitions, 379 flow [2021-12-21 15:07:03,481 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=379, PETRI_PLACES=130, PETRI_TRANSITIONS=88} [2021-12-21 15:07:03,482 INFO L334 CegarLoopForPetriNet]: 96 programPoint places, 34 predicate places. [2021-12-21 15:07:03,482 INFO L470 AbstractCegarLoop]: Abstraction has has 130 places, 88 transitions, 379 flow [2021-12-21 15:07:03,483 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 72.5) internal successors, (725), 10 states have internal predecessors, (725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:07:03,483 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 15:07:03,483 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 15:07:03,483 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-21 15:07:03,483 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-12-21 15:07:03,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:07:03,484 INFO L85 PathProgramCache]: Analyzing trace with hash -2042440182, now seen corresponding path program 1 times [2021-12-21 15:07:03,484 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:07:03,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400750198] [2021-12-21 15:07:03,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:07:03,484 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:07:03,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:07:03,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 15:07:03,590 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:07:03,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400750198] [2021-12-21 15:07:03,590 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400750198] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:07:03,590 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 15:07:03,590 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-21 15:07:03,591 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120607595] [2021-12-21 15:07:03,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:07:03,591 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-21 15:07:03,591 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:07:03,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-21 15:07:03,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-21 15:07:03,592 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 93 [2021-12-21 15:07:03,603 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 88 transitions, 379 flow. Second operand has 6 states, 6 states have (on average 74.16666666666667) internal successors, (445), 6 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:07:03,603 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-21 15:07:03,603 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 93 [2021-12-21 15:07:03,603 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-21 15:07:03,798 INFO L129 PetriNetUnfolder]: 299/800 cut-off events. [2021-12-21 15:07:03,799 INFO L130 PetriNetUnfolder]: For 6545/6611 co-relation queries the response was YES. [2021-12-21 15:07:03,802 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2968 conditions, 800 events. 299/800 cut-off events. For 6545/6611 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 4810 event pairs, 19 based on Foata normal form. 47/818 useless extension candidates. Maximal degree in co-relation 2885. Up to 176 conditions per place. [2021-12-21 15:07:03,804 INFO L132 encePairwiseOnDemand]: 84/93 looper letters, 30 selfloop transitions, 5 changer transitions 50/149 dead transitions. [2021-12-21 15:07:03,804 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 149 transitions, 1091 flow [2021-12-21 15:07:03,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-21 15:07:03,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-12-21 15:07:03,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 784 transitions. [2021-12-21 15:07:03,806 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.843010752688172 [2021-12-21 15:07:03,806 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 784 transitions. [2021-12-21 15:07:03,806 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 784 transitions. [2021-12-21 15:07:03,807 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 15:07:03,807 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 784 transitions. [2021-12-21 15:07:03,808 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 78.4) internal successors, (784), 10 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:07:03,809 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 93.0) internal successors, (1023), 11 states have internal predecessors, (1023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:07:03,809 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 93.0) internal successors, (1023), 11 states have internal predecessors, (1023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:07:03,810 INFO L186 Difference]: Start difference. First operand has 130 places, 88 transitions, 379 flow. Second operand 10 states and 784 transitions. [2021-12-21 15:07:03,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 149 transitions, 1091 flow [2021-12-21 15:07:03,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 149 transitions, 978 flow, removed 33 selfloop flow, removed 15 redundant places. [2021-12-21 15:07:03,818 INFO L242 Difference]: Finished difference. Result has 124 places, 88 transitions, 370 flow [2021-12-21 15:07:03,818 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=328, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=370, PETRI_PLACES=124, PETRI_TRANSITIONS=88} [2021-12-21 15:07:03,818 INFO L334 CegarLoopForPetriNet]: 96 programPoint places, 28 predicate places. [2021-12-21 15:07:03,819 INFO L470 AbstractCegarLoop]: Abstraction has has 124 places, 88 transitions, 370 flow [2021-12-21 15:07:03,819 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 74.16666666666667) internal successors, (445), 6 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:07:03,819 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 15:07:03,819 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 15:07:03,819 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-21 15:07:03,820 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-12-21 15:07:03,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:07:03,820 INFO L85 PathProgramCache]: Analyzing trace with hash 465198888, now seen corresponding path program 1 times [2021-12-21 15:07:03,820 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:07:03,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518611606] [2021-12-21 15:07:03,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:07:03,820 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:07:03,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:07:03,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 15:07:03,887 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:07:03,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518611606] [2021-12-21 15:07:03,887 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518611606] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:07:03,887 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 15:07:03,887 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-21 15:07:03,887 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870021457] [2021-12-21 15:07:03,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:07:03,888 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-21 15:07:03,888 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:07:03,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-21 15:07:03,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-21 15:07:03,889 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 93 [2021-12-21 15:07:03,889 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 88 transitions, 370 flow. Second operand has 7 states, 7 states have (on average 74.0) internal successors, (518), 7 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:07:03,889 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-21 15:07:03,890 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 93 [2021-12-21 15:07:03,890 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-21 15:07:04,031 INFO L129 PetriNetUnfolder]: 60/275 cut-off events. [2021-12-21 15:07:04,031 INFO L130 PetriNetUnfolder]: For 1560/1569 co-relation queries the response was YES. [2021-12-21 15:07:04,032 INFO L84 FinitePrefix]: Finished finitePrefix Result has 985 conditions, 275 events. 60/275 cut-off events. For 1560/1569 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1145 event pairs, 2 based on Foata normal form. 22/295 useless extension candidates. Maximal degree in co-relation 913. Up to 48 conditions per place. [2021-12-21 15:07:04,033 INFO L132 encePairwiseOnDemand]: 85/93 looper letters, 18 selfloop transitions, 7 changer transitions 26/112 dead transitions. [2021-12-21 15:07:04,033 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 112 transitions, 691 flow [2021-12-21 15:07:04,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-21 15:07:04,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-12-21 15:07:04,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 761 transitions. [2021-12-21 15:07:04,035 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8182795698924731 [2021-12-21 15:07:04,035 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 761 transitions. [2021-12-21 15:07:04,035 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 761 transitions. [2021-12-21 15:07:04,035 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 15:07:04,035 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 761 transitions. [2021-12-21 15:07:04,037 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 76.1) internal successors, (761), 10 states have internal predecessors, (761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:07:04,038 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 93.0) internal successors, (1023), 11 states have internal predecessors, (1023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:07:04,038 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 93.0) internal successors, (1023), 11 states have internal predecessors, (1023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:07:04,038 INFO L186 Difference]: Start difference. First operand has 124 places, 88 transitions, 370 flow. Second operand 10 states and 761 transitions. [2021-12-21 15:07:04,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 112 transitions, 691 flow [2021-12-21 15:07:04,041 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 112 transitions, 478 flow, removed 98 selfloop flow, removed 19 redundant places. [2021-12-21 15:07:04,042 INFO L242 Difference]: Finished difference. Result has 114 places, 82 transitions, 269 flow [2021-12-21 15:07:04,043 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=269, PETRI_PLACES=114, PETRI_TRANSITIONS=82} [2021-12-21 15:07:04,043 INFO L334 CegarLoopForPetriNet]: 96 programPoint places, 18 predicate places. [2021-12-21 15:07:04,043 INFO L470 AbstractCegarLoop]: Abstraction has has 114 places, 82 transitions, 269 flow [2021-12-21 15:07:04,043 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 74.0) internal successors, (518), 7 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:07:04,044 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 15:07:04,044 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-21 15:07:04,044 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-21 15:07:04,044 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-12-21 15:07:04,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:07:04,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1596495984, now seen corresponding path program 1 times [2021-12-21 15:07:04,045 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:07:04,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239211772] [2021-12-21 15:07:04,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:07:04,045 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:07:04,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:07:04,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 15:07:04,232 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:07:04,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239211772] [2021-12-21 15:07:04,232 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239211772] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:07:04,232 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 15:07:04,232 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-12-21 15:07:04,232 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872221095] [2021-12-21 15:07:04,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:07:04,233 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-21 15:07:04,233 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:07:04,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-21 15:07:04,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2021-12-21 15:07:04,234 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 93 [2021-12-21 15:07:04,235 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 82 transitions, 269 flow. Second operand has 12 states, 12 states have (on average 69.66666666666667) internal successors, (836), 12 states have internal predecessors, (836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:07:04,235 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-21 15:07:04,235 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 93 [2021-12-21 15:07:04,235 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-21 15:07:04,388 INFO L129 PetriNetUnfolder]: 5/119 cut-off events. [2021-12-21 15:07:04,388 INFO L130 PetriNetUnfolder]: For 76/78 co-relation queries the response was YES. [2021-12-21 15:07:04,388 INFO L84 FinitePrefix]: Finished finitePrefix Result has 269 conditions, 119 events. 5/119 cut-off events. For 76/78 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 162 event pairs, 0 based on Foata normal form. 3/122 useless extension candidates. Maximal degree in co-relation 214. Up to 13 conditions per place. [2021-12-21 15:07:04,389 INFO L132 encePairwiseOnDemand]: 84/93 looper letters, 17 selfloop transitions, 6 changer transitions 9/90 dead transitions. [2021-12-21 15:07:04,389 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 90 transitions, 359 flow [2021-12-21 15:07:04,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-21 15:07:04,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-12-21 15:07:04,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 780 transitions. [2021-12-21 15:07:04,391 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7624633431085044 [2021-12-21 15:07:04,391 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 780 transitions. [2021-12-21 15:07:04,391 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 780 transitions. [2021-12-21 15:07:04,391 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 15:07:04,391 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 780 transitions. [2021-12-21 15:07:04,393 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 70.9090909090909) internal successors, (780), 11 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:07:04,394 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 93.0) internal successors, (1116), 12 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:07:04,394 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 93.0) internal successors, (1116), 12 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:07:04,394 INFO L186 Difference]: Start difference. First operand has 114 places, 82 transitions, 269 flow. Second operand 11 states and 780 transitions. [2021-12-21 15:07:04,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 90 transitions, 359 flow [2021-12-21 15:07:04,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 90 transitions, 295 flow, removed 18 selfloop flow, removed 18 redundant places. [2021-12-21 15:07:04,397 INFO L242 Difference]: Finished difference. Result has 104 places, 80 transitions, 218 flow [2021-12-21 15:07:04,397 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=209, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=218, PETRI_PLACES=104, PETRI_TRANSITIONS=80} [2021-12-21 15:07:04,397 INFO L334 CegarLoopForPetriNet]: 96 programPoint places, 8 predicate places. [2021-12-21 15:07:04,397 INFO L470 AbstractCegarLoop]: Abstraction has has 104 places, 80 transitions, 218 flow [2021-12-21 15:07:04,398 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 69.66666666666667) internal successors, (836), 12 states have internal predecessors, (836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:07:04,398 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 15:07:04,398 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-21 15:07:04,398 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-21 15:07:04,398 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-12-21 15:07:04,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:07:04,399 INFO L85 PathProgramCache]: Analyzing trace with hash 766511394, now seen corresponding path program 2 times [2021-12-21 15:07:04,399 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:07:04,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283791136] [2021-12-21 15:07:04,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:07:04,399 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:07:04,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 15:07:04,423 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 15:07:04,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 15:07:04,489 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 15:07:04,490 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-21 15:07:04,490 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2021-12-21 15:07:04,492 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2021-12-21 15:07:04,492 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (2 of 5 remaining) [2021-12-21 15:07:04,492 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (1 of 5 remaining) [2021-12-21 15:07:04,492 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2021-12-21 15:07:04,492 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-21 15:07:04,495 INFO L732 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 15:07:04,498 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-12-21 15:07:04,499 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-21 15:07:04,552 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 03:07:04 BasicIcfg [2021-12-21 15:07:04,553 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-21 15:07:04,553 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-21 15:07:04,553 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-21 15:07:04,553 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-21 15:07:04,554 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 03:07:00" (3/4) ... [2021-12-21 15:07:04,555 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-21 15:07:04,607 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-21 15:07:04,607 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-21 15:07:04,607 INFO L158 Benchmark]: Toolchain (without parser) took 5352.80ms. Allocated memory was 94.4MB in the beginning and 186.6MB in the end (delta: 92.3MB). Free memory was 57.8MB in the beginning and 114.9MB in the end (delta: -57.2MB). Peak memory consumption was 33.7MB. Max. memory is 16.1GB. [2021-12-21 15:07:04,608 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 94.4MB. Free memory was 65.7MB in the beginning and 65.7MB in the end (delta: 27.0kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-21 15:07:04,608 INFO L158 Benchmark]: CACSL2BoogieTranslator took 461.34ms. Allocated memory is still 94.4MB. Free memory was 57.6MB in the beginning and 58.6MB in the end (delta: -1.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-21 15:07:04,608 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.58ms. Allocated memory is still 94.4MB. Free memory was 58.6MB in the beginning and 55.6MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-21 15:07:04,608 INFO L158 Benchmark]: Boogie Preprocessor took 56.01ms. Allocated memory is still 94.4MB. Free memory was 55.6MB in the beginning and 53.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-21 15:07:04,608 INFO L158 Benchmark]: RCFGBuilder took 803.52ms. Allocated memory was 94.4MB in the beginning and 113.2MB in the end (delta: 18.9MB). Free memory was 53.5MB in the beginning and 84.6MB in the end (delta: -31.1MB). Peak memory consumption was 40.3MB. Max. memory is 16.1GB. [2021-12-21 15:07:04,609 INFO L158 Benchmark]: TraceAbstraction took 3906.19ms. Allocated memory was 113.2MB in the beginning and 186.6MB in the end (delta: 73.4MB). Free memory was 84.6MB in the beginning and 132.7MB in the end (delta: -48.1MB). Peak memory consumption was 111.0MB. Max. memory is 16.1GB. [2021-12-21 15:07:04,609 INFO L158 Benchmark]: Witness Printer took 53.97ms. Allocated memory is still 186.6MB. Free memory was 131.7MB in the beginning and 114.9MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2021-12-21 15:07:04,610 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 94.4MB. Free memory was 65.7MB in the beginning and 65.7MB in the end (delta: 27.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 461.34ms. Allocated memory is still 94.4MB. Free memory was 57.6MB in the beginning and 58.6MB in the end (delta: -1.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.58ms. Allocated memory is still 94.4MB. Free memory was 58.6MB in the beginning and 55.6MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.01ms. Allocated memory is still 94.4MB. Free memory was 55.6MB in the beginning and 53.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 803.52ms. Allocated memory was 94.4MB in the beginning and 113.2MB in the end (delta: 18.9MB). Free memory was 53.5MB in the beginning and 84.6MB in the end (delta: -31.1MB). Peak memory consumption was 40.3MB. Max. memory is 16.1GB. * TraceAbstraction took 3906.19ms. Allocated memory was 113.2MB in the beginning and 186.6MB in the end (delta: 73.4MB). Free memory was 84.6MB in the beginning and 132.7MB in the end (delta: -48.1MB). Peak memory consumption was 111.0MB. Max. memory is 16.1GB. * Witness Printer took 53.97ms. Allocated memory is still 186.6MB. Free memory was 131.7MB in the beginning and 114.9MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L709] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0] [L710] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0] [L712] 0 int x = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L714] 0 int y = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L715] 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] [L716] 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] [L717] 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] [L718] 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] [L719] 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] [L720] 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_buff1_thd0=0] [L721] 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_buff1_thd0=0, y$r_buff1_thd1=0] [L722] 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L723] 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L724] 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L725] 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L726] 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L727] 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L728] 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L729] 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L730] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L790] 0 pthread_t t2473; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2473={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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L791] FCALL, FORK 0 pthread_create(&t2473, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2473, ((void *)0), P0, ((void *)0))=-1, t2473={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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L792] 0 pthread_t t2474; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2473={5:0}, t2474={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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L793] FCALL, FORK 0 pthread_create(&t2474, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2474, ((void *)0), P1, ((void *)0))=0, t2473={5:0}, t2474={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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L734] 1 y$w_buff1 = y$w_buff0 [L735] 1 y$w_buff0 = 2 [L736] 1 y$w_buff1_used = y$w_buff0_used [L737] 1 y$w_buff0_used = (_Bool)1 [L738] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L738] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L739] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L740] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L741] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L742] 1 y$r_buff0_thd1 = (_Bool)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=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L745] 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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L762] 2 x = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L765] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L768] 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) [L768] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L768] 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) [L768] 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) [L769] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L769] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L770] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L770] 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 [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L771] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L772] 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 [L748] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L748] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L749] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L749] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L750] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L750] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L751] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L751] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L752] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L752] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L755] 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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L795] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2473={5:0}, t2474={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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L797] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L797] RET 0 assume_abort_if_not(main$tmp_guard0) [L799] 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) [L799] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L799] 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) [L799] 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) [L800] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L800] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L801] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L801] 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 [L802] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L802] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L803] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L803] 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 [L806] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 0 y$flush_delayed = weak$$choice2 [L809] 0 y$mem_tmp = y [L810] 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) [L810] 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) [L811] 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)) [L811] 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) [L811] 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)) [L811] 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)) [L812] 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)) [L812] 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) [L812] 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)) [L812] 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)) [L813] 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)) [L813] 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) [L813] 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)) [L813] 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)) [L814] 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)) [L814] 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) [L814] 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)) [L814] 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)) [L815] 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)) [L815] 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) [L815] 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)) [L815] 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)) [L816] 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)) [L816] 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) [L816] 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)) [L816] 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)) [L817] 0 main$tmp_guard1 = !(x == 2 && y == 2) [L818] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L818] 0 y = y$flush_delayed ? y$mem_tmp : y [L819] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2473={5:0}, t2474={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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L821] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 791]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 793]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 111 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 3.7s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 362 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 362 mSDsluCounter, 385 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 557 mSDsCounter, 121 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 904 IncrementalHoareTripleChecker+Invalid, 1025 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 121 mSolverCounterUnsat, 81 mSDtfsCounter, 904 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 130 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=379occurred in iteration=7, InterpolantAutomatonStates: 104, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 709 NumberOfCodeBlocks, 709 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 627 ConstructedInterpolants, 0 QuantifiedInterpolants, 3017 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-12-21 15:07:04,651 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