./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/parallel-misc-4.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c3fed411 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/parallel-misc-4.wvr.c -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 4ed4cbcf73a390a7811d007883e420d1e9d8d4b9f5e59201847b4262dc4b0025 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-17 22:50:08,206 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-17 22:50:08,208 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-17 22:50:08,266 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-17 22:50:08,266 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-17 22:50:08,269 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-17 22:50:08,270 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-17 22:50:08,272 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-17 22:50:08,273 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-17 22:50:08,276 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-17 22:50:08,277 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-17 22:50:08,278 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-17 22:50:08,278 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-17 22:50:08,279 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-17 22:50:08,281 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-17 22:50:08,283 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-17 22:50:08,284 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-17 22:50:08,285 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-17 22:50:08,286 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-17 22:50:08,291 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-17 22:50:08,291 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-17 22:50:08,292 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-17 22:50:08,293 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-17 22:50:08,294 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-17 22:50:08,298 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-17 22:50:08,299 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-17 22:50:08,299 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-17 22:50:08,300 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-17 22:50:08,300 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-17 22:50:08,301 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-17 22:50:08,301 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-17 22:50:08,302 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-17 22:50:08,303 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-17 22:50:08,304 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-17 22:50:08,304 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-17 22:50:08,305 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-17 22:50:08,305 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-17 22:50:08,305 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-17 22:50:08,305 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-17 22:50:08,306 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-17 22:50:08,306 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-17 22:50:08,308 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-17 22:50:08,330 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-17 22:50:08,331 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-17 22:50:08,331 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-17 22:50:08,331 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-17 22:50:08,332 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-17 22:50:08,332 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-17 22:50:08,332 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-17 22:50:08,333 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-17 22:50:08,333 INFO L138 SettingsManager]: * Use SBE=true [2021-12-17 22:50:08,333 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-17 22:50:08,334 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-17 22:50:08,334 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-17 22:50:08,334 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-17 22:50:08,334 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-17 22:50:08,334 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-17 22:50:08,334 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-17 22:50:08,334 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-17 22:50:08,334 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-17 22:50:08,335 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-17 22:50:08,335 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-17 22:50:08,335 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-17 22:50:08,335 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-17 22:50:08,335 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-17 22:50:08,335 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-17 22:50:08,335 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 22:50:08,336 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-17 22:50:08,336 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-17 22:50:08,337 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-17 22:50:08,337 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-17 22:50:08,337 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-17 22:50:08,337 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-17 22:50:08,337 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-17 22:50:08,337 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-17 22:50:08,338 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-17 22:50:08,338 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 -> 4ed4cbcf73a390a7811d007883e420d1e9d8d4b9f5e59201847b4262dc4b0025 [2021-12-17 22:50:08,559 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-17 22:50:08,582 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-17 22:50:08,584 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-17 22:50:08,584 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-17 22:50:08,592 INFO L275 PluginConnector]: CDTParser initialized [2021-12-17 22:50:08,593 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel-misc-4.wvr.c [2021-12-17 22:50:08,640 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/049d546b6/d6f004768d6148a9adbf234dc5120c38/FLAGa4679bc37 [2021-12-17 22:50:08,971 INFO L306 CDTParser]: Found 1 translation units. [2021-12-17 22:50:08,971 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-misc-4.wvr.c [2021-12-17 22:50:08,979 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/049d546b6/d6f004768d6148a9adbf234dc5120c38/FLAGa4679bc37 [2021-12-17 22:50:09,418 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/049d546b6/d6f004768d6148a9adbf234dc5120c38 [2021-12-17 22:50:09,420 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-17 22:50:09,422 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-17 22:50:09,438 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-17 22:50:09,438 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-17 22:50:09,441 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-17 22:50:09,442 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 10:50:09" (1/1) ... [2021-12-17 22:50:09,442 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7dd0b5c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:50:09, skipping insertion in model container [2021-12-17 22:50:09,443 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 10:50:09" (1/1) ... [2021-12-17 22:50:09,447 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-17 22:50:09,462 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-17 22:50:09,603 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/weaver/parallel-misc-4.wvr.c[2950,2963] [2021-12-17 22:50:09,606 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 22:50:09,617 INFO L203 MainTranslator]: Completed pre-run [2021-12-17 22:50:09,649 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/weaver/parallel-misc-4.wvr.c[2950,2963] [2021-12-17 22:50:09,652 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 22:50:09,662 INFO L208 MainTranslator]: Completed translation [2021-12-17 22:50:09,662 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:50:09 WrapperNode [2021-12-17 22:50:09,662 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-17 22:50:09,663 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-17 22:50:09,663 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-17 22:50:09,663 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-17 22:50:09,668 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:50:09" (1/1) ... [2021-12-17 22:50:09,682 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:50:09" (1/1) ... [2021-12-17 22:50:09,702 INFO L137 Inliner]: procedures = 22, calls = 43, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 71 [2021-12-17 22:50:09,703 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-17 22:50:09,704 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-17 22:50:09,704 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-17 22:50:09,704 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-17 22:50:09,710 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:50:09" (1/1) ... [2021-12-17 22:50:09,710 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:50:09" (1/1) ... [2021-12-17 22:50:09,715 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:50:09" (1/1) ... [2021-12-17 22:50:09,715 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:50:09" (1/1) ... [2021-12-17 22:50:09,730 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:50:09" (1/1) ... [2021-12-17 22:50:09,734 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:50:09" (1/1) ... [2021-12-17 22:50:09,739 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:50:09" (1/1) ... [2021-12-17 22:50:09,741 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-17 22:50:09,744 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-17 22:50:09,745 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-17 22:50:09,745 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-17 22:50:09,746 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:50:09" (1/1) ... [2021-12-17 22:50:09,750 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 22:50:09,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 22:50:09,779 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-17 22:50:09,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-17 22:50:09,804 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-17 22:50:09,805 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-12-17 22:50:09,805 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-12-17 22:50:09,805 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-12-17 22:50:09,805 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-12-17 22:50:09,805 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2021-12-17 22:50:09,805 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2021-12-17 22:50:09,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-17 22:50:09,806 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-17 22:50:09,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-17 22:50:09,806 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-12-17 22:50:09,806 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-12-17 22:50:09,806 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-17 22:50:09,806 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-17 22:50:09,806 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-17 22:50:09,806 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-17 22:50:09,808 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-12-17 22:50:09,882 INFO L236 CfgBuilder]: Building ICFG [2021-12-17 22:50:09,884 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-17 22:50:10,044 INFO L277 CfgBuilder]: Performing block encoding [2021-12-17 22:50:10,061 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-17 22:50:10,061 INFO L301 CfgBuilder]: Removed 2 assume(true) statements. [2021-12-17 22:50:10,063 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 10:50:10 BoogieIcfgContainer [2021-12-17 22:50:10,063 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-17 22:50:10,064 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-17 22:50:10,064 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-17 22:50:10,081 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-17 22:50:10,081 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.12 10:50:09" (1/3) ... [2021-12-17 22:50:10,082 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66eae8f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 10:50:10, skipping insertion in model container [2021-12-17 22:50:10,082 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:50:09" (2/3) ... [2021-12-17 22:50:10,082 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66eae8f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 10:50:10, skipping insertion in model container [2021-12-17 22:50:10,082 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 10:50:10" (3/3) ... [2021-12-17 22:50:10,083 INFO L111 eAbstractionObserver]: Analyzing ICFG parallel-misc-4.wvr.c [2021-12-17 22:50:10,086 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-12-17 22:50:10,086 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-17 22:50:10,086 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-17 22:50:10,086 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-12-17 22:50:10,133 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~lv_assert~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:50:10,134 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~lv_assert~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:50:10,134 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~lv_assert~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:50:10,134 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~lv_assert~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:50:10,134 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~lv_assert~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:50:10,135 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~lv_assert~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:50:10,135 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:50:10,135 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:50:10,135 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:50:10,135 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:50:10,136 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:50:10,136 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:50:10,136 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:50:10,136 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:50:10,136 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~lv_assert~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:50:10,137 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~lv_assert~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:50:10,137 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~lv_assert~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:50:10,137 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~lv_assert~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:50:10,137 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~lv_assert~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:50:10,137 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~lv_assert~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:50:10,138 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~lv_assert~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:50:10,138 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~lv_assert~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:50:10,138 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:50:10,138 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:50:10,138 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:50:10,138 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:50:10,139 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~lv_assert~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:50:10,139 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~lv_assert~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:50:10,139 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:50:10,140 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:50:10,140 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:50:10,140 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:50:10,142 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:50:10,142 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:50:10,152 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:50:10,153 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~lv_assert~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:50:10,153 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:50:10,153 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:50:10,154 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:50:10,154 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:50:10,156 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~lv_assert~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:50:10,156 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:50:10,158 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2021-12-17 22:50:10,207 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-17 22:50:10,215 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-17 22:50:10,215 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2021-12-17 22:50:10,227 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 108 places, 105 transitions, 234 flow [2021-12-17 22:50:10,286 INFO L129 PetriNetUnfolder]: 7/102 cut-off events. [2021-12-17 22:50:10,286 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-12-17 22:50:10,289 INFO L84 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 102 events. 7/102 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 69 event pairs, 0 based on Foata normal form. 0/94 useless extension candidates. Maximal degree in co-relation 79. Up to 2 conditions per place. [2021-12-17 22:50:10,290 INFO L82 GeneralOperation]: Start removeDead. Operand has 108 places, 105 transitions, 234 flow [2021-12-17 22:50:10,294 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 94 places, 91 transitions, 200 flow [2021-12-17 22:50:10,315 INFO L129 PetriNetUnfolder]: 7/90 cut-off events. [2021-12-17 22:50:10,315 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-12-17 22:50:10,316 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:50:10,317 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 22:50:10,318 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-17 22:50:10,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:50:10,323 INFO L85 PathProgramCache]: Analyzing trace with hash 237529111, now seen corresponding path program 1 times [2021-12-17 22:50:10,330 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 22:50:10,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16231018] [2021-12-17 22:50:10,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:50:10,332 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 22:50:10,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:50:10,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 22:50:10,506 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 22:50:10,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16231018] [2021-12-17 22:50:10,506 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16231018] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 22:50:10,507 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 22:50:10,507 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-17 22:50:10,508 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336676151] [2021-12-17 22:50:10,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 22:50:10,515 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-17 22:50:10,515 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 22:50:10,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-17 22:50:10,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-17 22:50:10,548 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 105 [2021-12-17 22:50:10,552 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 91 transitions, 200 flow. Second operand has 2 states, 2 states have (on average 97.0) internal successors, (194), 2 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:50:10,552 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:50:10,553 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 105 [2021-12-17 22:50:10,554 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:50:10,615 INFO L129 PetriNetUnfolder]: 13/115 cut-off events. [2021-12-17 22:50:10,616 INFO L130 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2021-12-17 22:50:10,618 INFO L84 FinitePrefix]: Finished finitePrefix Result has 153 conditions, 115 events. 13/115 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 160 event pairs, 2 based on Foata normal form. 11/115 useless extension candidates. Maximal degree in co-relation 100. Up to 20 conditions per place. [2021-12-17 22:50:10,620 INFO L132 encePairwiseOnDemand]: 102/105 looper letters, 8 selfloop transitions, 0 changer transitions 1/88 dead transitions. [2021-12-17 22:50:10,620 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 88 transitions, 210 flow [2021-12-17 22:50:10,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-17 22:50:10,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2021-12-17 22:50:10,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 197 transitions. [2021-12-17 22:50:10,636 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9380952380952381 [2021-12-17 22:50:10,637 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 197 transitions. [2021-12-17 22:50:10,637 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 197 transitions. [2021-12-17 22:50:10,639 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 22:50:10,641 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 197 transitions. [2021-12-17 22:50:10,646 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 98.5) internal successors, (197), 2 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:50:10,651 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:50:10,652 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:50:10,653 INFO L186 Difference]: Start difference. First operand has 94 places, 91 transitions, 200 flow. Second operand 2 states and 197 transitions. [2021-12-17 22:50:10,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 88 transitions, 210 flow [2021-12-17 22:50:10,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 88 transitions, 198 flow, removed 0 selfloop flow, removed 6 redundant places. [2021-12-17 22:50:10,662 INFO L242 Difference]: Finished difference. Result has 89 places, 87 transitions, 180 flow [2021-12-17 22:50:10,664 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=180, PETRI_PLACES=89, PETRI_TRANSITIONS=87} [2021-12-17 22:50:10,669 INFO L334 CegarLoopForPetriNet]: 94 programPoint places, -5 predicate places. [2021-12-17 22:50:10,669 INFO L470 AbstractCegarLoop]: Abstraction has has 89 places, 87 transitions, 180 flow [2021-12-17 22:50:10,670 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 97.0) internal successors, (194), 2 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:50:10,670 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:50:10,670 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 22:50:10,671 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-17 22:50:10,671 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-17 22:50:10,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:50:10,672 INFO L85 PathProgramCache]: Analyzing trace with hash -771818347, now seen corresponding path program 1 times [2021-12-17 22:50:10,672 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 22:50:10,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025982152] [2021-12-17 22:50:10,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:50:10,672 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 22:50:10,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:50:10,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 22:50:10,950 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 22:50:10,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025982152] [2021-12-17 22:50:10,951 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025982152] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 22:50:10,951 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 22:50:10,951 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-17 22:50:10,952 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464745833] [2021-12-17 22:50:10,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 22:50:10,953 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-17 22:50:10,953 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 22:50:10,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-17 22:50:10,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-17 22:50:10,959 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 105 [2021-12-17 22:50:10,960 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 87 transitions, 180 flow. Second operand has 6 states, 6 states have (on average 81.66666666666667) internal successors, (490), 6 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:50:10,960 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:50:10,960 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 105 [2021-12-17 22:50:10,960 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:50:11,120 INFO L129 PetriNetUnfolder]: 79/268 cut-off events. [2021-12-17 22:50:11,120 INFO L130 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2021-12-17 22:50:11,122 INFO L84 FinitePrefix]: Finished finitePrefix Result has 405 conditions, 268 events. 79/268 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 949 event pairs, 9 based on Foata normal form. 0/241 useless extension candidates. Maximal degree in co-relation 402. Up to 53 conditions per place. [2021-12-17 22:50:11,123 INFO L132 encePairwiseOnDemand]: 99/105 looper letters, 30 selfloop transitions, 6 changer transitions 0/102 dead transitions. [2021-12-17 22:50:11,123 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 102 transitions, 285 flow [2021-12-17 22:50:11,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-17 22:50:11,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-12-17 22:50:11,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 511 transitions. [2021-12-17 22:50:11,127 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8111111111111111 [2021-12-17 22:50:11,127 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 511 transitions. [2021-12-17 22:50:11,127 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 511 transitions. [2021-12-17 22:50:11,127 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 22:50:11,128 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 511 transitions. [2021-12-17 22:50:11,129 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 85.16666666666667) internal successors, (511), 6 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:50:11,130 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 105.0) internal successors, (735), 7 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:50:11,131 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 105.0) internal successors, (735), 7 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:50:11,131 INFO L186 Difference]: Start difference. First operand has 89 places, 87 transitions, 180 flow. Second operand 6 states and 511 transitions. [2021-12-17 22:50:11,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 102 transitions, 285 flow [2021-12-17 22:50:11,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 102 transitions, 285 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-12-17 22:50:11,134 INFO L242 Difference]: Finished difference. Result has 95 places, 89 transitions, 205 flow [2021-12-17 22:50:11,134 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=205, PETRI_PLACES=95, PETRI_TRANSITIONS=89} [2021-12-17 22:50:11,135 INFO L334 CegarLoopForPetriNet]: 94 programPoint places, 1 predicate places. [2021-12-17 22:50:11,135 INFO L470 AbstractCegarLoop]: Abstraction has has 95 places, 89 transitions, 205 flow [2021-12-17 22:50:11,135 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 81.66666666666667) internal successors, (490), 6 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:50:11,136 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:50:11,136 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 22:50:11,136 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-17 22:50:11,136 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-17 22:50:11,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:50:11,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1417648341, now seen corresponding path program 2 times [2021-12-17 22:50:11,137 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 22:50:11,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406842988] [2021-12-17 22:50:11,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:50:11,138 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 22:50:11,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:50:11,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 22:50:11,289 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 22:50:11,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406842988] [2021-12-17 22:50:11,289 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406842988] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 22:50:11,289 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 22:50:11,290 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-17 22:50:11,290 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075941902] [2021-12-17 22:50:11,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 22:50:11,290 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-17 22:50:11,291 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 22:50:11,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-17 22:50:11,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-17 22:50:11,293 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 105 [2021-12-17 22:50:11,293 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 89 transitions, 205 flow. Second operand has 6 states, 6 states have (on average 81.66666666666667) internal successors, (490), 6 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:50:11,294 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:50:11,294 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 105 [2021-12-17 22:50:11,294 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:50:11,416 INFO L129 PetriNetUnfolder]: 64/245 cut-off events. [2021-12-17 22:50:11,417 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2021-12-17 22:50:11,418 INFO L84 FinitePrefix]: Finished finitePrefix Result has 405 conditions, 245 events. 64/245 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 838 event pairs, 12 based on Foata normal form. 0/223 useless extension candidates. Maximal degree in co-relation 399. Up to 46 conditions per place. [2021-12-17 22:50:11,420 INFO L132 encePairwiseOnDemand]: 99/105 looper letters, 27 selfloop transitions, 8 changer transitions 0/101 dead transitions. [2021-12-17 22:50:11,420 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 101 transitions, 311 flow [2021-12-17 22:50:11,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-17 22:50:11,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-12-17 22:50:11,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 508 transitions. [2021-12-17 22:50:11,422 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8063492063492064 [2021-12-17 22:50:11,422 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 508 transitions. [2021-12-17 22:50:11,423 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 508 transitions. [2021-12-17 22:50:11,423 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 22:50:11,423 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 508 transitions. [2021-12-17 22:50:11,424 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 84.66666666666667) internal successors, (508), 6 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:50:11,426 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 105.0) internal successors, (735), 7 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:50:11,427 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 105.0) internal successors, (735), 7 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:50:11,427 INFO L186 Difference]: Start difference. First operand has 95 places, 89 transitions, 205 flow. Second operand 6 states and 508 transitions. [2021-12-17 22:50:11,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 101 transitions, 311 flow [2021-12-17 22:50:11,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 101 transitions, 302 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-12-17 22:50:11,430 INFO L242 Difference]: Finished difference. Result has 99 places, 92 transitions, 235 flow [2021-12-17 22:50:11,430 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=235, PETRI_PLACES=99, PETRI_TRANSITIONS=92} [2021-12-17 22:50:11,431 INFO L334 CegarLoopForPetriNet]: 94 programPoint places, 5 predicate places. [2021-12-17 22:50:11,431 INFO L470 AbstractCegarLoop]: Abstraction has has 99 places, 92 transitions, 235 flow [2021-12-17 22:50:11,432 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 81.66666666666667) internal successors, (490), 6 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:50:11,432 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:50:11,432 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 22:50:11,432 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-17 22:50:11,432 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-17 22:50:11,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:50:11,433 INFO L85 PathProgramCache]: Analyzing trace with hash 411281951, now seen corresponding path program 3 times [2021-12-17 22:50:11,433 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 22:50:11,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821912826] [2021-12-17 22:50:11,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:50:11,434 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 22:50:11,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:50:11,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 22:50:11,569 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 22:50:11,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821912826] [2021-12-17 22:50:11,569 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821912826] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 22:50:11,570 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 22:50:11,570 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-17 22:50:11,570 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128469365] [2021-12-17 22:50:11,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 22:50:11,571 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-17 22:50:11,571 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 22:50:11,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-17 22:50:11,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-12-17 22:50:11,573 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 105 [2021-12-17 22:50:11,574 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 92 transitions, 235 flow. Second operand has 7 states, 7 states have (on average 81.28571428571429) internal successors, (569), 7 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:50:11,574 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:50:11,574 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 105 [2021-12-17 22:50:11,574 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:50:11,689 INFO L129 PetriNetUnfolder]: 60/211 cut-off events. [2021-12-17 22:50:11,689 INFO L130 PetriNetUnfolder]: For 60/60 co-relation queries the response was YES. [2021-12-17 22:50:11,690 INFO L84 FinitePrefix]: Finished finitePrefix Result has 401 conditions, 211 events. 60/211 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 621 event pairs, 1 based on Foata normal form. 2/191 useless extension candidates. Maximal degree in co-relation 393. Up to 46 conditions per place. [2021-12-17 22:50:11,691 INFO L132 encePairwiseOnDemand]: 97/105 looper letters, 28 selfloop transitions, 10 changer transitions 0/104 dead transitions. [2021-12-17 22:50:11,691 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 104 transitions, 343 flow [2021-12-17 22:50:11,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-17 22:50:11,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-12-17 22:50:11,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 590 transitions. [2021-12-17 22:50:11,692 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8027210884353742 [2021-12-17 22:50:11,692 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 590 transitions. [2021-12-17 22:50:11,692 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 590 transitions. [2021-12-17 22:50:11,692 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 22:50:11,692 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 590 transitions. [2021-12-17 22:50:11,693 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 84.28571428571429) internal successors, (590), 7 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:50:11,694 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 105.0) internal successors, (840), 8 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:50:11,695 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 105.0) internal successors, (840), 8 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:50:11,695 INFO L186 Difference]: Start difference. First operand has 99 places, 92 transitions, 235 flow. Second operand 7 states and 590 transitions. [2021-12-17 22:50:11,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 104 transitions, 343 flow [2021-12-17 22:50:11,696 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 104 transitions, 334 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-12-17 22:50:11,698 INFO L242 Difference]: Finished difference. Result has 104 places, 94 transitions, 265 flow [2021-12-17 22:50:11,698 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=265, PETRI_PLACES=104, PETRI_TRANSITIONS=94} [2021-12-17 22:50:11,699 INFO L334 CegarLoopForPetriNet]: 94 programPoint places, 10 predicate places. [2021-12-17 22:50:11,699 INFO L470 AbstractCegarLoop]: Abstraction has has 104 places, 94 transitions, 265 flow [2021-12-17 22:50:11,700 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 81.28571428571429) internal successors, (569), 7 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:50:11,700 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:50:11,700 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 22:50:11,700 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-17 22:50:11,700 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-17 22:50:11,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:50:11,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1786478961, now seen corresponding path program 4 times [2021-12-17 22:50:11,701 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 22:50:11,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929869097] [2021-12-17 22:50:11,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:50:11,702 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 22:50:11,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:50:11,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 22:50:11,816 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 22:50:11,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929869097] [2021-12-17 22:50:11,816 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929869097] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 22:50:11,816 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 22:50:11,816 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-17 22:50:11,817 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865208292] [2021-12-17 22:50:11,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 22:50:11,817 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-17 22:50:11,817 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 22:50:11,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-17 22:50:11,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-17 22:50:11,819 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 105 [2021-12-17 22:50:11,819 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 94 transitions, 265 flow. Second operand has 7 states, 7 states have (on average 77.57142857142857) internal successors, (543), 7 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:50:11,819 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:50:11,819 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 105 [2021-12-17 22:50:11,819 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:50:11,965 INFO L129 PetriNetUnfolder]: 224/620 cut-off events. [2021-12-17 22:50:11,965 INFO L130 PetriNetUnfolder]: For 360/360 co-relation queries the response was YES. [2021-12-17 22:50:11,966 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1267 conditions, 620 events. 224/620 cut-off events. For 360/360 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 3300 event pairs, 41 based on Foata normal form. 6/574 useless extension candidates. Maximal degree in co-relation 1258. Up to 157 conditions per place. [2021-12-17 22:50:11,968 INFO L132 encePairwiseOnDemand]: 94/105 looper letters, 35 selfloop transitions, 7 changer transitions 38/142 dead transitions. [2021-12-17 22:50:11,968 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 142 transitions, 598 flow [2021-12-17 22:50:11,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-17 22:50:11,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-17 22:50:11,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 748 transitions. [2021-12-17 22:50:11,970 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7915343915343915 [2021-12-17 22:50:11,970 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 748 transitions. [2021-12-17 22:50:11,970 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 748 transitions. [2021-12-17 22:50:11,970 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 22:50:11,970 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 748 transitions. [2021-12-17 22:50:11,972 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 83.11111111111111) internal successors, (748), 9 states have internal predecessors, (748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:50:11,973 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 105.0) internal successors, (1050), 10 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:50:11,973 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 105.0) internal successors, (1050), 10 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:50:11,973 INFO L186 Difference]: Start difference. First operand has 104 places, 94 transitions, 265 flow. Second operand 9 states and 748 transitions. [2021-12-17 22:50:11,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 142 transitions, 598 flow [2021-12-17 22:50:11,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 142 transitions, 582 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-12-17 22:50:11,977 INFO L242 Difference]: Finished difference. Result has 113 places, 95 transitions, 299 flow [2021-12-17 22:50:11,977 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=254, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=299, PETRI_PLACES=113, PETRI_TRANSITIONS=95} [2021-12-17 22:50:11,977 INFO L334 CegarLoopForPetriNet]: 94 programPoint places, 19 predicate places. [2021-12-17 22:50:11,977 INFO L470 AbstractCegarLoop]: Abstraction has has 113 places, 95 transitions, 299 flow [2021-12-17 22:50:11,978 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 77.57142857142857) internal successors, (543), 7 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:50:11,978 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:50:11,978 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 22:50:11,978 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-17 22:50:11,978 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-17 22:50:11,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:50:11,979 INFO L85 PathProgramCache]: Analyzing trace with hash -2074634458, now seen corresponding path program 1 times [2021-12-17 22:50:11,979 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 22:50:11,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491933524] [2021-12-17 22:50:11,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:50:11,979 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 22:50:11,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:50:12,031 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 22:50:12,032 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 22:50:12,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491933524] [2021-12-17 22:50:12,032 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491933524] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 22:50:12,032 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 22:50:12,032 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-17 22:50:12,032 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164436333] [2021-12-17 22:50:12,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 22:50:12,033 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-17 22:50:12,033 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 22:50:12,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-17 22:50:12,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-17 22:50:12,034 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 105 [2021-12-17 22:50:12,035 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 95 transitions, 299 flow. Second operand has 5 states, 5 states have (on average 84.4) internal successors, (422), 5 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:50:12,035 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:50:12,035 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 105 [2021-12-17 22:50:12,035 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:50:12,149 INFO L129 PetriNetUnfolder]: 242/632 cut-off events. [2021-12-17 22:50:12,149 INFO L130 PetriNetUnfolder]: For 671/671 co-relation queries the response was YES. [2021-12-17 22:50:12,151 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1524 conditions, 632 events. 242/632 cut-off events. For 671/671 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3194 event pairs, 5 based on Foata normal form. 15/592 useless extension candidates. Maximal degree in co-relation 1509. Up to 125 conditions per place. [2021-12-17 22:50:12,153 INFO L132 encePairwiseOnDemand]: 96/105 looper letters, 51 selfloop transitions, 22 changer transitions 1/142 dead transitions. [2021-12-17 22:50:12,153 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 142 transitions, 684 flow [2021-12-17 22:50:12,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-17 22:50:12,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-12-17 22:50:12,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 632 transitions. [2021-12-17 22:50:12,155 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8598639455782313 [2021-12-17 22:50:12,155 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 632 transitions. [2021-12-17 22:50:12,155 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 632 transitions. [2021-12-17 22:50:12,155 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 22:50:12,156 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 632 transitions. [2021-12-17 22:50:12,157 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 90.28571428571429) internal successors, (632), 7 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:50:12,157 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 105.0) internal successors, (840), 8 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:50:12,158 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 105.0) internal successors, (840), 8 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:50:12,158 INFO L186 Difference]: Start difference. First operand has 113 places, 95 transitions, 299 flow. Second operand 7 states and 632 transitions. [2021-12-17 22:50:12,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 142 transitions, 684 flow [2021-12-17 22:50:12,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 142 transitions, 658 flow, removed 8 selfloop flow, removed 5 redundant places. [2021-12-17 22:50:12,162 INFO L242 Difference]: Finished difference. Result has 116 places, 113 transitions, 504 flow [2021-12-17 22:50:12,163 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=504, PETRI_PLACES=116, PETRI_TRANSITIONS=113} [2021-12-17 22:50:12,163 INFO L334 CegarLoopForPetriNet]: 94 programPoint places, 22 predicate places. [2021-12-17 22:50:12,163 INFO L470 AbstractCegarLoop]: Abstraction has has 116 places, 113 transitions, 504 flow [2021-12-17 22:50:12,163 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 84.4) internal successors, (422), 5 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:50:12,164 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:50:12,164 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 22:50:12,164 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-17 22:50:12,164 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-17 22:50:12,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:50:12,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1048037250, now seen corresponding path program 2 times [2021-12-17 22:50:12,165 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 22:50:12,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261752162] [2021-12-17 22:50:12,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:50:12,165 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 22:50:12,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:50:12,219 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 22:50:12,220 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 22:50:12,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261752162] [2021-12-17 22:50:12,220 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261752162] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 22:50:12,220 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 22:50:12,220 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-17 22:50:12,221 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063420046] [2021-12-17 22:50:12,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 22:50:12,221 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-17 22:50:12,221 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 22:50:12,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-17 22:50:12,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-17 22:50:12,222 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 105 [2021-12-17 22:50:12,223 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 113 transitions, 504 flow. Second operand has 5 states, 5 states have (on average 84.4) internal successors, (422), 5 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:50:12,223 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:50:12,223 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 105 [2021-12-17 22:50:12,223 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:50:12,386 INFO L129 PetriNetUnfolder]: 414/1064 cut-off events. [2021-12-17 22:50:12,386 INFO L130 PetriNetUnfolder]: For 2505/2507 co-relation queries the response was YES. [2021-12-17 22:50:12,390 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3275 conditions, 1064 events. 414/1064 cut-off events. For 2505/2507 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 6429 event pairs, 3 based on Foata normal form. 12/985 useless extension candidates. Maximal degree in co-relation 3257. Up to 173 conditions per place. [2021-12-17 22:50:12,395 INFO L132 encePairwiseOnDemand]: 96/105 looper letters, 82 selfloop transitions, 44 changer transitions 0/194 dead transitions. [2021-12-17 22:50:12,395 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 194 transitions, 1355 flow [2021-12-17 22:50:12,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-17 22:50:12,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-17 22:50:12,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 812 transitions. [2021-12-17 22:50:12,397 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8592592592592593 [2021-12-17 22:50:12,397 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 812 transitions. [2021-12-17 22:50:12,397 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 812 transitions. [2021-12-17 22:50:12,397 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 22:50:12,397 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 812 transitions. [2021-12-17 22:50:12,399 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 90.22222222222223) internal successors, (812), 9 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:50:12,400 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 105.0) internal successors, (1050), 10 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:50:12,400 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 105.0) internal successors, (1050), 10 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:50:12,400 INFO L186 Difference]: Start difference. First operand has 116 places, 113 transitions, 504 flow. Second operand 9 states and 812 transitions. [2021-12-17 22:50:12,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 194 transitions, 1355 flow [2021-12-17 22:50:12,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 194 transitions, 1355 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-12-17 22:50:12,408 INFO L242 Difference]: Finished difference. Result has 130 places, 141 transitions, 960 flow [2021-12-17 22:50:12,408 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=504, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=960, PETRI_PLACES=130, PETRI_TRANSITIONS=141} [2021-12-17 22:50:12,409 INFO L334 CegarLoopForPetriNet]: 94 programPoint places, 36 predicate places. [2021-12-17 22:50:12,409 INFO L470 AbstractCegarLoop]: Abstraction has has 130 places, 141 transitions, 960 flow [2021-12-17 22:50:12,409 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 84.4) internal successors, (422), 5 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:50:12,409 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:50:12,410 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 22:50:12,410 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-17 22:50:12,410 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-17 22:50:12,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:50:12,410 INFO L85 PathProgramCache]: Analyzing trace with hash -1733351978, now seen corresponding path program 3 times [2021-12-17 22:50:12,411 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 22:50:12,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710315344] [2021-12-17 22:50:12,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:50:12,411 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 22:50:12,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:50:12,485 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 22:50:12,485 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 22:50:12,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710315344] [2021-12-17 22:50:12,486 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710315344] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 22:50:12,486 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 22:50:12,486 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-17 22:50:12,486 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717666638] [2021-12-17 22:50:12,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 22:50:12,486 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-17 22:50:12,487 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 22:50:12,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-17 22:50:12,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-17 22:50:12,488 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 105 [2021-12-17 22:50:12,488 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 141 transitions, 960 flow. Second operand has 5 states, 5 states have (on average 84.4) internal successors, (422), 5 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:50:12,488 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:50:12,488 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 105 [2021-12-17 22:50:12,488 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:50:12,752 INFO L129 PetriNetUnfolder]: 770/1833 cut-off events. [2021-12-17 22:50:12,752 INFO L130 PetriNetUnfolder]: For 9138/9195 co-relation queries the response was YES. [2021-12-17 22:50:12,758 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7206 conditions, 1833 events. 770/1833 cut-off events. For 9138/9195 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 12727 event pairs, 46 based on Foata normal form. 35/1726 useless extension candidates. Maximal degree in co-relation 7181. Up to 453 conditions per place. [2021-12-17 22:50:12,771 INFO L132 encePairwiseOnDemand]: 96/105 looper letters, 113 selfloop transitions, 75 changer transitions 30/286 dead transitions. [2021-12-17 22:50:12,772 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 286 transitions, 2973 flow [2021-12-17 22:50:12,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-17 22:50:12,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-17 22:50:12,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 810 transitions. [2021-12-17 22:50:12,774 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8571428571428571 [2021-12-17 22:50:12,774 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 810 transitions. [2021-12-17 22:50:12,774 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 810 transitions. [2021-12-17 22:50:12,774 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 22:50:12,775 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 810 transitions. [2021-12-17 22:50:12,779 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 90.0) internal successors, (810), 9 states have internal predecessors, (810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:50:12,780 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 105.0) internal successors, (1050), 10 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:50:12,781 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 105.0) internal successors, (1050), 10 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:50:12,781 INFO L186 Difference]: Start difference. First operand has 130 places, 141 transitions, 960 flow. Second operand 9 states and 810 transitions. [2021-12-17 22:50:12,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 286 transitions, 2973 flow [2021-12-17 22:50:12,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 286 transitions, 2933 flow, removed 20 selfloop flow, removed 0 redundant places. [2021-12-17 22:50:12,803 INFO L242 Difference]: Finished difference. Result has 146 places, 193 transitions, 1992 flow [2021-12-17 22:50:12,803 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=950, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1992, PETRI_PLACES=146, PETRI_TRANSITIONS=193} [2021-12-17 22:50:12,805 INFO L334 CegarLoopForPetriNet]: 94 programPoint places, 52 predicate places. [2021-12-17 22:50:12,805 INFO L470 AbstractCegarLoop]: Abstraction has has 146 places, 193 transitions, 1992 flow [2021-12-17 22:50:12,806 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 84.4) internal successors, (422), 5 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:50:12,806 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:50:12,807 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 22:50:12,807 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-17 22:50:12,807 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-17 22:50:12,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:50:12,807 INFO L85 PathProgramCache]: Analyzing trace with hash 266266506, now seen corresponding path program 4 times [2021-12-17 22:50:12,808 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 22:50:12,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329163134] [2021-12-17 22:50:12,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:50:12,808 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 22:50:12,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:50:12,882 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 22:50:12,882 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 22:50:12,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329163134] [2021-12-17 22:50:12,882 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329163134] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 22:50:12,882 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 22:50:12,883 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-17 22:50:12,883 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977501171] [2021-12-17 22:50:12,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 22:50:12,883 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-17 22:50:12,883 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 22:50:12,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-17 22:50:12,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-17 22:50:12,884 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 105 [2021-12-17 22:50:12,885 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 193 transitions, 1992 flow. Second operand has 5 states, 5 states have (on average 86.0) internal successors, (430), 5 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:50:12,885 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:50:12,885 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 105 [2021-12-17 22:50:12,885 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:50:12,991 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([247] L59-->L46: Formula: (not (= 0 (mod v_thread1Thread1of1ForFork1_~lv_assert~0_5 256))) InVars {thread1Thread1of1ForFork1_~lv_assert~0=v_thread1Thread1of1ForFork1_~lv_assert~0_5} OutVars{thread1Thread1of1ForFork1_~lv_assert~0=v_thread1Thread1of1ForFork1_~lv_assert~0_5} AuxVars[] AssignedVars[][95], [Black: 175#true, 111#true, 56#L83true, Black: 131#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1))), Black: 201#(and (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (= ~v_assert~0 thread1Thread1of1ForFork1_~lv_assert~0)), Black: 205#(and (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) thread1Thread1of1ForFork1_~lv_assert~0) (+ thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)))) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 195#(= ~v_assert~0 thread1Thread1of1ForFork1_~lv_assert~0), 183#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (= ~v_assert~0 thread1Thread1of1ForFork1_~lv_assert~0)), Black: 199#(and (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) thread1Thread1of1ForFork1_~lv_assert~0) (+ thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)))) (= ~v_assert~0 thread1Thread1of1ForFork1_~lv_assert~0)), Black: 196#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) thread1Thread1of1ForFork1_~lv_assert~0) (+ thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)))), Black: 146#(<= (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) 1) thread1Thread1of1ForFork1_~lv_assert~0), 7#L46true, Black: 140#true, 223#(and (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) thread1Thread1of1ForFork1_~lv_assert~0) (+ thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)))) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 221#(and (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 213#true, Black: 215#(= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1), Black: 216#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) thread1Thread1of1ForFork1_~lv_assert~0) (+ thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)))), Black: 228#(and (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) thread1Thread1of1ForFork1_~lv_assert~0) (+ thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)))) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 164#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 166#(and (<= 1 thread1Thread1of1ForFork1_~lv_assert~0) (<= (div thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 219#(and (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) thread1Thread1of1ForFork1_~lv_assert~0) (+ thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256))))), Black: 217#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), 203#(and (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) thread1Thread1of1ForFork1_~lv_assert~0) (+ thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)))) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (= ~v_assert~0 thread1Thread1of1ForFork1_~lv_assert~0)), Black: 158#(<= 0 ~pos~0), 150#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (= ~v_assert~0 thread1Thread1of1ForFork1_~lv_assert~0)), 25#L110-4true, 123#(and (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1))), 238#true, Black: 177#(= ~v_assert~0 thread1Thread1of1ForFork1_~lv_assert~0), Black: 179#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), Black: 118#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1))), Black: 185#(and (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (= ~v_assert~0 thread1Thread1of1ForFork1_~lv_assert~0)), Black: 181#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (= ~v_assert~0 thread1Thread1of1ForFork1_~lv_assert~0))]) [2021-12-17 22:50:12,992 INFO L384 tUnfolder$Statistics]: this new event has 62 ancestors and is cut-off event [2021-12-17 22:50:12,992 INFO L387 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2021-12-17 22:50:12,992 INFO L387 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2021-12-17 22:50:12,992 INFO L387 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2021-12-17 22:50:13,064 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([268] thread3ENTRY-->L92: Formula: (= v_~v_assert~0_5 (ite (= 0 (ite (<= 0 v_~pos~0_9) 1 0)) 0 1)) InVars {~pos~0=v_~pos~0_9} OutVars{~v_assert~0=v_~v_assert~0_5, ~pos~0=v_~pos~0_9} AuxVars[] AssignedVars[~v_assert~0][117], [Black: 175#true, 111#true, 30#L59true, Black: 136#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (= ~v_assert~0 thread1Thread1of1ForFork1_~lv_assert~0)), 56#L83true, Black: 131#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1))), Black: 201#(and (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (= ~v_assert~0 thread1Thread1of1ForFork1_~lv_assert~0)), Black: 205#(and (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) thread1Thread1of1ForFork1_~lv_assert~0) (+ thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)))) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 195#(= ~v_assert~0 thread1Thread1of1ForFork1_~lv_assert~0), Black: 199#(and (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) thread1Thread1of1ForFork1_~lv_assert~0) (+ thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)))) (= ~v_assert~0 thread1Thread1of1ForFork1_~lv_assert~0)), Black: 203#(and (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) thread1Thread1of1ForFork1_~lv_assert~0) (+ thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)))) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (= ~v_assert~0 thread1Thread1of1ForFork1_~lv_assert~0)), Black: 140#true, 228#(and (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) thread1Thread1of1ForFork1_~lv_assert~0) (+ thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)))) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), 196#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) thread1Thread1of1ForFork1_~lv_assert~0) (+ thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)))), Black: 221#(and (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 213#true, Black: 215#(= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1), Black: 216#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) thread1Thread1of1ForFork1_~lv_assert~0) (+ thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)))), Black: 164#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 223#(and (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) thread1Thread1of1ForFork1_~lv_assert~0) (+ thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)))) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 166#(and (<= 1 thread1Thread1of1ForFork1_~lv_assert~0) (<= (div thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 219#(and (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) thread1Thread1of1ForFork1_~lv_assert~0) (+ thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256))))), Black: 217#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), Black: 158#(<= 0 ~pos~0), 5#L111-4true, 146#(<= (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) 1) thread1Thread1of1ForFork1_~lv_assert~0), 179#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), 28#L92true, 238#true, Black: 183#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (= ~v_assert~0 thread1Thread1of1ForFork1_~lv_assert~0)), Black: 177#(= ~v_assert~0 thread1Thread1of1ForFork1_~lv_assert~0), Black: 123#(and (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1))), Black: 118#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1))), Black: 185#(and (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (= ~v_assert~0 thread1Thread1of1ForFork1_~lv_assert~0)), Black: 181#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (= ~v_assert~0 thread1Thread1of1ForFork1_~lv_assert~0))]) [2021-12-17 22:50:13,065 INFO L384 tUnfolder$Statistics]: this new event has 68 ancestors and is cut-off event [2021-12-17 22:50:13,065 INFO L387 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2021-12-17 22:50:13,065 INFO L387 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2021-12-17 22:50:13,065 INFO L387 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2021-12-17 22:50:13,065 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([247] L59-->L46: Formula: (not (= 0 (mod v_thread1Thread1of1ForFork1_~lv_assert~0_5 256))) InVars {thread1Thread1of1ForFork1_~lv_assert~0=v_thread1Thread1of1ForFork1_~lv_assert~0_5} OutVars{thread1Thread1of1ForFork1_~lv_assert~0=v_thread1Thread1of1ForFork1_~lv_assert~0_5} AuxVars[] AssignedVars[][95], [Black: 175#true, 111#true, 56#L83true, Black: 131#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1))), Black: 201#(and (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (= ~v_assert~0 thread1Thread1of1ForFork1_~lv_assert~0)), Black: 205#(and (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) thread1Thread1of1ForFork1_~lv_assert~0) (+ thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)))) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), 183#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (= ~v_assert~0 thread1Thread1of1ForFork1_~lv_assert~0)), Black: 195#(= ~v_assert~0 thread1Thread1of1ForFork1_~lv_assert~0), Black: 199#(and (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) thread1Thread1of1ForFork1_~lv_assert~0) (+ thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)))) (= ~v_assert~0 thread1Thread1of1ForFork1_~lv_assert~0)), Black: 196#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) thread1Thread1of1ForFork1_~lv_assert~0) (+ thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)))), Black: 146#(<= (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) 1) thread1Thread1of1ForFork1_~lv_assert~0), 7#L46true, Black: 140#true, 223#(and (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) thread1Thread1of1ForFork1_~lv_assert~0) (+ thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)))) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 221#(and (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 213#true, 73#thread3ENTRYtrue, Black: 215#(= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1), Black: 216#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) thread1Thread1of1ForFork1_~lv_assert~0) (+ thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)))), Black: 228#(and (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) thread1Thread1of1ForFork1_~lv_assert~0) (+ thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)))) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 164#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 166#(and (<= 1 thread1Thread1of1ForFork1_~lv_assert~0) (<= (div thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 219#(and (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) thread1Thread1of1ForFork1_~lv_assert~0) (+ thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256))))), Black: 217#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), 203#(and (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) thread1Thread1of1ForFork1_~lv_assert~0) (+ thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)))) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (= ~v_assert~0 thread1Thread1of1ForFork1_~lv_assert~0)), Black: 158#(<= 0 ~pos~0), 150#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (= ~v_assert~0 thread1Thread1of1ForFork1_~lv_assert~0)), 5#L111-4true, 123#(and (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1))), 238#true, Black: 177#(= ~v_assert~0 thread1Thread1of1ForFork1_~lv_assert~0), Black: 179#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), Black: 185#(and (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (= ~v_assert~0 thread1Thread1of1ForFork1_~lv_assert~0)), Black: 118#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1))), Black: 181#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (= ~v_assert~0 thread1Thread1of1ForFork1_~lv_assert~0))]) [2021-12-17 22:50:13,065 INFO L384 tUnfolder$Statistics]: this new event has 68 ancestors and is cut-off event [2021-12-17 22:50:13,066 INFO L387 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2021-12-17 22:50:13,066 INFO L387 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2021-12-17 22:50:13,066 INFO L387 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2021-12-17 22:50:13,127 INFO L129 PetriNetUnfolder]: 514/1577 cut-off events. [2021-12-17 22:50:13,127 INFO L130 PetriNetUnfolder]: For 11095/11792 co-relation queries the response was YES. [2021-12-17 22:50:13,136 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6463 conditions, 1577 events. 514/1577 cut-off events. For 11095/11792 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 12409 event pairs, 54 based on Foata normal form. 64/1514 useless extension candidates. Maximal degree in co-relation 6430. Up to 248 conditions per place. [2021-12-17 22:50:13,143 INFO L132 encePairwiseOnDemand]: 99/105 looper letters, 20 selfloop transitions, 5 changer transitions 0/193 dead transitions. [2021-12-17 22:50:13,143 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 193 transitions, 1953 flow [2021-12-17 22:50:13,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-17 22:50:13,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-12-17 22:50:13,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 440 transitions. [2021-12-17 22:50:13,145 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8380952380952381 [2021-12-17 22:50:13,145 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 440 transitions. [2021-12-17 22:50:13,145 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 440 transitions. [2021-12-17 22:50:13,145 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 22:50:13,145 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 440 transitions. [2021-12-17 22:50:13,146 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 88.0) internal successors, (440), 5 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:50:13,147 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 105.0) internal successors, (630), 6 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:50:13,147 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 105.0) internal successors, (630), 6 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:50:13,147 INFO L186 Difference]: Start difference. First operand has 146 places, 193 transitions, 1992 flow. Second operand 5 states and 440 transitions. [2021-12-17 22:50:13,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 193 transitions, 1953 flow [2021-12-17 22:50:13,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 193 transitions, 1913 flow, removed 20 selfloop flow, removed 0 redundant places. [2021-12-17 22:50:13,197 INFO L242 Difference]: Finished difference. Result has 152 places, 188 transitions, 1870 flow [2021-12-17 22:50:13,197 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=1844, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1870, PETRI_PLACES=152, PETRI_TRANSITIONS=188} [2021-12-17 22:50:13,198 INFO L334 CegarLoopForPetriNet]: 94 programPoint places, 58 predicate places. [2021-12-17 22:50:13,198 INFO L470 AbstractCegarLoop]: Abstraction has has 152 places, 188 transitions, 1870 flow [2021-12-17 22:50:13,199 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 86.0) internal successors, (430), 5 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:50:13,199 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:50:13,199 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 22:50:13,199 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-17 22:50:13,199 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-17 22:50:13,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:50:13,200 INFO L85 PathProgramCache]: Analyzing trace with hash 398857980, now seen corresponding path program 1 times [2021-12-17 22:50:13,200 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 22:50:13,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583023264] [2021-12-17 22:50:13,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:50:13,200 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 22:50:13,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:50:13,254 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 22:50:13,255 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 22:50:13,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583023264] [2021-12-17 22:50:13,255 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583023264] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 22:50:13,255 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 22:50:13,255 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-17 22:50:13,256 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972826797] [2021-12-17 22:50:13,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 22:50:13,258 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-17 22:50:13,259 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 22:50:13,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-17 22:50:13,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-17 22:50:13,260 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 105 [2021-12-17 22:50:13,260 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 188 transitions, 1870 flow. Second operand has 5 states, 5 states have (on average 85.8) internal successors, (429), 5 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:50:13,260 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:50:13,260 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 105 [2021-12-17 22:50:13,261 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:50:13,512 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([268] thread3ENTRY-->L92: Formula: (= v_~v_assert~0_5 (ite (= 0 (ite (<= 0 v_~pos~0_9) 1 0)) 0 1)) InVars {~pos~0=v_~pos~0_9} OutVars{~v_assert~0=v_~v_assert~0_5, ~pos~0=v_~pos~0_9} AuxVars[] AssignedVars[~v_assert~0][123], [Black: 175#true, 30#L59true, 111#true, Black: 136#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (= ~v_assert~0 thread1Thread1of1ForFork1_~lv_assert~0)), Black: 131#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1))), Black: 201#(and (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (= ~v_assert~0 thread1Thread1of1ForFork1_~lv_assert~0)), Black: 195#(= ~v_assert~0 thread1Thread1of1ForFork1_~lv_assert~0), Black: 199#(and (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) thread1Thread1of1ForFork1_~lv_assert~0) (+ thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)))) (= ~v_assert~0 thread1Thread1of1ForFork1_~lv_assert~0)), Black: 196#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) thread1Thread1of1ForFork1_~lv_assert~0) (+ thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)))), Black: 203#(and (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) thread1Thread1of1ForFork1_~lv_assert~0) (+ thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)))) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (= ~v_assert~0 thread1Thread1of1ForFork1_~lv_assert~0)), 49#L78true, Black: 140#true, 228#(and (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) thread1Thread1of1ForFork1_~lv_assert~0) (+ thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)))) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), 248#true, 205#(and (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) thread1Thread1of1ForFork1_~lv_assert~0) (+ thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)))) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 221#(and (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 213#true, Black: 215#(= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1), Black: 216#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) thread1Thread1of1ForFork1_~lv_assert~0) (+ thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)))), Black: 164#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 223#(and (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) thread1Thread1of1ForFork1_~lv_assert~0) (+ thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)))) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 166#(and (<= 1 thread1Thread1of1ForFork1_~lv_assert~0) (<= (div thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 219#(and (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) thread1Thread1of1ForFork1_~lv_assert~0) (+ thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256))))), Black: 217#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), Black: 158#(<= 0 ~pos~0), 146#(<= (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) 1) thread1Thread1of1ForFork1_~lv_assert~0), 5#L111-4true, 179#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), Black: 242#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 28#L92true, 238#true, Black: 183#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (= ~v_assert~0 thread1Thread1of1ForFork1_~lv_assert~0)), Black: 177#(= ~v_assert~0 thread1Thread1of1ForFork1_~lv_assert~0), Black: 123#(and (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1))), Black: 185#(and (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (= ~v_assert~0 thread1Thread1of1ForFork1_~lv_assert~0)), Black: 118#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1))), Black: 181#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (= ~v_assert~0 thread1Thread1of1ForFork1_~lv_assert~0))]) [2021-12-17 22:50:13,513 INFO L384 tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event [2021-12-17 22:50:13,513 INFO L387 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2021-12-17 22:50:13,513 INFO L387 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2021-12-17 22:50:13,513 INFO L387 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2021-12-17 22:50:13,536 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([268] thread3ENTRY-->L92: Formula: (= v_~v_assert~0_5 (ite (= 0 (ite (<= 0 v_~pos~0_9) 1 0)) 0 1)) InVars {~pos~0=v_~pos~0_9} OutVars{~v_assert~0=v_~v_assert~0_5, ~pos~0=v_~pos~0_9} AuxVars[] AssignedVars[~v_assert~0][123], [Black: 175#true, 30#L59true, 111#true, Black: 136#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (= ~v_assert~0 thread1Thread1of1ForFork1_~lv_assert~0)), Black: 131#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1))), Black: 201#(and (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (= ~v_assert~0 thread1Thread1of1ForFork1_~lv_assert~0)), Black: 195#(= ~v_assert~0 thread1Thread1of1ForFork1_~lv_assert~0), Black: 199#(and (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) thread1Thread1of1ForFork1_~lv_assert~0) (+ thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)))) (= ~v_assert~0 thread1Thread1of1ForFork1_~lv_assert~0)), Black: 196#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) thread1Thread1of1ForFork1_~lv_assert~0) (+ thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)))), Black: 203#(and (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) thread1Thread1of1ForFork1_~lv_assert~0) (+ thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)))) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (= ~v_assert~0 thread1Thread1of1ForFork1_~lv_assert~0)), 49#L78true, Black: 140#true, 228#(and (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) thread1Thread1of1ForFork1_~lv_assert~0) (+ thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)))) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), 248#true, 205#(and (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) thread1Thread1of1ForFork1_~lv_assert~0) (+ thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)))) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 221#(and (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 213#true, Black: 215#(= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1), Black: 216#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) thread1Thread1of1ForFork1_~lv_assert~0) (+ thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)))), Black: 164#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 223#(and (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) thread1Thread1of1ForFork1_~lv_assert~0) (+ thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)))) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 166#(and (<= 1 thread1Thread1of1ForFork1_~lv_assert~0) (<= (div thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 219#(and (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) thread1Thread1of1ForFork1_~lv_assert~0) (+ thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256))))), Black: 217#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), Black: 158#(<= 0 ~pos~0), 146#(<= (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) 1) thread1Thread1of1ForFork1_~lv_assert~0), 5#L111-4true, 179#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), Black: 242#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 28#L92true, Black: 183#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (= ~v_assert~0 thread1Thread1of1ForFork1_~lv_assert~0)), 238#true, Black: 177#(= ~v_assert~0 thread1Thread1of1ForFork1_~lv_assert~0), Black: 123#(and (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1))), Black: 185#(and (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (= ~v_assert~0 thread1Thread1of1ForFork1_~lv_assert~0)), Black: 118#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1))), Black: 181#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (= ~v_assert~0 thread1Thread1of1ForFork1_~lv_assert~0))]) [2021-12-17 22:50:13,537 INFO L384 tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event [2021-12-17 22:50:13,537 INFO L387 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2021-12-17 22:50:13,537 INFO L387 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2021-12-17 22:50:13,567 INFO L387 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2021-12-17 22:50:13,567 INFO L387 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2021-12-17 22:50:13,576 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([268] thread3ENTRY-->L92: Formula: (= v_~v_assert~0_5 (ite (= 0 (ite (<= 0 v_~pos~0_9) 1 0)) 0 1)) InVars {~pos~0=v_~pos~0_9} OutVars{~v_assert~0=v_~v_assert~0_5, ~pos~0=v_~pos~0_9} AuxVars[] AssignedVars[~v_assert~0][123], [Black: 175#true, 111#true, 30#L59true, Black: 136#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (= ~v_assert~0 thread1Thread1of1ForFork1_~lv_assert~0)), Black: 131#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1))), Black: 201#(and (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (= ~v_assert~0 thread1Thread1of1ForFork1_~lv_assert~0)), Black: 195#(= ~v_assert~0 thread1Thread1of1ForFork1_~lv_assert~0), Black: 199#(and (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) thread1Thread1of1ForFork1_~lv_assert~0) (+ thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)))) (= ~v_assert~0 thread1Thread1of1ForFork1_~lv_assert~0)), Black: 196#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) thread1Thread1of1ForFork1_~lv_assert~0) (+ thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)))), Black: 203#(and (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) thread1Thread1of1ForFork1_~lv_assert~0) (+ thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)))) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (= ~v_assert~0 thread1Thread1of1ForFork1_~lv_assert~0)), Black: 140#true, 228#(and (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) thread1Thread1of1ForFork1_~lv_assert~0) (+ thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)))) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), 248#true, 205#(and (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) thread1Thread1of1ForFork1_~lv_assert~0) (+ thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)))) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 221#(and (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 213#true, Black: 215#(= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1), Black: 216#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) thread1Thread1of1ForFork1_~lv_assert~0) (+ thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)))), Black: 164#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 166#(and (<= 1 thread1Thread1of1ForFork1_~lv_assert~0) (<= (div thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), 36#L70true, Black: 223#(and (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) thread1Thread1of1ForFork1_~lv_assert~0) (+ thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)))) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 219#(and (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) thread1Thread1of1ForFork1_~lv_assert~0) (+ thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256))))), Black: 217#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), Black: 158#(<= 0 ~pos~0), 5#L111-4true, 146#(<= (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) 1) thread1Thread1of1ForFork1_~lv_assert~0), 179#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), Black: 242#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 28#L92true, 238#true, Black: 183#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (= ~v_assert~0 thread1Thread1of1ForFork1_~lv_assert~0)), Black: 177#(= ~v_assert~0 thread1Thread1of1ForFork1_~lv_assert~0), Black: 123#(and (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1))), Black: 185#(and (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (= ~v_assert~0 thread1Thread1of1ForFork1_~lv_assert~0)), Black: 118#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1))), Black: 181#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (= ~v_assert~0 thread1Thread1of1ForFork1_~lv_assert~0))]) [2021-12-17 22:50:13,576 INFO L384 tUnfolder$Statistics]: this new event has 69 ancestors and is not cut-off event [2021-12-17 22:50:13,576 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is not cut-off event [2021-12-17 22:50:13,576 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is not cut-off event [2021-12-17 22:50:13,577 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is not cut-off event [2021-12-17 22:50:13,596 INFO L382 tUnfolder$Statistics]: inserting event number 6 for the transition-marking pair ([268] thread3ENTRY-->L92: Formula: (= v_~v_assert~0_5 (ite (= 0 (ite (<= 0 v_~pos~0_9) 1 0)) 0 1)) InVars {~pos~0=v_~pos~0_9} OutVars{~v_assert~0=v_~v_assert~0_5, ~pos~0=v_~pos~0_9} AuxVars[] AssignedVars[~v_assert~0][123], [Black: 175#true, 111#true, 30#L59true, Black: 136#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (= ~v_assert~0 thread1Thread1of1ForFork1_~lv_assert~0)), Black: 131#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1))), Black: 201#(and (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (= ~v_assert~0 thread1Thread1of1ForFork1_~lv_assert~0)), Black: 195#(= ~v_assert~0 thread1Thread1of1ForFork1_~lv_assert~0), Black: 199#(and (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) thread1Thread1of1ForFork1_~lv_assert~0) (+ thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)))) (= ~v_assert~0 thread1Thread1of1ForFork1_~lv_assert~0)), Black: 196#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) thread1Thread1of1ForFork1_~lv_assert~0) (+ thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)))), Black: 203#(and (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) thread1Thread1of1ForFork1_~lv_assert~0) (+ thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)))) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (= ~v_assert~0 thread1Thread1of1ForFork1_~lv_assert~0)), 49#L78true, Black: 140#true, 228#(and (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) thread1Thread1of1ForFork1_~lv_assert~0) (+ thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)))) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), 248#true, 205#(and (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) thread1Thread1of1ForFork1_~lv_assert~0) (+ thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)))) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 221#(and (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 213#true, Black: 215#(= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1), Black: 216#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) thread1Thread1of1ForFork1_~lv_assert~0) (+ thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)))), Black: 164#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 223#(and (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) thread1Thread1of1ForFork1_~lv_assert~0) (+ thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)))) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 166#(and (<= 1 thread1Thread1of1ForFork1_~lv_assert~0) (<= (div thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 219#(and (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) thread1Thread1of1ForFork1_~lv_assert~0) (+ thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256))))), Black: 217#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), Black: 158#(<= 0 ~pos~0), 5#L111-4true, 146#(<= (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) 1) thread1Thread1of1ForFork1_~lv_assert~0), 179#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), Black: 242#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 28#L92true, 238#true, Black: 183#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (= ~v_assert~0 thread1Thread1of1ForFork1_~lv_assert~0)), Black: 177#(= ~v_assert~0 thread1Thread1of1ForFork1_~lv_assert~0), Black: 123#(and (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1))), Black: 185#(and (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (= ~v_assert~0 thread1Thread1of1ForFork1_~lv_assert~0)), Black: 118#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1))), Black: 181#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (= ~v_assert~0 thread1Thread1of1ForFork1_~lv_assert~0))]) [2021-12-17 22:50:13,596 INFO L384 tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event [2021-12-17 22:50:13,596 INFO L387 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2021-12-17 22:50:13,596 INFO L387 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2021-12-17 22:50:13,596 INFO L387 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2021-12-17 22:50:13,597 INFO L387 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2021-12-17 22:50:13,597 INFO L387 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2021-12-17 22:50:13,647 INFO L129 PetriNetUnfolder]: 909/2760 cut-off events. [2021-12-17 22:50:13,647 INFO L130 PetriNetUnfolder]: For 15791/16029 co-relation queries the response was YES. [2021-12-17 22:50:13,665 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10247 conditions, 2760 events. 909/2760 cut-off events. For 15791/16029 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 24206 event pairs, 180 based on Foata normal form. 45/2608 useless extension candidates. Maximal degree in co-relation 10212. Up to 540 conditions per place. [2021-12-17 22:50:13,679 INFO L132 encePairwiseOnDemand]: 99/105 looper letters, 22 selfloop transitions, 5 changer transitions 0/197 dead transitions. [2021-12-17 22:50:13,679 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 197 transitions, 1954 flow [2021-12-17 22:50:13,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-17 22:50:13,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-12-17 22:50:13,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 441 transitions. [2021-12-17 22:50:13,681 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.84 [2021-12-17 22:50:13,681 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 441 transitions. [2021-12-17 22:50:13,681 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 441 transitions. [2021-12-17 22:50:13,682 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 22:50:13,682 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 441 transitions. [2021-12-17 22:50:13,683 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 88.2) internal successors, (441), 5 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:50:13,683 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 105.0) internal successors, (630), 6 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:50:13,684 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 105.0) internal successors, (630), 6 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:50:13,684 INFO L186 Difference]: Start difference. First operand has 152 places, 188 transitions, 1870 flow. Second operand 5 states and 441 transitions. [2021-12-17 22:50:13,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 197 transitions, 1954 flow [2021-12-17 22:50:13,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 197 transitions, 1950 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-12-17 22:50:13,722 INFO L242 Difference]: Finished difference. Result has 156 places, 190 transitions, 1892 flow [2021-12-17 22:50:13,723 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=1866, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1892, PETRI_PLACES=156, PETRI_TRANSITIONS=190} [2021-12-17 22:50:13,723 INFO L334 CegarLoopForPetriNet]: 94 programPoint places, 62 predicate places. [2021-12-17 22:50:13,723 INFO L470 AbstractCegarLoop]: Abstraction has has 156 places, 190 transitions, 1892 flow [2021-12-17 22:50:13,724 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 85.8) internal successors, (429), 5 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:50:13,724 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:50:13,724 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 22:50:13,724 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-17 22:50:13,724 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-17 22:50:13,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:50:13,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1142839705, now seen corresponding path program 1 times [2021-12-17 22:50:13,725 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 22:50:13,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182059194] [2021-12-17 22:50:13,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:50:13,727 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 22:50:13,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:50:13,818 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 22:50:13,818 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 22:50:13,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182059194] [2021-12-17 22:50:13,819 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182059194] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 22:50:13,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1067591075] [2021-12-17 22:50:13,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:50:13,819 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 22:50:13,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 22:50:13,824 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 22:50:13,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-17 22:50:13,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:50:13,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-17 22:50:13,924 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 22:50:14,155 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 22:50:14,156 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 22:50:14,293 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 22:50:14,293 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1067591075] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 22:50:14,294 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 22:50:14,294 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 14 [2021-12-17 22:50:14,294 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210494746] [2021-12-17 22:50:14,294 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 22:50:14,294 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-17 22:50:14,295 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 22:50:14,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-17 22:50:14,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2021-12-17 22:50:14,296 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 105 [2021-12-17 22:50:14,297 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 190 transitions, 1892 flow. Second operand has 14 states, 14 states have (on average 77.64285714285714) internal successors, (1087), 14 states have internal predecessors, (1087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:50:14,297 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:50:14,297 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 105 [2021-12-17 22:50:14,297 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:50:15,661 INFO L129 PetriNetUnfolder]: 2420/6000 cut-off events. [2021-12-17 22:50:15,662 INFO L130 PetriNetUnfolder]: For 47366/47443 co-relation queries the response was YES. [2021-12-17 22:50:15,776 INFO L84 FinitePrefix]: Finished finitePrefix Result has 27569 conditions, 6000 events. 2420/6000 cut-off events. For 47366/47443 co-relation queries the response was YES. Maximal size of possible extension queue 387. Compared 56079 event pairs, 143 based on Foata normal form. 55/6002 useless extension candidates. Maximal degree in co-relation 27532. Up to 887 conditions per place. [2021-12-17 22:50:15,801 INFO L132 encePairwiseOnDemand]: 91/105 looper letters, 145 selfloop transitions, 156 changer transitions 103/488 dead transitions. [2021-12-17 22:50:15,802 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 488 transitions, 6447 flow [2021-12-17 22:50:15,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-12-17 22:50:15,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2021-12-17 22:50:15,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1717 transitions. [2021-12-17 22:50:15,805 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7786848072562358 [2021-12-17 22:50:15,805 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 1717 transitions. [2021-12-17 22:50:15,805 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 1717 transitions. [2021-12-17 22:50:15,806 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 22:50:15,806 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 1717 transitions. [2021-12-17 22:50:15,808 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 81.76190476190476) internal successors, (1717), 21 states have internal predecessors, (1717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:50:15,811 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 105.0) internal successors, (2310), 22 states have internal predecessors, (2310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:50:15,812 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 105.0) internal successors, (2310), 22 states have internal predecessors, (2310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:50:15,812 INFO L186 Difference]: Start difference. First operand has 156 places, 190 transitions, 1892 flow. Second operand 21 states and 1717 transitions. [2021-12-17 22:50:15,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 488 transitions, 6447 flow [2021-12-17 22:50:15,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 488 transitions, 6443 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-12-17 22:50:15,904 INFO L242 Difference]: Finished difference. Result has 186 places, 307 transitions, 4032 flow [2021-12-17 22:50:15,904 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=1888, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=4032, PETRI_PLACES=186, PETRI_TRANSITIONS=307} [2021-12-17 22:50:15,904 INFO L334 CegarLoopForPetriNet]: 94 programPoint places, 92 predicate places. [2021-12-17 22:50:15,905 INFO L470 AbstractCegarLoop]: Abstraction has has 186 places, 307 transitions, 4032 flow [2021-12-17 22:50:15,905 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 77.64285714285714) internal successors, (1087), 14 states have internal predecessors, (1087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:50:15,905 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:50:15,905 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 22:50:15,938 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-17 22:50:16,119 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-12-17 22:50:16,120 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-17 22:50:16,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:50:16,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1871322637, now seen corresponding path program 1 times [2021-12-17 22:50:16,121 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 22:50:16,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752438642] [2021-12-17 22:50:16,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:50:16,121 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 22:50:16,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:50:16,202 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 22:50:16,203 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 22:50:16,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752438642] [2021-12-17 22:50:16,203 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752438642] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 22:50:16,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [918693276] [2021-12-17 22:50:16,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:50:16,204 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 22:50:16,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 22:50:16,205 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 22:50:16,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-17 22:50:16,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:50:16,267 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-17 22:50:16,271 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 22:50:16,483 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 22:50:16,484 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 22:50:16,634 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 22:50:16,634 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [918693276] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 22:50:16,634 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 22:50:16,634 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 14 [2021-12-17 22:50:16,636 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996692513] [2021-12-17 22:50:16,636 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 22:50:16,636 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-17 22:50:16,636 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 22:50:16,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-17 22:50:16,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2021-12-17 22:50:16,638 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 105 [2021-12-17 22:50:16,639 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 307 transitions, 4032 flow. Second operand has 14 states, 14 states have (on average 77.78571428571429) internal successors, (1089), 14 states have internal predecessors, (1089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:50:16,639 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:50:16,639 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 105 [2021-12-17 22:50:16,639 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:50:18,882 INFO L129 PetriNetUnfolder]: 3706/9300 cut-off events. [2021-12-17 22:50:18,883 INFO L130 PetriNetUnfolder]: For 109592/110028 co-relation queries the response was YES. [2021-12-17 22:50:18,984 INFO L84 FinitePrefix]: Finished finitePrefix Result has 52354 conditions, 9300 events. 3706/9300 cut-off events. For 109592/110028 co-relation queries the response was YES. Maximal size of possible extension queue 573. Compared 92377 event pairs, 193 based on Foata normal form. 168/9362 useless extension candidates. Maximal degree in co-relation 52304. Up to 1580 conditions per place. [2021-12-17 22:50:19,044 INFO L132 encePairwiseOnDemand]: 92/105 looper letters, 137 selfloop transitions, 181 changer transitions 294/696 dead transitions. [2021-12-17 22:50:19,044 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 696 transitions, 11218 flow [2021-12-17 22:50:19,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-12-17 22:50:19,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2021-12-17 22:50:19,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1722 transitions. [2021-12-17 22:50:19,071 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.780952380952381 [2021-12-17 22:50:19,071 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 1722 transitions. [2021-12-17 22:50:19,071 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 1722 transitions. [2021-12-17 22:50:19,072 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 22:50:19,072 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 1722 transitions. [2021-12-17 22:50:19,074 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 82.0) internal successors, (1722), 21 states have internal predecessors, (1722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:50:19,077 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 105.0) internal successors, (2310), 22 states have internal predecessors, (2310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:50:19,077 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 105.0) internal successors, (2310), 22 states have internal predecessors, (2310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:50:19,077 INFO L186 Difference]: Start difference. First operand has 186 places, 307 transitions, 4032 flow. Second operand 21 states and 1722 transitions. [2021-12-17 22:50:19,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 696 transitions, 11218 flow [2021-12-17 22:50:19,354 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 696 transitions, 10886 flow, removed 125 selfloop flow, removed 5 redundant places. [2021-12-17 22:50:19,363 INFO L242 Difference]: Finished difference. Result has 211 places, 360 transitions, 5277 flow [2021-12-17 22:50:19,363 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=3875, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=307, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=101, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=5277, PETRI_PLACES=211, PETRI_TRANSITIONS=360} [2021-12-17 22:50:19,364 INFO L334 CegarLoopForPetriNet]: 94 programPoint places, 117 predicate places. [2021-12-17 22:50:19,364 INFO L470 AbstractCegarLoop]: Abstraction has has 211 places, 360 transitions, 5277 flow [2021-12-17 22:50:19,365 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 77.78571428571429) internal successors, (1089), 14 states have internal predecessors, (1089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:50:19,365 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:50:19,365 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 22:50:19,384 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-17 22:50:19,571 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-12-17 22:50:19,572 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-17 22:50:19,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:50:19,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1427515022, now seen corresponding path program 2 times [2021-12-17 22:50:19,572 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 22:50:19,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873348636] [2021-12-17 22:50:19,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:50:19,572 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 22:50:19,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:50:19,620 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-17 22:50:19,620 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 22:50:19,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873348636] [2021-12-17 22:50:19,620 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873348636] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 22:50:19,621 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 22:50:19,621 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-17 22:50:19,621 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181176035] [2021-12-17 22:50:19,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 22:50:19,621 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-17 22:50:19,621 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 22:50:19,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-17 22:50:19,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-17 22:50:19,622 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 105 [2021-12-17 22:50:19,623 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 360 transitions, 5277 flow. Second operand has 4 states, 4 states have (on average 91.5) internal successors, (366), 4 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:50:19,623 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:50:19,623 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 105 [2021-12-17 22:50:19,623 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:50:20,209 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([247] L59-->L46: Formula: (not (= 0 (mod v_thread1Thread1of1ForFork1_~lv_assert~0_5 256))) InVars {thread1Thread1of1ForFork1_~lv_assert~0=v_thread1Thread1of1ForFork1_~lv_assert~0_5} OutVars{thread1Thread1of1ForFork1_~lv_assert~0=v_thread1Thread1of1ForFork1_~lv_assert~0_5} AuxVars[] AssignedVars[][94], [Black: 252#(<= (+ (* 256 (div ~d2~0 256)) 1) ~d2~0), 56#L83true, Black: 131#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1))), 1347#true, Black: 775#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 787#(and (<= 1 thread2Thread1of1ForFork2_~lv_assert~1) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= thread2Thread1of1ForFork2_~lv_assert~1 1)), Black: 146#(<= (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) 1) thread1Thread1of1ForFork1_~lv_assert~0), Black: 773#(and (< 0 (mod thread2Thread1of1ForFork2_~lv_assert~1 256)) (<= 0 ~pos~0)), Black: 140#true, Black: 262#(<= 0 ~pos~0), Black: 777#(and (<= 1 thread2Thread1of1ForFork2_~lv_assert~1) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0) (<= thread2Thread1of1ForFork2_~lv_assert~1 1)), Black: 785#(and (<= 1 ~pos~0) (<= 1 thread2Thread1of1ForFork2_~lv_assert~1) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= thread2Thread1of1ForFork2_~lv_assert~1 1)), Black: 767#(and (= 0 ~pos~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))), Black: 263#(<= 1 ~pos~0), Black: 779#(and (< 0 (mod thread2Thread1of1ForFork2_~lv_assert~1 256)) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 769#(and (= 0 ~pos~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (< 0 (mod thread2Thread1of1ForFork2_~lv_assert~1 256)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))), 248#true, Black: 164#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 166#(and (<= 1 thread1Thread1of1ForFork1_~lv_assert~0) (<= (div thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 158#(<= 0 ~pos~0), 150#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (= ~v_assert~0 thread1Thread1of1ForFork1_~lv_assert~0)), 25#L110-4true, Black: 1334#(and (<= 2 ~pos~0) (<= 1 ~v_assert~0) (<= ~v_assert~0 1)), Black: 1322#(and (<= 1 thread2Thread1of1ForFork2_~lv_assert~1) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= thread2Thread1of1ForFork2_~lv_assert~1 1) (<= 0 ~pos~0)), 123#(and (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1))), Black: 1332#(and (<= 1 thread2Thread1of1ForFork2_~lv_assert~1) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= thread2Thread1of1ForFork2_~lv_assert~1 1)), 238#true, Black: 808#(<= 2 ~pos~0), Black: 177#(= ~v_assert~0 thread1Thread1of1ForFork1_~lv_assert~0), Black: 1330#(and (<= 1 thread2Thread1of1ForFork2_~lv_assert~1) (<= 2 ~pos~0) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= thread2Thread1of1ForFork2_~lv_assert~1 1)), Black: 179#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), Black: 185#(and (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (= ~v_assert~0 thread1Thread1of1ForFork1_~lv_assert~0)), Black: 1320#(and (< 0 (mod thread2Thread1of1ForFork2_~lv_assert~1 256)) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 181#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (= ~v_assert~0 thread1Thread1of1ForFork1_~lv_assert~0)), Black: 1328#(and (<= 2 ~pos~0) (< 0 (mod thread2Thread1of1ForFork2_~lv_assert~1 256)) (<= 1 ~v_assert~0) (<= ~v_assert~0 1)), Black: 1316#(and (<= 2 ~pos~0) (< 0 (mod thread2Thread1of1ForFork2_~lv_assert~1 256))), Black: 175#true, Black: 1318#(and (< 0 (mod thread2Thread1of1ForFork2_~lv_assert~1 256)) (<= 0 ~pos~0)), 111#true, Black: 1324#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 201#(and (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (= ~v_assert~0 thread1Thread1of1ForFork1_~lv_assert~0)), Black: 205#(and (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) thread1Thread1of1ForFork1_~lv_assert~0) (+ thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)))) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), 183#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (= ~v_assert~0 thread1Thread1of1ForFork1_~lv_assert~0)), Black: 195#(= ~v_assert~0 thread1Thread1of1ForFork1_~lv_assert~0), Black: 199#(and (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) thread1Thread1of1ForFork1_~lv_assert~0) (+ thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)))) (= ~v_assert~0 thread1Thread1of1ForFork1_~lv_assert~0)), 807#(<= 0 ~pos~0), Black: 196#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) thread1Thread1of1ForFork1_~lv_assert~0) (+ thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)))), 7#L46true, 223#(and (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) thread1Thread1of1ForFork1_~lv_assert~0) (+ thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)))) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), 258#true, Black: 221#(and (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 213#true, Black: 215#(= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1), Black: 216#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) thread1Thread1of1ForFork1_~lv_assert~0) (+ thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)))), Black: 228#(and (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) thread1Thread1of1ForFork1_~lv_assert~0) (+ thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)))) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 219#(and (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) thread1Thread1of1ForFork1_~lv_assert~0) (+ thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256))))), Black: 217#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), 203#(and (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) thread1Thread1of1ForFork1_~lv_assert~0) (+ thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)))) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (= ~v_assert~0 thread1Thread1of1ForFork1_~lv_assert~0)), Black: 242#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), Black: 118#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)))]) [2021-12-17 22:50:20,209 INFO L384 tUnfolder$Statistics]: this new event has 72 ancestors and is cut-off event [2021-12-17 22:50:20,209 INFO L387 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2021-12-17 22:50:20,209 INFO L387 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2021-12-17 22:50:20,210 INFO L387 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2021-12-17 22:50:20,637 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([253] L52-->L54: Formula: (= (+ v_~pos~0_23 1) v_~pos~0_24) InVars {~pos~0=v_~pos~0_24} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|, ~pos~0=v_~pos~0_23} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2, ~pos~0][246], [Black: 252#(<= (+ (* 256 (div ~d2~0 256)) 1) ~d2~0), Black: 136#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (= ~v_assert~0 thread1Thread1of1ForFork1_~lv_assert~0)), Black: 131#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1))), 1115#(< 0 (mod thread2Thread1of1ForFork2_~lv_assert~1 256)), Black: 775#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 787#(and (<= 1 thread2Thread1of1ForFork2_~lv_assert~1) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= thread2Thread1of1ForFork2_~lv_assert~1 1)), Black: 140#true, Black: 773#(and (< 0 (mod thread2Thread1of1ForFork2_~lv_assert~1 256)) (<= 0 ~pos~0)), Black: 262#(<= 0 ~pos~0), Black: 777#(and (<= 1 thread2Thread1of1ForFork2_~lv_assert~1) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0) (<= thread2Thread1of1ForFork2_~lv_assert~1 1)), 228#(and (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) thread1Thread1of1ForFork1_~lv_assert~0) (+ thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)))) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 785#(and (<= 1 ~pos~0) (<= 1 thread2Thread1of1ForFork2_~lv_assert~1) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= thread2Thread1of1ForFork2_~lv_assert~1 1)), Black: 767#(and (= 0 ~pos~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))), Black: 263#(<= 1 ~pos~0), Black: 779#(and (< 0 (mod thread2Thread1of1ForFork2_~lv_assert~1 256)) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), 570#(< 0 (mod thread2Thread1of1ForFork2_~lv_assert~1 256)), 248#true, Black: 769#(and (= 0 ~pos~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (< 0 (mod thread2Thread1of1ForFork2_~lv_assert~1 256)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))), Black: 164#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 166#(and (<= 1 thread1Thread1of1ForFork1_~lv_assert~0) (<= (div thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 158#(<= 0 ~pos~0), 146#(<= (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) 1) thread1Thread1of1ForFork1_~lv_assert~0), 179#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), 28#L92true, Black: 1334#(and (<= 2 ~pos~0) (<= 1 ~v_assert~0) (<= ~v_assert~0 1)), Black: 1322#(and (<= 1 thread2Thread1of1ForFork2_~lv_assert~1) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= thread2Thread1of1ForFork2_~lv_assert~1 1) (<= 0 ~pos~0)), Black: 1332#(and (<= 1 thread2Thread1of1ForFork2_~lv_assert~1) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= thread2Thread1of1ForFork2_~lv_assert~1 1)), Black: 183#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (= ~v_assert~0 thread1Thread1of1ForFork1_~lv_assert~0)), Black: 807#(<= 0 ~pos~0), 238#true, Black: 808#(<= 2 ~pos~0), Black: 177#(= ~v_assert~0 thread1Thread1of1ForFork1_~lv_assert~0), Black: 1330#(and (<= 1 thread2Thread1of1ForFork2_~lv_assert~1) (<= 2 ~pos~0) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= thread2Thread1of1ForFork2_~lv_assert~1 1)), Black: 185#(and (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (= ~v_assert~0 thread1Thread1of1ForFork1_~lv_assert~0)), Black: 1320#(and (< 0 (mod thread2Thread1of1ForFork2_~lv_assert~1 256)) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 1328#(and (<= 2 ~pos~0) (< 0 (mod thread2Thread1of1ForFork2_~lv_assert~1 256)) (<= 1 ~v_assert~0) (<= ~v_assert~0 1)), Black: 181#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (= ~v_assert~0 thread1Thread1of1ForFork1_~lv_assert~0)), Black: 175#true, Black: 1316#(and (<= 2 ~pos~0) (< 0 (mod thread2Thread1of1ForFork2_~lv_assert~1 256))), 111#true, Black: 1318#(and (< 0 (mod thread2Thread1of1ForFork2_~lv_assert~1 256)) (<= 0 ~pos~0)), Black: 1324#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), 44#L54true, Black: 201#(and (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (= ~v_assert~0 thread1Thread1of1ForFork1_~lv_assert~0)), Black: 195#(= ~v_assert~0 thread1Thread1of1ForFork1_~lv_assert~0), Black: 199#(and (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) thread1Thread1of1ForFork1_~lv_assert~0) (+ thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)))) (= ~v_assert~0 thread1Thread1of1ForFork1_~lv_assert~0)), Black: 196#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) thread1Thread1of1ForFork1_~lv_assert~0) (+ thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)))), Black: 203#(and (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) thread1Thread1of1ForFork1_~lv_assert~0) (+ thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)))) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (= ~v_assert~0 thread1Thread1of1ForFork1_~lv_assert~0)), 1349#(= ~d1~0 (* 256 (div ~d1~0 256))), 49#L78true, 205#(and (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) thread1Thread1of1ForFork1_~lv_assert~0) (+ thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)))) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 221#(and (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 213#true, Black: 215#(= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1), Black: 216#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) thread1Thread1of1ForFork1_~lv_assert~0) (+ thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)))), Black: 223#(and (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) thread1Thread1of1ForFork1_~lv_assert~0) (+ thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)))) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 219#(and (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) thread1Thread1of1ForFork1_~lv_assert~0) (+ thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256))))), Black: 217#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), 5#L111-4true, Black: 242#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), Black: 123#(and (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1))), Black: 118#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)))]) [2021-12-17 22:50:20,638 INFO L384 tUnfolder$Statistics]: this new event has 84 ancestors and is cut-off event [2021-12-17 22:50:20,638 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2021-12-17 22:50:20,638 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2021-12-17 22:50:20,638 INFO L387 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2021-12-17 22:50:20,838 INFO L129 PetriNetUnfolder]: 2008/6736 cut-off events. [2021-12-17 22:50:20,838 INFO L130 PetriNetUnfolder]: For 84386/85861 co-relation queries the response was YES. [2021-12-17 22:50:20,889 INFO L84 FinitePrefix]: Finished finitePrefix Result has 37088 conditions, 6736 events. 2008/6736 cut-off events. For 84386/85861 co-relation queries the response was YES. Maximal size of possible extension queue 417. Compared 72930 event pairs, 285 based on Foata normal form. 572/7130 useless extension candidates. Maximal degree in co-relation 37028. Up to 850 conditions per place. [2021-12-17 22:50:20,922 INFO L132 encePairwiseOnDemand]: 100/105 looper letters, 48 selfloop transitions, 5 changer transitions 5/346 dead transitions. [2021-12-17 22:50:20,923 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 346 transitions, 4999 flow [2021-12-17 22:50:20,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-17 22:50:20,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-12-17 22:50:20,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 379 transitions. [2021-12-17 22:50:20,924 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9023809523809524 [2021-12-17 22:50:20,924 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 379 transitions. [2021-12-17 22:50:20,924 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 379 transitions. [2021-12-17 22:50:20,925 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 22:50:20,925 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 379 transitions. [2021-12-17 22:50:20,925 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 94.75) internal successors, (379), 4 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:50:20,926 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 105.0) internal successors, (525), 5 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:50:20,926 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 105.0) internal successors, (525), 5 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:50:20,927 INFO L186 Difference]: Start difference. First operand has 211 places, 360 transitions, 5277 flow. Second operand 4 states and 379 transitions. [2021-12-17 22:50:20,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 346 transitions, 4999 flow [2021-12-17 22:50:21,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 346 transitions, 4792 flow, removed 38 selfloop flow, removed 11 redundant places. [2021-12-17 22:50:21,298 INFO L242 Difference]: Finished difference. Result has 204 places, 329 transitions, 4554 flow [2021-12-17 22:50:21,298 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=4622, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=332, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=327, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=4554, PETRI_PLACES=204, PETRI_TRANSITIONS=329} [2021-12-17 22:50:21,299 INFO L334 CegarLoopForPetriNet]: 94 programPoint places, 110 predicate places. [2021-12-17 22:50:21,299 INFO L470 AbstractCegarLoop]: Abstraction has has 204 places, 329 transitions, 4554 flow [2021-12-17 22:50:21,299 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 91.5) internal successors, (366), 4 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:50:21,299 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:50:21,300 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 22:50:21,300 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-17 22:50:21,300 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-17 22:50:21,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:50:21,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1468701142, now seen corresponding path program 2 times [2021-12-17 22:50:21,301 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 22:50:21,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329830921] [2021-12-17 22:50:21,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:50:21,301 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 22:50:21,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:50:21,335 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-17 22:50:21,335 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 22:50:21,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329830921] [2021-12-17 22:50:21,336 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329830921] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 22:50:21,336 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 22:50:21,336 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-17 22:50:21,336 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929826148] [2021-12-17 22:50:21,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 22:50:21,337 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-17 22:50:21,337 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 22:50:21,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-17 22:50:21,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-17 22:50:21,338 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 105 [2021-12-17 22:50:21,338 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 329 transitions, 4554 flow. Second operand has 4 states, 4 states have (on average 90.75) internal successors, (363), 4 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:50:21,338 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:50:21,338 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 105 [2021-12-17 22:50:21,338 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:50:22,624 INFO L129 PetriNetUnfolder]: 2341/7077 cut-off events. [2021-12-17 22:50:22,624 INFO L130 PetriNetUnfolder]: For 84681/85595 co-relation queries the response was YES. [2021-12-17 22:50:22,672 INFO L84 FinitePrefix]: Finished finitePrefix Result has 40175 conditions, 7077 events. 2341/7077 cut-off events. For 84681/85595 co-relation queries the response was YES. Maximal size of possible extension queue 303. Compared 71343 event pairs, 432 based on Foata normal form. 484/7297 useless extension candidates. Maximal degree in co-relation 40117. Up to 987 conditions per place. [2021-12-17 22:50:22,702 INFO L132 encePairwiseOnDemand]: 100/105 looper letters, 57 selfloop transitions, 5 changer transitions 2/336 dead transitions. [2021-12-17 22:50:22,703 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 336 transitions, 4531 flow [2021-12-17 22:50:22,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-17 22:50:22,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-12-17 22:50:22,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 378 transitions. [2021-12-17 22:50:22,704 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9 [2021-12-17 22:50:22,704 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 378 transitions. [2021-12-17 22:50:22,704 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 378 transitions. [2021-12-17 22:50:22,704 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 22:50:22,704 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 378 transitions. [2021-12-17 22:50:22,705 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 94.5) internal successors, (378), 4 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:50:22,706 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 105.0) internal successors, (525), 5 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:50:22,706 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 105.0) internal successors, (525), 5 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:50:22,706 INFO L186 Difference]: Start difference. First operand has 204 places, 329 transitions, 4554 flow. Second operand 4 states and 378 transitions. [2021-12-17 22:50:22,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 336 transitions, 4531 flow [2021-12-17 22:50:22,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 336 transitions, 4427 flow, removed 47 selfloop flow, removed 2 redundant places. [2021-12-17 22:50:22,912 INFO L242 Difference]: Finished difference. Result has 207 places, 313 transitions, 4140 flow [2021-12-17 22:50:22,913 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=4133, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=313, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=308, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=4140, PETRI_PLACES=207, PETRI_TRANSITIONS=313} [2021-12-17 22:50:22,913 INFO L334 CegarLoopForPetriNet]: 94 programPoint places, 113 predicate places. [2021-12-17 22:50:22,914 INFO L470 AbstractCegarLoop]: Abstraction has has 207 places, 313 transitions, 4140 flow [2021-12-17 22:50:22,914 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 90.75) internal successors, (363), 4 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:50:22,914 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:50:22,914 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 22:50:22,914 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-17 22:50:22,915 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-17 22:50:22,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:50:22,915 INFO L85 PathProgramCache]: Analyzing trace with hash 232289249, now seen corresponding path program 1 times [2021-12-17 22:50:22,915 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 22:50:22,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580543663] [2021-12-17 22:50:22,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:50:22,915 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 22:50:22,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:50:22,990 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 22:50:22,990 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 22:50:22,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580543663] [2021-12-17 22:50:22,991 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580543663] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 22:50:22,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [647195422] [2021-12-17 22:50:22,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:50:22,991 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 22:50:22,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 22:50:22,992 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 22:50:23,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-17 22:50:23,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:50:23,137 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-17 22:50:23,146 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 22:50:23,348 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 22:50:23,348 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 22:50:23,512 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 22:50:23,512 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [647195422] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 22:50:23,512 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 22:50:23,513 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 15 [2021-12-17 22:50:23,513 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117095552] [2021-12-17 22:50:23,513 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 22:50:23,513 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-17 22:50:23,513 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 22:50:23,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-17 22:50:23,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2021-12-17 22:50:23,514 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 105 [2021-12-17 22:50:23,515 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 313 transitions, 4140 flow. Second operand has 15 states, 15 states have (on average 77.86666666666666) internal successors, (1168), 15 states have internal predecessors, (1168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:50:23,516 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:50:23,516 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 105 [2021-12-17 22:50:23,516 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:50:25,844 INFO L129 PetriNetUnfolder]: 4070/10815 cut-off events. [2021-12-17 22:50:25,844 INFO L130 PetriNetUnfolder]: For 145828/146230 co-relation queries the response was YES. [2021-12-17 22:50:25,917 INFO L84 FinitePrefix]: Finished finitePrefix Result has 66363 conditions, 10815 events. 4070/10815 cut-off events. For 145828/146230 co-relation queries the response was YES. Maximal size of possible extension queue 512. Compared 111838 event pairs, 182 based on Foata normal form. 287/11042 useless extension candidates. Maximal degree in co-relation 66303. Up to 1607 conditions per place. [2021-12-17 22:50:25,954 INFO L132 encePairwiseOnDemand]: 92/105 looper letters, 149 selfloop transitions, 185 changer transitions 253/730 dead transitions. [2021-12-17 22:50:25,954 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 730 transitions, 11864 flow [2021-12-17 22:50:25,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-12-17 22:50:25,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2021-12-17 22:50:25,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 2109 transitions. [2021-12-17 22:50:25,957 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7725274725274726 [2021-12-17 22:50:25,957 INFO L72 ComplementDD]: Start complementDD. Operand 26 states and 2109 transitions. [2021-12-17 22:50:25,957 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 2109 transitions. [2021-12-17 22:50:25,958 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 22:50:25,958 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 2109 transitions. [2021-12-17 22:50:25,961 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 27 states, 26 states have (on average 81.11538461538461) internal successors, (2109), 26 states have internal predecessors, (2109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:50:25,963 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 27 states, 27 states have (on average 105.0) internal successors, (2835), 27 states have internal predecessors, (2835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:50:25,964 INFO L81 ComplementDD]: Finished complementDD. Result has 27 states, 27 states have (on average 105.0) internal successors, (2835), 27 states have internal predecessors, (2835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:50:25,964 INFO L186 Difference]: Start difference. First operand has 207 places, 313 transitions, 4140 flow. Second operand 26 states and 2109 transitions. [2021-12-17 22:50:25,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 730 transitions, 11864 flow [2021-12-17 22:50:26,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 730 transitions, 11822 flow, removed 21 selfloop flow, removed 1 redundant places. [2021-12-17 22:50:26,485 INFO L242 Difference]: Finished difference. Result has 246 places, 399 transitions, 6013 flow [2021-12-17 22:50:26,486 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=4106, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=312, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=6013, PETRI_PLACES=246, PETRI_TRANSITIONS=399} [2021-12-17 22:50:26,486 INFO L334 CegarLoopForPetriNet]: 94 programPoint places, 152 predicate places. [2021-12-17 22:50:26,486 INFO L470 AbstractCegarLoop]: Abstraction has has 246 places, 399 transitions, 6013 flow [2021-12-17 22:50:26,487 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 77.86666666666666) internal successors, (1168), 15 states have internal predecessors, (1168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:50:26,488 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:50:26,488 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 22:50:26,505 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-17 22:50:26,699 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 22:50:26,700 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-17 22:50:26,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:50:26,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1866638169, now seen corresponding path program 2 times [2021-12-17 22:50:26,700 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 22:50:26,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642952604] [2021-12-17 22:50:26,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:50:26,701 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 22:50:26,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:50:26,820 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 22:50:26,820 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 22:50:26,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642952604] [2021-12-17 22:50:26,821 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642952604] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 22:50:26,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [17372329] [2021-12-17 22:50:26,821 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 22:50:26,821 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 22:50:26,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 22:50:26,823 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 22:50:26,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-17 22:50:26,885 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-17 22:50:26,885 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 22:50:26,886 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-17 22:50:26,887 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 22:50:27,102 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 22:50:27,102 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 22:50:27,269 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 22:50:27,270 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [17372329] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 22:50:27,270 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 22:50:27,270 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 15 [2021-12-17 22:50:27,270 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145026875] [2021-12-17 22:50:27,270 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 22:50:27,271 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-17 22:50:27,271 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 22:50:27,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-17 22:50:27,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2021-12-17 22:50:27,272 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 105 [2021-12-17 22:50:27,273 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 399 transitions, 6013 flow. Second operand has 15 states, 15 states have (on average 76.33333333333333) internal successors, (1145), 15 states have internal predecessors, (1145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:50:27,273 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:50:27,273 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 105 [2021-12-17 22:50:27,273 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:50:31,077 INFO L129 PetriNetUnfolder]: 6420/14656 cut-off events. [2021-12-17 22:50:31,078 INFO L130 PetriNetUnfolder]: For 298211/298231 co-relation queries the response was YES. [2021-12-17 22:50:31,177 INFO L84 FinitePrefix]: Finished finitePrefix Result has 109942 conditions, 14656 events. 6420/14656 cut-off events. For 298211/298231 co-relation queries the response was YES. Maximal size of possible extension queue 789. Compared 151559 event pairs, 224 based on Foata normal form. 85/14706 useless extension candidates. Maximal degree in co-relation 109867. Up to 2640 conditions per place. [2021-12-17 22:50:31,238 INFO L132 encePairwiseOnDemand]: 90/105 looper letters, 403 selfloop transitions, 258 changer transitions 295/1024 dead transitions. [2021-12-17 22:50:31,238 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 1024 transitions, 19581 flow [2021-12-17 22:50:31,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-12-17 22:50:31,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2021-12-17 22:50:31,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 3008 transitions. [2021-12-17 22:50:31,242 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7538847117794486 [2021-12-17 22:50:31,242 INFO L72 ComplementDD]: Start complementDD. Operand 38 states and 3008 transitions. [2021-12-17 22:50:31,242 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 3008 transitions. [2021-12-17 22:50:31,242 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 22:50:31,243 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 38 states and 3008 transitions. [2021-12-17 22:50:31,246 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 39 states, 38 states have (on average 79.15789473684211) internal successors, (3008), 38 states have internal predecessors, (3008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:50:31,249 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 39 states, 39 states have (on average 105.0) internal successors, (4095), 39 states have internal predecessors, (4095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:50:31,250 INFO L81 ComplementDD]: Finished complementDD. Result has 39 states, 39 states have (on average 105.0) internal successors, (4095), 39 states have internal predecessors, (4095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:50:31,250 INFO L186 Difference]: Start difference. First operand has 246 places, 399 transitions, 6013 flow. Second operand 38 states and 3008 transitions. [2021-12-17 22:50:31,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 1024 transitions, 19581 flow [2021-12-17 22:50:32,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 1024 transitions, 18340 flow, removed 602 selfloop flow, removed 10 redundant places. [2021-12-17 22:50:32,554 INFO L242 Difference]: Finished difference. Result has 294 places, 514 transitions, 8231 flow [2021-12-17 22:50:32,554 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=5626, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=399, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=115, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=235, PETRI_DIFFERENCE_SUBTRAHEND_STATES=38, PETRI_FLOW=8231, PETRI_PLACES=294, PETRI_TRANSITIONS=514} [2021-12-17 22:50:32,555 INFO L334 CegarLoopForPetriNet]: 94 programPoint places, 200 predicate places. [2021-12-17 22:50:32,555 INFO L470 AbstractCegarLoop]: Abstraction has has 294 places, 514 transitions, 8231 flow [2021-12-17 22:50:32,556 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 76.33333333333333) internal successors, (1145), 15 states have internal predecessors, (1145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:50:32,556 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:50:32,556 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 22:50:32,574 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-17 22:50:32,765 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-12-17 22:50:32,766 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-17 22:50:32,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:50:32,766 INFO L85 PathProgramCache]: Analyzing trace with hash 5327971, now seen corresponding path program 3 times [2021-12-17 22:50:32,767 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 22:50:32,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326157598] [2021-12-17 22:50:32,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:50:32,767 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 22:50:32,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:50:32,862 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 22:50:32,862 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 22:50:32,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326157598] [2021-12-17 22:50:32,862 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326157598] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 22:50:32,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [323527503] [2021-12-17 22:50:32,862 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-17 22:50:32,862 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 22:50:32,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 22:50:32,863 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 22:50:32,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-17 22:50:32,931 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-12-17 22:50:32,931 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 22:50:32,932 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-17 22:50:32,933 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 22:50:33,142 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 22:50:33,142 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 22:50:33,312 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 22:50:33,313 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [323527503] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 22:50:33,313 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 22:50:33,313 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 16 [2021-12-17 22:50:33,313 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465870677] [2021-12-17 22:50:33,313 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 22:50:33,313 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-12-17 22:50:33,313 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 22:50:33,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-12-17 22:50:33,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2021-12-17 22:50:33,314 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 105 [2021-12-17 22:50:33,315 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 514 transitions, 8231 flow. Second operand has 16 states, 16 states have (on average 76.125) internal successors, (1218), 16 states have internal predecessors, (1218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:50:33,315 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:50:33,315 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 105 [2021-12-17 22:50:33,315 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:50:37,477 INFO L129 PetriNetUnfolder]: 6581/14492 cut-off events. [2021-12-17 22:50:37,477 INFO L130 PetriNetUnfolder]: For 328923/328937 co-relation queries the response was YES. [2021-12-17 22:50:37,604 INFO L84 FinitePrefix]: Finished finitePrefix Result has 110266 conditions, 14492 events. 6581/14492 cut-off events. For 328923/328937 co-relation queries the response was YES. Maximal size of possible extension queue 878. Compared 148980 event pairs, 215 based on Foata normal form. 44/14507 useless extension candidates. Maximal degree in co-relation 110166. Up to 2849 conditions per place. [2021-12-17 22:50:37,619 INFO L132 encePairwiseOnDemand]: 90/105 looper letters, 0 selfloop transitions, 0 changer transitions 1002/1002 dead transitions. [2021-12-17 22:50:37,619 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 1002 transitions, 20163 flow [2021-12-17 22:50:37,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2021-12-17 22:50:37,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2021-12-17 22:50:37,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 3031 transitions. [2021-12-17 22:50:37,622 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7401709401709402 [2021-12-17 22:50:37,622 INFO L72 ComplementDD]: Start complementDD. Operand 39 states and 3031 transitions. [2021-12-17 22:50:37,622 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 3031 transitions. [2021-12-17 22:50:37,623 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 22:50:37,623 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 39 states and 3031 transitions. [2021-12-17 22:50:37,626 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 40 states, 39 states have (on average 77.71794871794872) internal successors, (3031), 39 states have internal predecessors, (3031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:50:37,628 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 40 states, 40 states have (on average 105.0) internal successors, (4200), 40 states have internal predecessors, (4200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:50:37,629 INFO L81 ComplementDD]: Finished complementDD. Result has 40 states, 40 states have (on average 105.0) internal successors, (4200), 40 states have internal predecessors, (4200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:50:37,629 INFO L186 Difference]: Start difference. First operand has 294 places, 514 transitions, 8231 flow. Second operand 39 states and 3031 transitions. [2021-12-17 22:50:37,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 297 places, 1002 transitions, 20163 flow [2021-12-17 22:50:39,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 1002 transitions, 17817 flow, removed 490 selfloop flow, removed 36 redundant places. [2021-12-17 22:50:39,339 INFO L242 Difference]: Finished difference. Result has 261 places, 0 transitions, 0 flow [2021-12-17 22:50:39,340 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=7103, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=495, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=495, PETRI_DIFFERENCE_SUBTRAHEND_STATES=39, PETRI_FLOW=0, PETRI_PLACES=261, PETRI_TRANSITIONS=0} [2021-12-17 22:50:39,340 INFO L334 CegarLoopForPetriNet]: 94 programPoint places, 167 predicate places. [2021-12-17 22:50:39,340 INFO L470 AbstractCegarLoop]: Abstraction has has 261 places, 0 transitions, 0 flow [2021-12-17 22:50:39,340 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 76.125) internal successors, (1218), 16 states have internal predecessors, (1218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:50:39,342 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2021-12-17 22:50:39,343 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATION (2 of 4 remaining) [2021-12-17 22:50:39,343 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATION (1 of 4 remaining) [2021-12-17 22:50:39,343 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATION (0 of 4 remaining) [2021-12-17 22:50:39,359 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-17 22:50:39,558 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-12-17 22:50:39,561 INFO L732 BasicCegarLoop]: Path program histogram: [4, 4, 3, 2, 2, 1, 1] [2021-12-17 22:50:39,563 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-12-17 22:50:39,563 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-17 22:50:39,565 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.12 10:50:39 BasicIcfg [2021-12-17 22:50:39,565 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-17 22:50:39,566 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-17 22:50:39,566 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-17 22:50:39,566 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-17 22:50:39,566 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 10:50:10" (3/4) ... [2021-12-17 22:50:39,568 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-12-17 22:50:39,571 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2021-12-17 22:50:39,571 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2021-12-17 22:50:39,571 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2021-12-17 22:50:39,581 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2021-12-17 22:50:39,581 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-12-17 22:50:39,582 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-12-17 22:50:39,582 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-12-17 22:50:39,616 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-17 22:50:39,616 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-17 22:50:39,617 INFO L158 Benchmark]: Toolchain (without parser) took 30194.84ms. Allocated memory was 86.0MB in the beginning and 8.4GB in the end (delta: 8.3GB). Free memory was 49.9MB in the beginning and 6.8GB in the end (delta: -6.8GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. [2021-12-17 22:50:39,617 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 86.0MB. Free memory is still 66.0MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-17 22:50:39,617 INFO L158 Benchmark]: CACSL2BoogieTranslator took 224.39ms. Allocated memory is still 86.0MB. Free memory was 66.7MB in the beginning and 62.5MB in the end (delta: 4.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-17 22:50:39,617 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.83ms. Allocated memory is still 86.0MB. Free memory was 62.5MB in the beginning and 60.9MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-17 22:50:39,617 INFO L158 Benchmark]: Boogie Preprocessor took 39.99ms. Allocated memory is still 86.0MB. Free memory was 60.8MB in the beginning and 59.6MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-17 22:50:39,618 INFO L158 Benchmark]: RCFGBuilder took 318.62ms. Allocated memory is still 86.0MB. Free memory was 59.5MB in the beginning and 46.6MB in the end (delta: 12.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2021-12-17 22:50:39,618 INFO L158 Benchmark]: TraceAbstraction took 29501.30ms. Allocated memory was 86.0MB in the beginning and 8.4GB in the end (delta: 8.3GB). Free memory was 46.3MB in the beginning and 6.8GB in the end (delta: -6.8GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. [2021-12-17 22:50:39,618 INFO L158 Benchmark]: Witness Printer took 50.73ms. Allocated memory is still 8.4GB. Free memory was 6.8GB in the beginning and 6.8GB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-17 22:50:39,619 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.11ms. Allocated memory is still 86.0MB. Free memory is still 66.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 224.39ms. Allocated memory is still 86.0MB. Free memory was 66.7MB in the beginning and 62.5MB in the end (delta: 4.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.83ms. Allocated memory is still 86.0MB. Free memory was 62.5MB in the beginning and 60.9MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 39.99ms. Allocated memory is still 86.0MB. Free memory was 60.8MB in the beginning and 59.6MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 318.62ms. Allocated memory is still 86.0MB. Free memory was 59.5MB in the beginning and 46.6MB in the end (delta: 12.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 29501.30ms. Allocated memory was 86.0MB in the beginning and 8.4GB in the end (delta: 8.3GB). Free memory was 46.3MB in the beginning and 6.8GB in the end (delta: -6.8GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. * Witness Printer took 50.73ms. Allocated memory is still 8.4GB. Free memory was 6.8GB in the beginning and 6.8GB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 116]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 126 locations, 4 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: 29.4s, OverallIterations: 17, TraceHistogramMax: 3, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 24.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1060 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1060 mSDsluCounter, 972 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1330 mSDsCounter, 393 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3188 IncrementalHoareTripleChecker+Invalid, 3581 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 393 mSolverCounterUnsat, 232 mSDtfsCounter, 3188 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1126 GetRequests, 889 SyntacticMatches, 10 SemanticMatches, 227 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1433 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8231occurred in iteration=16, InterpolantAutomatonStates: 218, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 1821 NumberOfCodeBlocks, 1821 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 2239 ConstructedInterpolants, 0 QuantifiedInterpolants, 5801 SizeOfPredicates, 40 NumberOfNonLiveVariables, 1101 ConjunctsInSsa, 66 ConjunctsInUnsatCore, 27 InterpolantComputations, 12 PerfectInterpolantSequences, 99/181 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2021-12-17 22:50:39,649 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 Result: TRUE