/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.use.on-demand.petri.net.difference true --traceabstraction.size.reduction.to.apply.after.petri.net.difference REMOVE_DEAD -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/unroll-4.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-12 01:42:12,510 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-12 01:42:12,512 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-12 01:42:12,554 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-12 01:42:12,555 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-12 01:42:12,557 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-12 01:42:12,560 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-12 01:42:12,563 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-12 01:42:12,567 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-12 01:42:12,571 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-12 01:42:12,572 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-12 01:42:12,574 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-12 01:42:12,574 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-12 01:42:12,576 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-12 01:42:12,579 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-12 01:42:12,582 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-12 01:42:12,583 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-12 01:42:12,584 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-12 01:42:12,585 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-12 01:42:12,586 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-12 01:42:12,587 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-12 01:42:12,590 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-12 01:42:12,590 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-12 01:42:12,591 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-12 01:42:12,603 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-12 01:42:12,603 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-12 01:42:12,603 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-12 01:42:12,605 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-12 01:42:12,605 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-12 01:42:12,606 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-12 01:42:12,606 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-12 01:42:12,608 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-12 01:42:12,609 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-12 01:42:12,610 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-12 01:42:12,610 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-12 01:42:12,611 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-12 01:42:12,611 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-12 01:42:12,611 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-12 01:42:12,611 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-12 01:42:12,612 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-12 01:42:12,613 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-12 01:42:12,614 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2022-12-12 01:42:12,648 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-12 01:42:12,649 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-12 01:42:12,650 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-12 01:42:12,650 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-12 01:42:12,651 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-12 01:42:12,652 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-12 01:42:12,652 INFO L138 SettingsManager]: * Use SBE=true [2022-12-12 01:42:12,652 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-12 01:42:12,652 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-12 01:42:12,652 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-12 01:42:12,653 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-12 01:42:12,653 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-12 01:42:12,654 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-12 01:42:12,654 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-12 01:42:12,654 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-12 01:42:12,654 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-12 01:42:12,654 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-12 01:42:12,654 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-12 01:42:12,654 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-12 01:42:12,654 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-12 01:42:12,655 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-12 01:42:12,655 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-12 01:42:12,655 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-12 01:42:12,655 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 01:42:12,655 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-12 01:42:12,655 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-12 01:42:12,655 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-12 01:42:12,656 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-12 01:42:12,656 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-12 01:42:12,656 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-12 01:42:12,656 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-12 01:42:12,656 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.traceabstraction: Use on-demand Petri net difference -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Size reduction to apply after Petri net difference -> REMOVE_DEAD [2022-12-12 01:42:13,000 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-12 01:42:13,018 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-12 01:42:13,020 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-12 01:42:13,020 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-12 01:42:13,021 INFO L275 PluginConnector]: CDTParser initialized [2022-12-12 01:42:13,022 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/unroll-4.wvr.c [2022-12-12 01:42:14,137 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-12 01:42:14,339 INFO L351 CDTParser]: Found 1 translation units. [2022-12-12 01:42:14,339 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-4.wvr.c [2022-12-12 01:42:14,344 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa9c1c838/53dcdbbecea24f1ca7a961af3d2edf34/FLAG6c1d05e45 [2022-12-12 01:42:14,355 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa9c1c838/53dcdbbecea24f1ca7a961af3d2edf34 [2022-12-12 01:42:14,357 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-12 01:42:14,358 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-12 01:42:14,359 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-12 01:42:14,359 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-12 01:42:14,361 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-12 01:42:14,362 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 01:42:14" (1/1) ... [2022-12-12 01:42:14,363 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b23167b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 01:42:14, skipping insertion in model container [2022-12-12 01:42:14,363 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 01:42:14" (1/1) ... [2022-12-12 01:42:14,367 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-12 01:42:14,387 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-12 01:42:14,514 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-4.wvr.c[2572,2585] [2022-12-12 01:42:14,524 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 01:42:14,531 INFO L203 MainTranslator]: Completed pre-run [2022-12-12 01:42:14,551 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-4.wvr.c[2572,2585] [2022-12-12 01:42:14,554 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 01:42:14,566 INFO L208 MainTranslator]: Completed translation [2022-12-12 01:42:14,568 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 01:42:14 WrapperNode [2022-12-12 01:42:14,569 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-12 01:42:14,571 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-12 01:42:14,571 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-12 01:42:14,571 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-12 01:42:14,577 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 01:42:14" (1/1) ... [2022-12-12 01:42:14,596 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 01:42:14" (1/1) ... [2022-12-12 01:42:14,628 INFO L138 Inliner]: procedures = 24, calls = 36, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 154 [2022-12-12 01:42:14,628 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-12 01:42:14,629 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-12 01:42:14,629 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-12 01:42:14,629 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-12 01:42:14,637 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 01:42:14" (1/1) ... [2022-12-12 01:42:14,637 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 01:42:14" (1/1) ... [2022-12-12 01:42:14,648 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 01:42:14" (1/1) ... [2022-12-12 01:42:14,648 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 01:42:14" (1/1) ... [2022-12-12 01:42:14,653 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 01:42:14" (1/1) ... [2022-12-12 01:42:14,656 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 01:42:14" (1/1) ... [2022-12-12 01:42:14,658 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 01:42:14" (1/1) ... [2022-12-12 01:42:14,659 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 01:42:14" (1/1) ... [2022-12-12 01:42:14,661 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-12 01:42:14,662 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-12 01:42:14,662 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-12 01:42:14,662 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-12 01:42:14,663 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 01:42:14" (1/1) ... [2022-12-12 01:42:14,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 01:42:14,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 01:42:14,705 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) [2022-12-12 01:42:14,727 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 [2022-12-12 01:42:14,744 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-12 01:42:14,745 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-12 01:42:14,745 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-12 01:42:14,745 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-12 01:42:14,745 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-12 01:42:14,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-12 01:42:14,745 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-12 01:42:14,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-12 01:42:14,745 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-12 01:42:14,746 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-12 01:42:14,746 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-12 01:42:14,746 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-12 01:42:14,746 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-12 01:42:14,748 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-12 01:42:14,861 INFO L236 CfgBuilder]: Building ICFG [2022-12-12 01:42:14,863 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-12 01:42:15,176 INFO L277 CfgBuilder]: Performing block encoding [2022-12-12 01:42:15,185 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-12 01:42:15,185 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-12 01:42:15,187 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 01:42:15 BoogieIcfgContainer [2022-12-12 01:42:15,187 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-12 01:42:15,190 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-12 01:42:15,190 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-12 01:42:15,193 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-12 01:42:15,193 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.12 01:42:14" (1/3) ... [2022-12-12 01:42:15,194 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b33a0f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 01:42:15, skipping insertion in model container [2022-12-12 01:42:15,194 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 01:42:14" (2/3) ... [2022-12-12 01:42:15,194 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b33a0f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 01:42:15, skipping insertion in model container [2022-12-12 01:42:15,194 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 01:42:15" (3/3) ... [2022-12-12 01:42:15,195 INFO L112 eAbstractionObserver]: Analyzing ICFG unroll-4.wvr.c [2022-12-12 01:42:15,212 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-12 01:42:15,212 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-12 01:42:15,212 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-12 01:42:15,285 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-12 01:42:15,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 171 places, 180 transitions, 376 flow [2022-12-12 01:42:15,382 INFO L130 PetriNetUnfolder]: 16/178 cut-off events. [2022-12-12 01:42:15,383 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-12 01:42:15,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 178 events. 16/178 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 161 event pairs, 0 based on Foata normal form. 0/161 useless extension candidates. Maximal degree in co-relation 97. Up to 2 conditions per place. [2022-12-12 01:42:15,390 INFO L82 GeneralOperation]: Start removeDead. Operand has 171 places, 180 transitions, 376 flow [2022-12-12 01:42:15,394 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 161 places, 170 transitions, 352 flow [2022-12-12 01:42:15,403 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-12 01:42:15,410 INFO L357 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=false, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7771d74b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-12 01:42:15,410 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-12 01:42:15,468 INFO L130 PetriNetUnfolder]: 13/140 cut-off events. [2022-12-12 01:42:15,468 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-12 01:42:15,469 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 01:42:15,470 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 01:42:15,470 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 01:42:15,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 01:42:15,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1113505846, now seen corresponding path program 1 times [2022-12-12 01:42:15,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 01:42:15,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40201287] [2022-12-12 01:42:15,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 01:42:15,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 01:42:15,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 01:42:16,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 01:42:16,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 01:42:16,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40201287] [2022-12-12 01:42:16,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40201287] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 01:42:16,262 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 01:42:16,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-12 01:42:16,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699538434] [2022-12-12 01:42:16,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 01:42:16,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-12 01:42:16,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 01:42:16,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-12 01:42:16,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-12 01:42:16,310 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 180 [2022-12-12 01:42:16,315 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 170 transitions, 352 flow. Second operand has 8 states, 8 states have (on average 124.0) internal successors, (992), 8 states have internal predecessors, (992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 01:42:16,315 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 01:42:16,315 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 180 [2022-12-12 01:42:16,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 01:42:16,514 INFO L130 PetriNetUnfolder]: 24/316 cut-off events. [2022-12-12 01:42:16,515 INFO L131 PetriNetUnfolder]: For 39/40 co-relation queries the response was YES. [2022-12-12 01:42:16,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 418 conditions, 316 events. 24/316 cut-off events. For 39/40 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 788 event pairs, 9 based on Foata normal form. 34/318 useless extension candidates. Maximal degree in co-relation 258. Up to 67 conditions per place. [2022-12-12 01:42:16,523 INFO L137 encePairwiseOnDemand]: 159/180 looper letters, 38 selfloop transitions, 7 changer transitions 5/161 dead transitions. [2022-12-12 01:42:16,523 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 161 transitions, 434 flow [2022-12-12 01:42:16,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-12 01:42:16,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-12 01:42:16,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1025 transitions. [2022-12-12 01:42:16,543 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7118055555555556 [2022-12-12 01:42:16,547 INFO L295 CegarLoopForPetriNet]: 161 programPoint places, 7 predicate places. [2022-12-12 01:42:16,548 INFO L82 GeneralOperation]: Start removeDead. Operand has 168 places, 161 transitions, 434 flow [2022-12-12 01:42:16,551 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 163 places, 156 transitions, 414 flow [2022-12-12 01:42:16,552 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 156 transitions, 414 flow [2022-12-12 01:42:16,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 124.0) internal successors, (992), 8 states have internal predecessors, (992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 01:42:16,554 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 01:42:16,554 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 01:42:16,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-12 01:42:16,554 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 01:42:16,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 01:42:16,555 INFO L85 PathProgramCache]: Analyzing trace with hash -345150957, now seen corresponding path program 1 times [2022-12-12 01:42:16,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 01:42:16,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201916395] [2022-12-12 01:42:16,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 01:42:16,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 01:42:16,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 01:42:16,823 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 01:42:16,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 01:42:16,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201916395] [2022-12-12 01:42:16,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201916395] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 01:42:16,825 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 01:42:16,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-12 01:42:16,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399711879] [2022-12-12 01:42:16,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 01:42:16,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-12 01:42:16,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 01:42:16,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-12 01:42:16,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-12 01:42:16,830 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 180 [2022-12-12 01:42:16,831 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 156 transitions, 414 flow. Second operand has 6 states, 6 states have (on average 124.33333333333333) internal successors, (746), 6 states have internal predecessors, (746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 01:42:16,831 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 01:42:16,832 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 180 [2022-12-12 01:42:16,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 01:42:17,089 INFO L130 PetriNetUnfolder]: 121/734 cut-off events. [2022-12-12 01:42:17,089 INFO L131 PetriNetUnfolder]: For 253/261 co-relation queries the response was YES. [2022-12-12 01:42:17,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1207 conditions, 734 events. 121/734 cut-off events. For 253/261 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 4008 event pairs, 38 based on Foata normal form. 1/676 useless extension candidates. Maximal degree in co-relation 957. Up to 140 conditions per place. [2022-12-12 01:42:17,094 INFO L137 encePairwiseOnDemand]: 173/180 looper letters, 65 selfloop transitions, 5 changer transitions 4/189 dead transitions. [2022-12-12 01:42:17,094 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 189 transitions, 681 flow [2022-12-12 01:42:17,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-12 01:42:17,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-12 01:42:17,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 795 transitions. [2022-12-12 01:42:17,098 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7361111111111112 [2022-12-12 01:42:17,099 INFO L295 CegarLoopForPetriNet]: 161 programPoint places, 7 predicate places. [2022-12-12 01:42:17,101 INFO L82 GeneralOperation]: Start removeDead. Operand has 168 places, 189 transitions, 681 flow [2022-12-12 01:42:17,108 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 166 places, 185 transitions, 654 flow [2022-12-12 01:42:17,108 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 185 transitions, 654 flow [2022-12-12 01:42:17,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 124.33333333333333) internal successors, (746), 6 states have internal predecessors, (746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 01:42:17,114 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 01:42:17,115 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 01:42:17,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-12 01:42:17,115 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 01:42:17,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 01:42:17,123 INFO L85 PathProgramCache]: Analyzing trace with hash -1460701551, now seen corresponding path program 1 times [2022-12-12 01:42:17,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 01:42:17,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395466229] [2022-12-12 01:42:17,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 01:42:17,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 01:42:17,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 01:42:17,445 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 01:42:17,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 01:42:17,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395466229] [2022-12-12 01:42:17,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395466229] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 01:42:17,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [818688933] [2022-12-12 01:42:17,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 01:42:17,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 01:42:17,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 01:42:17,459 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) [2022-12-12 01:42:17,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-12 01:42:17,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 01:42:17,563 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-12 01:42:17,571 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 01:42:17,701 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 01:42:17,702 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 01:42:17,798 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 01:42:17,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [818688933] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-12 01:42:17,799 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-12 01:42:17,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 5] total 9 [2022-12-12 01:42:17,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955922939] [2022-12-12 01:42:17,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 01:42:17,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 01:42:17,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 01:42:17,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 01:42:17,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-12-12 01:42:17,802 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 180 [2022-12-12 01:42:17,803 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 185 transitions, 654 flow. Second operand has 4 states, 4 states have (on average 148.75) internal successors, (595), 4 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 01:42:17,803 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 01:42:17,803 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 180 [2022-12-12 01:42:17,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 01:42:17,959 INFO L130 PetriNetUnfolder]: 212/1089 cut-off events. [2022-12-12 01:42:17,959 INFO L131 PetriNetUnfolder]: For 668/676 co-relation queries the response was YES. [2022-12-12 01:42:17,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1992 conditions, 1089 events. 212/1089 cut-off events. For 668/676 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 6817 event pairs, 53 based on Foata normal form. 0/972 useless extension candidates. Maximal degree in co-relation 1368. Up to 184 conditions per place. [2022-12-12 01:42:17,966 INFO L137 encePairwiseOnDemand]: 175/180 looper letters, 31 selfloop transitions, 5 changer transitions 0/197 dead transitions. [2022-12-12 01:42:17,966 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 197 transitions, 778 flow [2022-12-12 01:42:17,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 01:42:17,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 01:42:17,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 616 transitions. [2022-12-12 01:42:17,968 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8555555555555555 [2022-12-12 01:42:17,969 INFO L295 CegarLoopForPetriNet]: 161 programPoint places, 8 predicate places. [2022-12-12 01:42:17,969 INFO L82 GeneralOperation]: Start removeDead. Operand has 169 places, 197 transitions, 778 flow [2022-12-12 01:42:17,974 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 169 places, 197 transitions, 778 flow [2022-12-12 01:42:17,974 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 197 transitions, 778 flow [2022-12-12 01:42:17,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 148.75) internal successors, (595), 4 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 01:42:17,975 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 01:42:17,975 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 01:42:17,983 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-12-12 01:42:18,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 01:42:18,182 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 01:42:18,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 01:42:18,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1307022583, now seen corresponding path program 2 times [2022-12-12 01:42:18,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 01:42:18,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191528643] [2022-12-12 01:42:18,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 01:42:18,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 01:42:18,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 01:42:18,337 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 01:42:18,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 01:42:18,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191528643] [2022-12-12 01:42:18,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191528643] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 01:42:18,338 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 01:42:18,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-12 01:42:18,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974336279] [2022-12-12 01:42:18,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 01:42:18,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 01:42:18,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 01:42:18,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 01:42:18,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-12 01:42:18,342 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 180 [2022-12-12 01:42:18,343 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 197 transitions, 778 flow. Second operand has 5 states, 5 states have (on average 145.8) internal successors, (729), 5 states have internal predecessors, (729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 01:42:18,343 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 01:42:18,343 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 180 [2022-12-12 01:42:18,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 01:42:18,593 INFO L130 PetriNetUnfolder]: 313/1463 cut-off events. [2022-12-12 01:42:18,593 INFO L131 PetriNetUnfolder]: For 1281/1384 co-relation queries the response was YES. [2022-12-12 01:42:18,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3036 conditions, 1463 events. 313/1463 cut-off events. For 1281/1384 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 9682 event pairs, 95 based on Foata normal form. 12/1326 useless extension candidates. Maximal degree in co-relation 2248. Up to 236 conditions per place. [2022-12-12 01:42:18,603 INFO L137 encePairwiseOnDemand]: 172/180 looper letters, 73 selfloop transitions, 12 changer transitions 10/253 dead transitions. [2022-12-12 01:42:18,603 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 253 transitions, 1222 flow [2022-12-12 01:42:18,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-12 01:42:18,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-12 01:42:18,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 928 transitions. [2022-12-12 01:42:18,606 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8592592592592593 [2022-12-12 01:42:18,607 INFO L295 CegarLoopForPetriNet]: 161 programPoint places, 13 predicate places. [2022-12-12 01:42:18,607 INFO L82 GeneralOperation]: Start removeDead. Operand has 174 places, 253 transitions, 1222 flow [2022-12-12 01:42:18,614 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 174 places, 243 transitions, 1141 flow [2022-12-12 01:42:18,615 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 243 transitions, 1141 flow [2022-12-12 01:42:18,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 145.8) internal successors, (729), 5 states have internal predecessors, (729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 01:42:18,615 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 01:42:18,616 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 01:42:18,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-12 01:42:18,616 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 01:42:18,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 01:42:18,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1744701743, now seen corresponding path program 3 times [2022-12-12 01:42:18,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 01:42:18,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401966912] [2022-12-12 01:42:18,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 01:42:18,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 01:42:18,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 01:42:18,708 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 01:42:18,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 01:42:18,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401966912] [2022-12-12 01:42:18,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401966912] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 01:42:18,709 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 01:42:18,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 01:42:18,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037719712] [2022-12-12 01:42:18,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 01:42:18,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 01:42:18,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 01:42:18,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 01:42:18,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-12 01:42:18,711 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 180 [2022-12-12 01:42:18,712 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 243 transitions, 1141 flow. Second operand has 4 states, 4 states have (on average 148.75) internal successors, (595), 4 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 01:42:18,712 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 01:42:18,712 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 180 [2022-12-12 01:42:18,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 01:42:18,942 INFO L130 PetriNetUnfolder]: 344/1657 cut-off events. [2022-12-12 01:42:18,942 INFO L131 PetriNetUnfolder]: For 1908/2027 co-relation queries the response was YES. [2022-12-12 01:42:18,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3821 conditions, 1657 events. 344/1657 cut-off events. For 1908/2027 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 11030 event pairs, 116 based on Foata normal form. 1/1489 useless extension candidates. Maximal degree in co-relation 2885. Up to 304 conditions per place. [2022-12-12 01:42:18,954 INFO L137 encePairwiseOnDemand]: 174/180 looper letters, 83 selfloop transitions, 14 changer transitions 2/266 dead transitions. [2022-12-12 01:42:18,954 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 266 transitions, 1512 flow [2022-12-12 01:42:18,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 01:42:18,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 01:42:18,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 761 transitions. [2022-12-12 01:42:18,956 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8455555555555555 [2022-12-12 01:42:18,957 INFO L295 CegarLoopForPetriNet]: 161 programPoint places, 17 predicate places. [2022-12-12 01:42:18,957 INFO L82 GeneralOperation]: Start removeDead. Operand has 178 places, 266 transitions, 1512 flow [2022-12-12 01:42:18,965 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 178 places, 264 transitions, 1496 flow [2022-12-12 01:42:18,965 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 264 transitions, 1496 flow [2022-12-12 01:42:18,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 148.75) internal successors, (595), 4 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 01:42:18,966 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 01:42:18,966 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 01:42:18,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-12 01:42:18,966 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 01:42:18,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 01:42:18,967 INFO L85 PathProgramCache]: Analyzing trace with hash -907856545, now seen corresponding path program 4 times [2022-12-12 01:42:18,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 01:42:18,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863271863] [2022-12-12 01:42:18,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 01:42:18,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 01:42:18,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 01:42:19,056 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 01:42:19,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 01:42:19,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863271863] [2022-12-12 01:42:19,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863271863] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 01:42:19,056 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 01:42:19,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 01:42:19,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173879134] [2022-12-12 01:42:19,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 01:42:19,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 01:42:19,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 01:42:19,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 01:42:19,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-12 01:42:19,058 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 180 [2022-12-12 01:42:19,059 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 264 transitions, 1496 flow. Second operand has 4 states, 4 states have (on average 148.75) internal successors, (595), 4 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 01:42:19,059 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 01:42:19,059 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 180 [2022-12-12 01:42:19,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 01:42:19,287 INFO L130 PetriNetUnfolder]: 340/1623 cut-off events. [2022-12-12 01:42:19,287 INFO L131 PetriNetUnfolder]: For 2791/2995 co-relation queries the response was YES. [2022-12-12 01:42:19,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4158 conditions, 1623 events. 340/1623 cut-off events. For 2791/2995 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 10685 event pairs, 113 based on Foata normal form. 4/1469 useless extension candidates. Maximal degree in co-relation 3780. Up to 305 conditions per place. [2022-12-12 01:42:19,299 INFO L137 encePairwiseOnDemand]: 175/180 looper letters, 78 selfloop transitions, 17 changer transitions 0/260 dead transitions. [2022-12-12 01:42:19,299 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 260 transitions, 1655 flow [2022-12-12 01:42:19,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 01:42:19,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 01:42:19,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 615 transitions. [2022-12-12 01:42:19,301 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8541666666666666 [2022-12-12 01:42:19,302 INFO L295 CegarLoopForPetriNet]: 161 programPoint places, 19 predicate places. [2022-12-12 01:42:19,302 INFO L82 GeneralOperation]: Start removeDead. Operand has 180 places, 260 transitions, 1655 flow [2022-12-12 01:42:19,310 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 180 places, 260 transitions, 1655 flow [2022-12-12 01:42:19,310 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 260 transitions, 1655 flow [2022-12-12 01:42:19,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 148.75) internal successors, (595), 4 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 01:42:19,311 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 01:42:19,311 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 01:42:19,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-12 01:42:19,312 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 01:42:19,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 01:42:19,312 INFO L85 PathProgramCache]: Analyzing trace with hash -421275834, now seen corresponding path program 1 times [2022-12-12 01:42:19,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 01:42:19,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428646578] [2022-12-12 01:42:19,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 01:42:19,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 01:42:19,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 01:42:19,451 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 01:42:19,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 01:42:19,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428646578] [2022-12-12 01:42:19,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428646578] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 01:42:19,452 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 01:42:19,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 01:42:19,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747383081] [2022-12-12 01:42:19,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 01:42:19,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 01:42:19,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 01:42:19,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 01:42:19,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-12 01:42:19,454 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 180 [2022-12-12 01:42:19,455 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 260 transitions, 1655 flow. Second operand has 4 states, 4 states have (on average 154.75) internal successors, (619), 4 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 01:42:19,455 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 01:42:19,455 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 180 [2022-12-12 01:42:19,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 01:42:19,739 INFO L130 PetriNetUnfolder]: 427/2032 cut-off events. [2022-12-12 01:42:19,739 INFO L131 PetriNetUnfolder]: For 3911/4196 co-relation queries the response was YES. [2022-12-12 01:42:19,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5454 conditions, 2032 events. 427/2032 cut-off events. For 3911/4196 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 14600 event pairs, 128 based on Foata normal form. 6/1845 useless extension candidates. Maximal degree in co-relation 5047. Up to 381 conditions per place. [2022-12-12 01:42:19,756 INFO L137 encePairwiseOnDemand]: 175/180 looper letters, 64 selfloop transitions, 8 changer transitions 0/268 dead transitions. [2022-12-12 01:42:19,756 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 268 transitions, 1861 flow [2022-12-12 01:42:19,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 01:42:19,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 01:42:19,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 632 transitions. [2022-12-12 01:42:19,758 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8777777777777778 [2022-12-12 01:42:19,758 INFO L295 CegarLoopForPetriNet]: 161 programPoint places, 22 predicate places. [2022-12-12 01:42:19,758 INFO L82 GeneralOperation]: Start removeDead. Operand has 183 places, 268 transitions, 1861 flow [2022-12-12 01:42:19,770 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 183 places, 268 transitions, 1861 flow [2022-12-12 01:42:19,770 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 268 transitions, 1861 flow [2022-12-12 01:42:19,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 154.75) internal successors, (619), 4 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 01:42:19,771 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 01:42:19,771 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 01:42:19,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-12 01:42:19,772 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 01:42:19,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 01:42:19,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1439585468, now seen corresponding path program 2 times [2022-12-12 01:42:19,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 01:42:19,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319270473] [2022-12-12 01:42:19,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 01:42:19,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 01:42:19,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 01:42:19,907 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 01:42:19,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 01:42:19,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319270473] [2022-12-12 01:42:19,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319270473] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 01:42:19,908 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 01:42:19,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 01:42:19,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655517530] [2022-12-12 01:42:19,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 01:42:19,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 01:42:19,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 01:42:19,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 01:42:19,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-12 01:42:19,910 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 180 [2022-12-12 01:42:19,911 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 268 transitions, 1861 flow. Second operand has 4 states, 4 states have (on average 154.75) internal successors, (619), 4 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 01:42:19,911 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 01:42:19,911 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 180 [2022-12-12 01:42:19,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 01:42:20,181 INFO L130 PetriNetUnfolder]: 393/1901 cut-off events. [2022-12-12 01:42:20,181 INFO L131 PetriNetUnfolder]: For 3594/3820 co-relation queries the response was YES. [2022-12-12 01:42:20,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5267 conditions, 1901 events. 393/1901 cut-off events. For 3594/3820 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 12772 event pairs, 122 based on Foata normal form. 12/1742 useless extension candidates. Maximal degree in co-relation 4604. Up to 346 conditions per place. [2022-12-12 01:42:20,194 INFO L137 encePairwiseOnDemand]: 175/180 looper letters, 50 selfloop transitions, 14 changer transitions 0/244 dead transitions. [2022-12-12 01:42:20,195 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 244 transitions, 1700 flow [2022-12-12 01:42:20,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 01:42:20,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 01:42:20,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 633 transitions. [2022-12-12 01:42:20,197 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8791666666666667 [2022-12-12 01:42:20,199 INFO L295 CegarLoopForPetriNet]: 161 programPoint places, 23 predicate places. [2022-12-12 01:42:20,199 INFO L82 GeneralOperation]: Start removeDead. Operand has 184 places, 244 transitions, 1700 flow [2022-12-12 01:42:20,211 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 184 places, 244 transitions, 1700 flow [2022-12-12 01:42:20,212 INFO L495 AbstractCegarLoop]: Abstraction has has 184 places, 244 transitions, 1700 flow [2022-12-12 01:42:20,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 154.75) internal successors, (619), 4 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 01:42:20,212 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 01:42:20,213 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 01:42:20,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-12 01:42:20,213 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 01:42:20,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 01:42:20,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1275307800, now seen corresponding path program 1 times [2022-12-12 01:42:20,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 01:42:20,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213647347] [2022-12-12 01:42:20,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 01:42:20,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 01:42:20,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 01:42:20,471 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 01:42:20,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 01:42:20,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213647347] [2022-12-12 01:42:20,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213647347] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 01:42:20,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [383138192] [2022-12-12 01:42:20,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 01:42:20,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 01:42:20,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 01:42:20,476 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) [2022-12-12 01:42:20,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-12 01:42:20,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 01:42:20,577 INFO L263 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 39 conjunts are in the unsatisfiable core [2022-12-12 01:42:20,582 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 01:42:21,383 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-12 01:42:21,386 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 01:42:21,388 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 10 [2022-12-12 01:42:21,471 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 01:42:21,472 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 01:42:22,019 INFO L321 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2022-12-12 01:42:22,020 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2022-12-12 01:42:22,809 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 01:42:22,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [383138192] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 01:42:22,810 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 01:42:22,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 23, 18] total 38 [2022-12-12 01:42:22,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77545059] [2022-12-12 01:42:22,810 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 01:42:22,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-12-12 01:42:22,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 01:42:22,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-12-12 01:42:22,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=1261, Unknown=0, NotChecked=0, Total=1406 [2022-12-12 01:42:22,815 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 180 [2022-12-12 01:42:22,819 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 244 transitions, 1700 flow. Second operand has 38 states, 38 states have (on average 70.6842105263158) internal successors, (2686), 38 states have internal predecessors, (2686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 01:42:22,819 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 01:42:22,819 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 180 [2022-12-12 01:42:22,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 01:42:35,980 INFO L130 PetriNetUnfolder]: 11754/24594 cut-off events. [2022-12-12 01:42:35,980 INFO L131 PetriNetUnfolder]: For 53793/54483 co-relation queries the response was YES. [2022-12-12 01:42:36,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77534 conditions, 24594 events. 11754/24594 cut-off events. For 53793/54483 co-relation queries the response was YES. Maximal size of possible extension queue 357. Compared 211837 event pairs, 621 based on Foata normal form. 98/22951 useless extension candidates. Maximal degree in co-relation 62474. Up to 4093 conditions per place. [2022-12-12 01:42:36,172 INFO L137 encePairwiseOnDemand]: 124/180 looper letters, 881 selfloop transitions, 299 changer transitions 661/1913 dead transitions. [2022-12-12 01:42:36,172 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 353 places, 1913 transitions, 13785 flow [2022-12-12 01:42:36,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 170 states. [2022-12-12 01:42:36,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2022-12-12 01:42:36,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 12551 transitions. [2022-12-12 01:42:36,204 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.41016339869281043 [2022-12-12 01:42:36,205 INFO L295 CegarLoopForPetriNet]: 161 programPoint places, 192 predicate places. [2022-12-12 01:42:36,205 INFO L82 GeneralOperation]: Start removeDead. Operand has 353 places, 1913 transitions, 13785 flow [2022-12-12 01:42:36,290 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 276 places, 1252 transitions, 9193 flow [2022-12-12 01:42:36,291 INFO L495 AbstractCegarLoop]: Abstraction has has 276 places, 1252 transitions, 9193 flow [2022-12-12 01:42:36,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 70.6842105263158) internal successors, (2686), 38 states have internal predecessors, (2686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 01:42:36,293 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 01:42:36,293 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 01:42:36,303 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-12 01:42:36,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-12-12 01:42:36,503 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 01:42:36,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 01:42:36,504 INFO L85 PathProgramCache]: Analyzing trace with hash 2072663946, now seen corresponding path program 2 times [2022-12-12 01:42:36,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 01:42:36,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16180972] [2022-12-12 01:42:36,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 01:42:36,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 01:42:36,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 01:42:36,928 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 01:42:36,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 01:42:36,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16180972] [2022-12-12 01:42:36,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16180972] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 01:42:36,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [281854105] [2022-12-12 01:42:36,929 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-12 01:42:36,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 01:42:36,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 01:42:36,932 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) [2022-12-12 01:42:36,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-12 01:42:37,103 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-12 01:42:37,103 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 01:42:37,106 INFO L263 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 53 conjunts are in the unsatisfiable core [2022-12-12 01:42:37,116 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 01:42:37,373 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-12 01:42:37,567 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-12 01:42:37,609 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-12 01:42:38,440 INFO L321 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-12-12 01:42:38,441 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 10 [2022-12-12 01:42:38,569 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 01:42:38,570 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 01:42:39,680 WARN L837 $PredicateComparison]: unable to prove that (forall ((~x1~0 Int) (~x2~0 Int) (v_ArrVal_158 (Array Int Int))) (or (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_158) c_~f~0.base))) (= (select .cse0 (+ c_~f~0.offset (* ~x2~0 4))) (select .cse0 (+ (* ~x1~0 4) c_~f~0.offset)))) (< ~x1~0 0) (<= c_~size~0 ~x1~0) (< ~x2~0 0) (<= c_~size~0 ~x2~0))) is different from false [2022-12-12 01:42:39,818 WARN L837 $PredicateComparison]: unable to prove that (forall ((~x1~0 Int) (~x2~0 Int) (v_ArrVal_157 (Array Int Int)) (v_ArrVal_158 (Array Int Int))) (or (< ~x1~0 0) (<= c_~size~0 ~x1~0) (< ~x2~0 0) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_157) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_158) c_~f~0.base))) (= (select .cse0 (+ c_~f~0.offset (* ~x2~0 4))) (select .cse0 (+ (* ~x1~0 4) c_~f~0.offset)))) (<= c_~size~0 ~x2~0))) is different from false [2022-12-12 01:42:39,968 WARN L837 $PredicateComparison]: unable to prove that (forall ((~x1~0 Int) (~x2~0 Int) (v_ArrVal_157 (Array Int Int)) (v_ArrVal_158 (Array Int Int))) (or (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_157) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_158) |c_ULTIMATE.start_main_#t~ret13#1.base|))) (= (select .cse0 (+ |c_ULTIMATE.start_main_#t~ret13#1.offset| (* ~x2~0 4))) (select .cse0 (+ (* ~x1~0 4) |c_ULTIMATE.start_main_#t~ret13#1.offset|)))) (< ~x1~0 0) (<= c_~size~0 ~x1~0) (< ~x2~0 0) (<= c_~size~0 ~x2~0))) is different from false [2022-12-12 01:42:39,984 WARN L837 $PredicateComparison]: unable to prove that (forall ((~x1~0 Int) (~x2~0 Int) (v_ArrVal_157 (Array Int Int)) (v_ArrVal_158 (Array Int Int))) (or (< ~x1~0 0) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_157) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_158) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (= (select .cse0 (+ (* ~x1~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (select .cse0 (+ (* ~x2~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (<= c_~size~0 ~x1~0) (< ~x2~0 0) (<= c_~size~0 ~x2~0))) is different from false [2022-12-12 01:42:40,001 WARN L837 $PredicateComparison]: unable to prove that (forall ((~x1~0 Int) (~x2~0 Int) (v_ArrVal_157 (Array Int Int)) (v_ArrVal_158 (Array Int Int))) (or (< ~x1~0 0) (<= c_~size~0 ~x1~0) (< ~x2~0 0) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_157) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_158) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (= (select .cse0 (+ (* ~x2~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select .cse0 (+ (* ~x1~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (<= c_~size~0 ~x2~0))) is different from false [2022-12-12 01:42:40,301 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 01:42:40,302 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 44 [2022-12-12 01:42:40,313 INFO L321 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2022-12-12 01:42:40,314 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 85 [2022-12-12 01:42:40,322 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-12 01:42:40,323 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 54 [2022-12-12 01:42:40,330 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-12 01:42:40,331 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 20 [2022-12-12 01:42:40,516 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2022-12-12 01:42:40,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [281854105] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 01:42:40,517 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 01:42:40,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 29, 26] total 55 [2022-12-12 01:42:40,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617849345] [2022-12-12 01:42:40,517 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 01:42:40,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-12-12 01:42:40,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 01:42:40,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-12-12 01:42:40,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=2223, Unknown=7, NotChecked=500, Total=2970 [2022-12-12 01:42:40,522 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 180 [2022-12-12 01:42:40,525 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 1252 transitions, 9193 flow. Second operand has 55 states, 55 states have (on average 58.29090909090909) internal successors, (3206), 55 states have internal predecessors, (3206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 01:42:40,525 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 01:42:40,525 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 180 [2022-12-12 01:42:40,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 01:43:22,101 INFO L130 PetriNetUnfolder]: 23410/45749 cut-off events. [2022-12-12 01:43:22,102 INFO L131 PetriNetUnfolder]: For 109382/111437 co-relation queries the response was YES. [2022-12-12 01:43:22,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 174304 conditions, 45749 events. 23410/45749 cut-off events. For 109382/111437 co-relation queries the response was YES. Maximal size of possible extension queue 691. Compared 424131 event pairs, 1773 based on Foata normal form. 288/44280 useless extension candidates. Maximal degree in co-relation 112937. Up to 13638 conditions per place. [2022-12-12 01:43:22,349 INFO L137 encePairwiseOnDemand]: 123/180 looper letters, 1204 selfloop transitions, 99 changer transitions 2610/3978 dead transitions. [2022-12-12 01:43:22,350 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 497 places, 3978 transitions, 35365 flow [2022-12-12 01:43:22,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 222 states. [2022-12-12 01:43:22,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2022-12-12 01:43:22,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 14275 transitions. [2022-12-12 01:43:22,380 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3572322322322322 [2022-12-12 01:43:22,380 INFO L295 CegarLoopForPetriNet]: 161 programPoint places, 336 predicate places. [2022-12-12 01:43:22,381 INFO L82 GeneralOperation]: Start removeDead. Operand has 497 places, 3978 transitions, 35365 flow [2022-12-12 01:43:22,510 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 275 places, 1368 transitions, 12565 flow [2022-12-12 01:43:22,510 INFO L495 AbstractCegarLoop]: Abstraction has has 275 places, 1368 transitions, 12565 flow [2022-12-12 01:43:22,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 58.29090909090909) internal successors, (3206), 55 states have internal predecessors, (3206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 01:43:22,513 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 01:43:22,513 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 01:43:22,527 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-12 01:43:22,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 01:43:22,721 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 01:43:22,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 01:43:22,722 INFO L85 PathProgramCache]: Analyzing trace with hash 990703598, now seen corresponding path program 3 times [2022-12-12 01:43:22,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 01:43:22,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331820442] [2022-12-12 01:43:22,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 01:43:22,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 01:43:22,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 01:43:23,077 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 01:43:23,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 01:43:23,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331820442] [2022-12-12 01:43:23,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331820442] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 01:43:23,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1275300503] [2022-12-12 01:43:23,078 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-12 01:43:23,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 01:43:23,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 01:43:23,080 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) [2022-12-12 01:43:23,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-12 01:43:23,235 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-12 01:43:23,236 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 01:43:23,238 INFO L263 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 42 conjunts are in the unsatisfiable core [2022-12-12 01:43:23,241 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 01:43:24,343 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-12 01:43:24,345 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 01:43:24,345 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 10 [2022-12-12 01:43:24,456 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 10 proven. 25 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-12 01:43:24,456 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 01:43:24,926 INFO L321 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2022-12-12 01:43:24,926 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2022-12-12 01:43:25,446 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-12 01:43:25,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1275300503] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 01:43:25,447 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 01:43:25,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 25, 20] total 47 [2022-12-12 01:43:25,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067817132] [2022-12-12 01:43:25,447 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 01:43:25,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-12-12 01:43:25,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 01:43:25,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-12-12 01:43:25,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=1961, Unknown=0, NotChecked=0, Total=2162 [2022-12-12 01:43:25,452 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 180 [2022-12-12 01:43:25,455 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 1368 transitions, 12565 flow. Second operand has 47 states, 47 states have (on average 66.44680851063829) internal successors, (3123), 47 states have internal predecessors, (3123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 01:43:25,455 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 01:43:25,455 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 180 [2022-12-12 01:43:25,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 01:44:01,789 INFO L130 PetriNetUnfolder]: 15470/32678 cut-off events. [2022-12-12 01:44:01,790 INFO L131 PetriNetUnfolder]: For 98361/101392 co-relation queries the response was YES. [2022-12-12 01:44:01,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152272 conditions, 32678 events. 15470/32678 cut-off events. For 98361/101392 co-relation queries the response was YES. Maximal size of possible extension queue 595. Compared 306789 event pairs, 1572 based on Foata normal form. 315/31806 useless extension candidates. Maximal degree in co-relation 83853. Up to 11117 conditions per place. [2022-12-12 01:44:02,075 INFO L137 encePairwiseOnDemand]: 126/180 looper letters, 1390 selfloop transitions, 473 changer transitions 1279/3210 dead transitions. [2022-12-12 01:44:02,075 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 566 places, 3210 transitions, 34434 flow [2022-12-12 01:44:02,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 292 states. [2022-12-12 01:44:02,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2022-12-12 01:44:02,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 19500 transitions. [2022-12-12 01:44:02,117 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3710045662100457 [2022-12-12 01:44:02,117 INFO L295 CegarLoopForPetriNet]: 161 programPoint places, 405 predicate places. [2022-12-12 01:44:02,118 INFO L82 GeneralOperation]: Start removeDead. Operand has 566 places, 3210 transitions, 34434 flow [2022-12-12 01:44:02,249 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 396 places, 1931 transitions, 20579 flow [2022-12-12 01:44:02,250 INFO L495 AbstractCegarLoop]: Abstraction has has 396 places, 1931 transitions, 20579 flow [2022-12-12 01:44:02,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 66.44680851063829) internal successors, (3123), 47 states have internal predecessors, (3123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 01:44:02,251 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 01:44:02,252 INFO L214 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 01:44:02,267 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-12 01:44:02,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 01:44:02,462 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 01:44:02,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 01:44:02,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1256300094, now seen corresponding path program 4 times [2022-12-12 01:44:02,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 01:44:02,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205714473] [2022-12-12 01:44:02,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 01:44:02,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 01:44:02,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 01:44:05,608 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 01:44:05,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 01:44:05,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205714473] [2022-12-12 01:44:05,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205714473] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 01:44:05,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [953130393] [2022-12-12 01:44:05,612 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-12 01:44:05,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 01:44:05,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 01:44:05,614 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) [2022-12-12 01:44:05,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-12 01:44:05,720 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-12 01:44:05,720 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 01:44:05,722 INFO L263 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 38 conjunts are in the unsatisfiable core [2022-12-12 01:44:05,725 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 01:44:07,611 INFO L321 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-12-12 01:44:07,611 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 10 [2022-12-12 01:44:07,628 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 16 proven. 36 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-12-12 01:44:07,628 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 01:44:07,824 INFO L321 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2022-12-12 01:44:07,824 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2022-12-12 01:44:08,576 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-12-12 01:44:08,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [953130393] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 01:44:08,576 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 01:44:08,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 20, 20] total 67 [2022-12-12 01:44:08,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729825549] [2022-12-12 01:44:08,577 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 01:44:08,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2022-12-12 01:44:08,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 01:44:08,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2022-12-12 01:44:08,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=310, Invalid=4112, Unknown=0, NotChecked=0, Total=4422 [2022-12-12 01:44:08,584 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 180 [2022-12-12 01:44:08,587 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 396 places, 1931 transitions, 20579 flow. Second operand has 67 states, 67 states have (on average 73.55223880597015) internal successors, (4928), 67 states have internal predecessors, (4928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 01:44:08,587 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 01:44:08,587 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 180 [2022-12-12 01:44:08,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 01:44:43,145 INFO L130 PetriNetUnfolder]: 16865/35974 cut-off events. [2022-12-12 01:44:43,146 INFO L131 PetriNetUnfolder]: For 110539/111902 co-relation queries the response was YES. [2022-12-12 01:44:43,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 189077 conditions, 35974 events. 16865/35974 cut-off events. For 110539/111902 co-relation queries the response was YES. Maximal size of possible extension queue 544. Compared 342465 event pairs, 785 based on Foata normal form. 165/35203 useless extension candidates. Maximal degree in co-relation 96017. Up to 12962 conditions per place. [2022-12-12 01:44:43,351 INFO L137 encePairwiseOnDemand]: 134/180 looper letters, 1612 selfloop transitions, 422 changer transitions 1107/3550 dead transitions. [2022-12-12 01:44:43,351 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 565 places, 3550 transitions, 40822 flow [2022-12-12 01:44:43,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 170 states. [2022-12-12 01:44:43,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2022-12-12 01:44:43,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 12887 transitions. [2022-12-12 01:44:43,367 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4211437908496732 [2022-12-12 01:44:43,367 INFO L295 CegarLoopForPetriNet]: 161 programPoint places, 404 predicate places. [2022-12-12 01:44:43,367 INFO L82 GeneralOperation]: Start removeDead. Operand has 565 places, 3550 transitions, 40822 flow [2022-12-12 01:44:43,503 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 469 places, 2443 transitions, 28996 flow [2022-12-12 01:44:43,503 INFO L495 AbstractCegarLoop]: Abstraction has has 469 places, 2443 transitions, 28996 flow [2022-12-12 01:44:43,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 67 states have (on average 73.55223880597015) internal successors, (4928), 67 states have internal predecessors, (4928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 01:44:43,505 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 01:44:43,505 INFO L214 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 01:44:43,512 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-12 01:44:43,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-12-12 01:44:43,706 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 01:44:43,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 01:44:43,707 INFO L85 PathProgramCache]: Analyzing trace with hash -1192948922, now seen corresponding path program 5 times [2022-12-12 01:44:43,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 01:44:43,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306507077] [2022-12-12 01:44:43,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 01:44:43,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 01:44:43,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 01:44:45,819 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 2 proven. 75 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 01:44:45,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 01:44:45,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306507077] [2022-12-12 01:44:45,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306507077] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 01:44:45,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [11170808] [2022-12-12 01:44:45,820 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-12 01:44:45,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 01:44:45,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 01:44:45,822 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 01:44:45,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-12 01:44:46,283 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-12-12 01:44:46,283 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 01:44:46,285 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 44 conjunts are in the unsatisfiable core [2022-12-12 01:44:46,289 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 01:44:48,099 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-12 01:44:48,113 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 16 proven. 36 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-12-12 01:44:48,113 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 01:44:48,268 INFO L321 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2022-12-12 01:44:48,268 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2022-12-12 01:44:49,020 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-12-12 01:44:49,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [11170808] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 01:44:49,021 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 01:44:49,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 25, 20] total 66 [2022-12-12 01:44:49,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821569124] [2022-12-12 01:44:49,021 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 01:44:49,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-12-12 01:44:49,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 01:44:49,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-12-12 01:44:49,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=360, Invalid=3930, Unknown=0, NotChecked=0, Total=4290 [2022-12-12 01:44:49,025 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 180 [2022-12-12 01:44:49,028 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 469 places, 2443 transitions, 28996 flow. Second operand has 66 states, 66 states have (on average 71.25757575757575) internal successors, (4703), 66 states have internal predecessors, (4703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 01:44:49,028 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 01:44:49,028 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 180 [2022-12-12 01:44:49,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 01:45:21,237 INFO L130 PetriNetUnfolder]: 18199/37784 cut-off events. [2022-12-12 01:45:21,238 INFO L131 PetriNetUnfolder]: For 137045/138990 co-relation queries the response was YES. [2022-12-12 01:45:21,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 224532 conditions, 37784 events. 18199/37784 cut-off events. For 137045/138990 co-relation queries the response was YES. Maximal size of possible extension queue 601. Compared 356602 event pairs, 1351 based on Foata normal form. 248/37048 useless extension candidates. Maximal degree in co-relation 113153. Up to 10329 conditions per place. [2022-12-12 01:45:21,468 INFO L137 encePairwiseOnDemand]: 126/180 looper letters, 1762 selfloop transitions, 618 changer transitions 1905/4661 dead transitions. [2022-12-12 01:45:21,469 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 637 places, 4661 transitions, 60284 flow [2022-12-12 01:45:21,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 169 states. [2022-12-12 01:45:21,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2022-12-12 01:45:21,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 12214 transitions. [2022-12-12 01:45:21,483 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4015121630506246 [2022-12-12 01:45:21,484 INFO L295 CegarLoopForPetriNet]: 161 programPoint places, 476 predicate places. [2022-12-12 01:45:21,484 INFO L82 GeneralOperation]: Start removeDead. Operand has 637 places, 4661 transitions, 60284 flow [2022-12-12 01:45:21,714 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 574 places, 2756 transitions, 36502 flow [2022-12-12 01:45:21,714 INFO L495 AbstractCegarLoop]: Abstraction has has 574 places, 2756 transitions, 36502 flow [2022-12-12 01:45:21,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 71.25757575757575) internal successors, (4703), 66 states have internal predecessors, (4703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 01:45:21,716 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 01:45:21,716 INFO L214 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 01:45:21,725 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-12 01:45:21,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 01:45:21,924 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 01:45:21,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 01:45:21,924 INFO L85 PathProgramCache]: Analyzing trace with hash -255059864, now seen corresponding path program 6 times [2022-12-12 01:45:21,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 01:45:21,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231741919] [2022-12-12 01:45:21,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 01:45:21,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 01:45:22,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 01:45:24,943 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 4 proven. 74 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 01:45:24,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 01:45:24,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231741919] [2022-12-12 01:45:24,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231741919] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 01:45:24,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1887849784] [2022-12-12 01:45:24,944 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-12 01:45:24,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 01:45:24,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 01:45:24,946 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 01:45:24,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-12 01:45:25,220 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-12-12 01:45:25,220 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 01:45:25,222 INFO L263 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 38 conjunts are in the unsatisfiable core [2022-12-12 01:45:25,224 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 01:45:26,066 INFO L321 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-12-12 01:45:26,066 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 10 [2022-12-12 01:45:26,091 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 16 proven. 52 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-12 01:45:26,092 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 01:45:26,401 INFO L321 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2022-12-12 01:45:26,401 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2022-12-12 01:45:26,925 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 4 proven. 64 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-12 01:45:26,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1887849784] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 01:45:26,926 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 01:45:26,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 20, 20] total 66 [2022-12-12 01:45:26,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916507602] [2022-12-12 01:45:26,926 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 01:45:26,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-12-12 01:45:26,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 01:45:26,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-12-12 01:45:26,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=369, Invalid=3921, Unknown=0, NotChecked=0, Total=4290 [2022-12-12 01:45:26,931 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 180 [2022-12-12 01:45:26,934 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 574 places, 2756 transitions, 36502 flow. Second operand has 66 states, 66 states have (on average 65.72727272727273) internal successors, (4338), 66 states have internal predecessors, (4338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 01:45:26,934 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 01:45:26,934 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 180 [2022-12-12 01:45:26,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 01:45:38,471 INFO L130 PetriNetUnfolder]: 14841/29729 cut-off events. [2022-12-12 01:45:38,471 INFO L131 PetriNetUnfolder]: For 138166/139901 co-relation queries the response was YES. [2022-12-12 01:45:38,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 198323 conditions, 29729 events. 14841/29729 cut-off events. For 138166/139901 co-relation queries the response was YES. Maximal size of possible extension queue 484. Compared 259146 event pairs, 1359 based on Foata normal form. 135/29046 useless extension candidates. Maximal degree in co-relation 125374. Up to 9451 conditions per place. [2022-12-12 01:45:38,827 INFO L137 encePairwiseOnDemand]: 129/180 looper letters, 2061 selfloop transitions, 549 changer transitions 66/3058 dead transitions. [2022-12-12 01:45:38,827 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 624 places, 3058 transitions, 45502 flow [2022-12-12 01:45:38,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-12-12 01:45:38,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2022-12-12 01:45:38,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 3497 transitions. [2022-12-12 01:45:38,831 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3809368191721133 [2022-12-12 01:45:38,832 INFO L295 CegarLoopForPetriNet]: 161 programPoint places, 463 predicate places. [2022-12-12 01:45:38,832 INFO L82 GeneralOperation]: Start removeDead. Operand has 624 places, 3058 transitions, 45502 flow [2022-12-12 01:45:39,004 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 621 places, 2992 transitions, 44416 flow [2022-12-12 01:45:39,004 INFO L495 AbstractCegarLoop]: Abstraction has has 621 places, 2992 transitions, 44416 flow [2022-12-12 01:45:39,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 65.72727272727273) internal successors, (4338), 66 states have internal predecessors, (4338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 01:45:39,006 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 01:45:39,006 INFO L214 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 01:45:39,012 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-12-12 01:45:39,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 01:45:39,208 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 01:45:39,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 01:45:39,208 INFO L85 PathProgramCache]: Analyzing trace with hash 37712786, now seen corresponding path program 7 times [2022-12-12 01:45:39,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 01:45:39,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114484938] [2022-12-12 01:45:39,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 01:45:39,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 01:45:39,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 01:45:41,079 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 4 proven. 74 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 01:45:41,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 01:45:41,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114484938] [2022-12-12 01:45:41,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114484938] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 01:45:41,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1344589796] [2022-12-12 01:45:41,079 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-12 01:45:41,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 01:45:41,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 01:45:41,081 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 01:45:41,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-12 01:45:41,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 01:45:41,189 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 35 conjunts are in the unsatisfiable core [2022-12-12 01:45:41,192 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 01:45:42,152 INFO L321 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-12-12 01:45:42,152 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 10 [2022-12-12 01:45:42,177 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 16 proven. 52 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-12 01:45:42,177 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 01:45:42,490 INFO L321 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2022-12-12 01:45:42,490 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2022-12-12 01:45:42,931 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 4 proven. 64 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-12 01:45:42,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1344589796] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 01:45:42,932 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 01:45:42,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 20, 20] total 61 [2022-12-12 01:45:42,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606600575] [2022-12-12 01:45:42,932 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 01:45:42,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2022-12-12 01:45:42,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 01:45:42,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2022-12-12 01:45:42,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=326, Invalid=3334, Unknown=0, NotChecked=0, Total=3660 [2022-12-12 01:45:42,935 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 180 [2022-12-12 01:45:42,938 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 621 places, 2992 transitions, 44416 flow. Second operand has 61 states, 61 states have (on average 73.01639344262296) internal successors, (4454), 61 states have internal predecessors, (4454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 01:45:42,938 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 01:45:42,938 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 180 [2022-12-12 01:45:42,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 01:45:54,317 INFO L130 PetriNetUnfolder]: 14754/29516 cut-off events. [2022-12-12 01:45:54,318 INFO L131 PetriNetUnfolder]: For 164584/166616 co-relation queries the response was YES. [2022-12-12 01:45:54,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 218108 conditions, 29516 events. 14754/29516 cut-off events. For 164584/166616 co-relation queries the response was YES. Maximal size of possible extension queue 485. Compared 257947 event pairs, 1325 based on Foata normal form. 123/28836 useless extension candidates. Maximal degree in co-relation 138104. Up to 9451 conditions per place. [2022-12-12 01:45:54,725 INFO L137 encePairwiseOnDemand]: 131/180 looper letters, 692 selfloop transitions, 45 changer transitions 2181/3122 dead transitions. [2022-12-12 01:45:54,725 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 671 places, 3122 transitions, 51722 flow [2022-12-12 01:45:54,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-12-12 01:45:54,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2022-12-12 01:45:54,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 3870 transitions. [2022-12-12 01:45:54,729 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4215686274509804 [2022-12-12 01:45:54,729 INFO L295 CegarLoopForPetriNet]: 161 programPoint places, 510 predicate places. [2022-12-12 01:45:54,729 INFO L82 GeneralOperation]: Start removeDead. Operand has 671 places, 3122 transitions, 51722 flow [2022-12-12 01:45:54,853 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 333 places, 941 transitions, 16025 flow [2022-12-12 01:45:54,853 INFO L495 AbstractCegarLoop]: Abstraction has has 333 places, 941 transitions, 16025 flow [2022-12-12 01:45:54,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 61 states have (on average 73.01639344262296) internal successors, (4454), 61 states have internal predecessors, (4454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 01:45:54,855 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 01:45:54,855 INFO L214 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 01:45:54,861 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-12-12 01:45:55,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-12 01:45:55,061 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 01:45:55,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 01:45:55,061 INFO L85 PathProgramCache]: Analyzing trace with hash 2096778355, now seen corresponding path program 8 times [2022-12-12 01:45:55,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 01:45:55,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45548952] [2022-12-12 01:45:55,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 01:45:55,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 01:45:55,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 01:46:03,522 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 01:46:03,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 01:46:03,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45548952] [2022-12-12 01:46:03,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45548952] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 01:46:03,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1676273347] [2022-12-12 01:46:03,523 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-12 01:46:03,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 01:46:03,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 01:46:03,524 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 01:46:03,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-12 01:46:03,669 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-12 01:46:03,669 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 01:46:03,672 INFO L263 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 99 conjunts are in the unsatisfiable core [2022-12-12 01:46:03,675 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 01:46:04,256 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-12 01:46:04,440 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-12 01:46:04,932 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-12 01:46:05,024 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-12 01:46:08,278 INFO L321 Elim1Store]: treesize reduction 34, result has 30.6 percent of original size [2022-12-12 01:46:08,279 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 107 treesize of output 54 [2022-12-12 01:46:08,466 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 01:46:08,466 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 01:46:17,261 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 01:46:17,261 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 912 treesize of output 417 [2022-12-12 01:46:17,598 INFO L321 Elim1Store]: treesize reduction 5, result has 98.2 percent of original size [2022-12-12 01:46:17,599 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 14 new quantified variables, introduced 28 case distinctions, treesize of input 1046 treesize of output 1157 [2022-12-12 01:46:18,127 INFO L321 Elim1Store]: treesize reduction 12, result has 96.3 percent of original size [2022-12-12 01:46:18,128 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 14 new quantified variables, introduced 28 case distinctions, treesize of input 1072 treesize of output 988 [2022-12-12 01:46:18,735 INFO L321 Elim1Store]: treesize reduction 12, result has 96.3 percent of original size [2022-12-12 01:46:18,736 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 14 new quantified variables, introduced 28 case distinctions, treesize of input 415 treesize of output 565 [2022-12-12 01:47:21,491 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-12-12 01:47:26,477 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-12 01:47:28,501 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-12 01:47:30,818 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-12 01:47:33,265 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-12 01:47:35,711 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-12 01:47:56,175 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-12 01:48:17,008 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-12 01:48:33,259 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-12 01:49:23,268 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 5 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 01:49:23,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1676273347] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 01:49:23,268 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 01:49:23,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 51, 48] total 145 [2022-12-12 01:49:23,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198604353] [2022-12-12 01:49:23,269 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 01:49:23,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 145 states [2022-12-12 01:49:23,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 01:49:23,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 145 interpolants. [2022-12-12 01:49:23,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1557, Invalid=19280, Unknown=43, NotChecked=0, Total=20880 [2022-12-12 01:49:23,277 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 180 [2022-12-12 01:49:23,282 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 333 places, 941 transitions, 16025 flow. Second operand has 145 states, 145 states have (on average 57.36551724137931) internal successors, (8318), 145 states have internal predecessors, (8318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 01:49:23,282 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 01:49:23,282 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 180 [2022-12-12 01:49:23,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 01:53:50,039 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (* c_~x2~0 4)) (.cse5 (* c_~x1~0 4))) (let ((.cse43 (+ .cse5 c_~f~0.offset)) (.cse13 (select |c_#memory_int| c_~f~0.base)) (.cse42 (+ .cse6 c_~f~0.offset))) (let ((.cse55 (select .cse13 .cse42)) (.cse54 (select .cse13 .cse43))) (let ((.cse20 (select .cse13 (+ c_~f~0.offset (* .cse54 4)))) (.cse21 (select .cse13 (+ (* .cse55 4) c_~f~0.offset)))) (let ((.cse11 (select .cse13 (+ c_~f~0.offset (* 4 .cse21)))) (.cse10 (select .cse13 (+ c_~f~0.offset (* .cse20 4))))) (let ((.cse7 (< .cse55 0)) (.cse12 (<= c_~size~0 .cse55)) (.cse16 (< c_~x1~0 0)) (.cse19 (<= c_~size~0 c_~x1~0)) (.cse8 (<= c_~size~0 .cse20)) (.cse9 (< .cse20 0)) (.cse22 (< .cse21 0)) (.cse23 (<= c_~size~0 .cse21)) (.cse24 (= .cse11 .cse10)) (.cse30 (+ .cse6 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse31 (+ .cse5 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse17 (<= c_~size~0 .cse54)) (.cse18 (< .cse54 0)) (.cse14 (= .cse5 .cse6)) (.cse15 (< c_~size~0 2))) (and (forall ((v_ArrVal_311 (Array Int Int)) (v_ArrVal_312 (Array Int Int))) (let ((.cse2 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_311) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_312) |c_ULTIMATE.start_main_#t~ret13#1.base|))) (let ((.cse0 (select .cse2 (+ .cse6 |c_ULTIMATE.start_main_#t~ret13#1.offset|))) (.cse1 (select .cse2 (+ (* 4 (select .cse2 (+ .cse5 |c_ULTIMATE.start_main_#t~ret13#1.offset|))) |c_ULTIMATE.start_main_#t~ret13#1.offset|)))) (let ((.cse3 (select .cse2 (+ |c_ULTIMATE.start_main_#t~ret13#1.offset| (* .cse1 4)))) (.cse4 (select .cse2 (+ (* (select .cse2 (+ |c_ULTIMATE.start_main_#t~ret13#1.offset| (* .cse0 4))) 4) |c_ULTIMATE.start_main_#t~ret13#1.offset|)))) (or (<= c_~size~0 .cse0) (< .cse1 0) (= (select .cse2 (+ (* .cse3 4) |c_ULTIMATE.start_main_#t~ret13#1.offset|)) (select .cse2 (+ |c_ULTIMATE.start_main_#t~ret13#1.offset| (* 4 .cse4)))) (<= c_~size~0 .cse1) (<= c_~size~0 .cse3) (< .cse4 0) (< .cse3 0) (<= c_~size~0 .cse4) (< .cse0 0)))))) (or .cse7 .cse8 .cse9 (< .cse10 0) (< .cse11 0) (<= c_~size~0 .cse10) (<= c_~size~0 .cse11) .cse12 (= (select .cse13 (+ c_~f~0.offset (* .cse10 4))) (select .cse13 (+ c_~f~0.offset (* .cse11 4))))) (or (< (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~i~2#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse14 .cse15) (or (< 2 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|) .cse14 .cse15) (or .cse7 .cse16 .cse17 .cse12 .cse18 .cse19 (= .cse20 .cse21)) (or .cse8 .cse9 (<= c_~size~0 c_~x2~0) .cse22 (< c_~x2~0 0) .cse23 .cse17 .cse18 .cse24) (forall ((v_ArrVal_311 (Array Int Int)) (v_ArrVal_312 (Array Int Int))) (let ((.cse29 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_311) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_312) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse27 (select .cse29 (+ (* 4 (select .cse29 .cse31)) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (.cse28 (select .cse29 .cse30))) (let ((.cse25 (select .cse29 (+ (* (select .cse29 (+ (* .cse28 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (.cse26 (select .cse29 (+ (* .cse27 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (< .cse25 0) (<= c_~size~0 .cse25) (<= c_~size~0 .cse26) (< .cse27 0) (< .cse26 0) (<= c_~size~0 .cse28) (= (select .cse29 (+ (* .cse25 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select .cse29 (+ (* 4 .cse26) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (<= c_~size~0 .cse27) (< .cse28 0)))))) (or .cse16 .cse17 .cse18 .cse19 (= |c_thread2Thread1of1ForFork1_#t~mem9#1| .cse20)) (or .cse8 .cse9 .cse22 .cse23 (= |c_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) .cse17 .cse18 .cse24) (or (forall ((|ULTIMATE.start_create_fresh_int_array_#t~nondet22#1| Int) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_312 (Array Int Int))) (let ((.cse34 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |c_ULTIMATE.start_create_fresh_int_array_#t~post21#1| 4) 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) |ULTIMATE.start_create_fresh_int_array_#t~nondet22#1|)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_311) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_312) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse36 (select .cse34 (+ (* 4 (select .cse34 .cse31)) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (.cse33 (select .cse34 .cse30))) (let ((.cse32 (select .cse34 (+ (* (select .cse34 (+ (* .cse33 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (.cse35 (select .cse34 (+ (* 4 .cse36) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (<= c_~size~0 .cse32) (< .cse33 0) (< .cse32 0) (<= c_~size~0 .cse33) (= (select .cse34 (+ (* .cse32 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select .cse34 (+ (* .cse35 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (<= c_~size~0 .cse36) (< .cse35 0) (< .cse36 0) (<= c_~size~0 .cse35)))))) (< (+ |c_ULTIMATE.start_create_fresh_int_array_#t~post21#1| 2) |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (or (= .cse20 c_~x2~0) .cse17 .cse18) (or .cse14 (< 2 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse15) (forall ((v_ArrVal_311 (Array Int Int)) (v_ArrVal_312 (Array Int Int))) (let ((.cse38 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_311) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_312) c_~f~0.base))) (let ((.cse37 (select .cse38 (+ c_~f~0.offset (* (select .cse38 .cse43) 4)))) (.cse41 (select .cse38 .cse42))) (let ((.cse40 (select .cse38 (+ c_~f~0.offset (* (select .cse38 (+ c_~f~0.offset (* .cse41 4))) 4)))) (.cse39 (select .cse38 (+ c_~f~0.offset (* .cse37 4))))) (or (< .cse37 0) (<= c_~size~0 .cse37) (= (select .cse38 (+ c_~f~0.offset (* 4 .cse39))) (select .cse38 (+ (* .cse40 4) c_~f~0.offset))) (<= c_~size~0 .cse39) (< .cse40 0) (<= c_~size~0 .cse40) (< .cse41 0) (<= c_~size~0 .cse41) (< .cse39 0)))))) (forall ((v_ArrVal_311 (Array Int Int)) (v_ArrVal_312 (Array Int Int))) (let ((.cse44 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_311) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_312) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse47 (select .cse44 (+ (* 4 (select .cse44 (+ .cse5 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (.cse48 (select .cse44 (+ .cse6 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (let ((.cse46 (select .cse44 (+ (* (select .cse44 (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| (* .cse48 4))) 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (.cse45 (select .cse44 (+ (* .cse47 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (or (= (select .cse44 (+ (* .cse45 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (select .cse44 (+ (* .cse46 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (< .cse47 0) (<= c_~size~0 .cse47) (<= c_~size~0 .cse45) (<= c_~size~0 .cse46) (<= c_~size~0 .cse48) (< .cse46 0) (< .cse45 0) (< .cse48 0)))))) (forall ((v_ArrVal_312 (Array Int Int))) (let ((.cse53 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_312) c_~f~0.base))) (let ((.cse51 (select .cse53 .cse42)) (.cse50 (select .cse53 (+ c_~f~0.offset (* (select .cse53 .cse43) 4))))) (let ((.cse52 (select .cse53 (+ c_~f~0.offset (* .cse50 4)))) (.cse49 (select .cse53 (+ c_~f~0.offset (* (select .cse53 (+ (* .cse51 4) c_~f~0.offset)) 4))))) (or (< .cse49 0) (< .cse50 0) (< .cse51 0) (< .cse52 0) (<= c_~size~0 .cse52) (<= c_~size~0 .cse49) (= (select .cse53 (+ (* .cse52 4) c_~f~0.offset)) (select .cse53 (+ c_~f~0.offset (* .cse49 4)))) (<= c_~size~0 .cse51) (<= c_~size~0 .cse50))))))))))))) is different from false [2022-12-12 01:54:00,665 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (* c_~x2~0 4)) (.cse5 (* c_~x1~0 4))) (let ((.cse48 (+ .cse5 c_~f~0.offset)) (.cse13 (select |c_#memory_int| c_~f~0.base)) (.cse47 (+ .cse6 c_~f~0.offset))) (let ((.cse60 (select .cse13 .cse47)) (.cse59 (select .cse13 .cse48))) (let ((.cse26 (select .cse13 (+ c_~f~0.offset (* .cse59 4)))) (.cse27 (select .cse13 (+ (* .cse60 4) c_~f~0.offset)))) (let ((.cse36 (select .cse13 (+ c_~f~0.offset (* 4 |c_thread1Thread1of1ForFork0_#t~mem1#1|)))) (.cse11 (select .cse13 (+ c_~f~0.offset (* 4 .cse27)))) (.cse10 (select .cse13 (+ c_~f~0.offset (* .cse26 4))))) (let ((.cse7 (< .cse60 0)) (.cse12 (<= c_~size~0 .cse60)) (.cse8 (<= c_~size~0 .cse26)) (.cse9 (< .cse26 0)) (.cse21 (= |c_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (.cse28 (= .cse11 .cse10)) (.cse34 (+ .cse6 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse35 (+ .cse5 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse24 (<= c_~size~0 .cse59)) (.cse25 (< .cse59 0)) (.cse14 (= .cse5 .cse6)) (.cse15 (< c_~size~0 2)) (.cse16 (< .cse36 0)) (.cse17 (< .cse27 0)) (.cse18 (= .cse11 (select .cse13 (+ (* .cse36 4) c_~f~0.offset)))) (.cse19 (<= c_~size~0 .cse36)) (.cse20 (<= c_~size~0 .cse27)) (.cse22 (<= c_~size~0 |c_thread1Thread1of1ForFork0_#t~mem1#1|)) (.cse23 (< |c_thread1Thread1of1ForFork0_#t~mem1#1| 0))) (and (forall ((v_ArrVal_311 (Array Int Int)) (v_ArrVal_312 (Array Int Int))) (let ((.cse2 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_311) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_312) |c_ULTIMATE.start_main_#t~ret13#1.base|))) (let ((.cse0 (select .cse2 (+ .cse6 |c_ULTIMATE.start_main_#t~ret13#1.offset|))) (.cse1 (select .cse2 (+ (* 4 (select .cse2 (+ .cse5 |c_ULTIMATE.start_main_#t~ret13#1.offset|))) |c_ULTIMATE.start_main_#t~ret13#1.offset|)))) (let ((.cse3 (select .cse2 (+ |c_ULTIMATE.start_main_#t~ret13#1.offset| (* .cse1 4)))) (.cse4 (select .cse2 (+ (* (select .cse2 (+ |c_ULTIMATE.start_main_#t~ret13#1.offset| (* .cse0 4))) 4) |c_ULTIMATE.start_main_#t~ret13#1.offset|)))) (or (<= c_~size~0 .cse0) (< .cse1 0) (= (select .cse2 (+ (* .cse3 4) |c_ULTIMATE.start_main_#t~ret13#1.offset|)) (select .cse2 (+ |c_ULTIMATE.start_main_#t~ret13#1.offset| (* 4 .cse4)))) (<= c_~size~0 .cse1) (<= c_~size~0 .cse3) (< .cse4 0) (< .cse3 0) (<= c_~size~0 .cse4) (< .cse0 0)))))) (or .cse7 .cse8 .cse9 (< .cse10 0) (< .cse11 0) (<= c_~size~0 .cse10) (<= c_~size~0 .cse11) .cse12 (= (select .cse13 (+ c_~f~0.offset (* .cse10 4))) (select .cse13 (+ c_~f~0.offset (* .cse11 4))))) (or (< (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~i~2#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse14 .cse15) (or .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (or (< 2 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|) .cse14 .cse15) (or .cse7 (< c_~x1~0 0) .cse24 .cse12 .cse25 (<= c_~size~0 c_~x1~0) (= .cse26 .cse27)) (or .cse8 .cse9 (<= c_~size~0 c_~x2~0) .cse17 (< c_~x2~0 0) .cse20 .cse24 .cse25 .cse28) (forall ((v_ArrVal_311 (Array Int Int)) (v_ArrVal_312 (Array Int Int))) (let ((.cse33 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_311) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_312) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse31 (select .cse33 (+ (* 4 (select .cse33 .cse35)) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (.cse32 (select .cse33 .cse34))) (let ((.cse29 (select .cse33 (+ (* (select .cse33 (+ (* .cse32 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (.cse30 (select .cse33 (+ (* .cse31 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (< .cse29 0) (<= c_~size~0 .cse29) (<= c_~size~0 .cse30) (< .cse31 0) (< .cse30 0) (<= c_~size~0 .cse32) (= (select .cse33 (+ (* .cse29 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select .cse33 (+ (* 4 .cse30) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (<= c_~size~0 .cse31) (< .cse32 0)))))) (or (= .cse36 c_~x2~0) .cse22 .cse23) (or .cse8 .cse9 .cse17 .cse20 .cse21 .cse24 .cse25 .cse28) (or (forall ((|ULTIMATE.start_create_fresh_int_array_#t~nondet22#1| Int) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_312 (Array Int Int))) (let ((.cse39 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |c_ULTIMATE.start_create_fresh_int_array_#t~post21#1| 4) 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) |ULTIMATE.start_create_fresh_int_array_#t~nondet22#1|)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_311) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_312) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse41 (select .cse39 (+ (* 4 (select .cse39 .cse35)) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (.cse38 (select .cse39 .cse34))) (let ((.cse37 (select .cse39 (+ (* (select .cse39 (+ (* .cse38 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (.cse40 (select .cse39 (+ (* 4 .cse41) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (<= c_~size~0 .cse37) (< .cse38 0) (< .cse37 0) (<= c_~size~0 .cse38) (= (select .cse39 (+ (* .cse37 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select .cse39 (+ (* .cse40 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (<= c_~size~0 .cse41) (< .cse40 0) (< .cse41 0) (<= c_~size~0 .cse40)))))) (< (+ |c_ULTIMATE.start_create_fresh_int_array_#t~post21#1| 2) |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (or (= .cse26 c_~x2~0) .cse24 .cse25) (or .cse14 (< 2 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse15) (forall ((v_ArrVal_311 (Array Int Int)) (v_ArrVal_312 (Array Int Int))) (let ((.cse43 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_311) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_312) c_~f~0.base))) (let ((.cse42 (select .cse43 (+ c_~f~0.offset (* (select .cse43 .cse48) 4)))) (.cse46 (select .cse43 .cse47))) (let ((.cse45 (select .cse43 (+ c_~f~0.offset (* (select .cse43 (+ c_~f~0.offset (* .cse46 4))) 4)))) (.cse44 (select .cse43 (+ c_~f~0.offset (* .cse42 4))))) (or (< .cse42 0) (<= c_~size~0 .cse42) (= (select .cse43 (+ c_~f~0.offset (* 4 .cse44))) (select .cse43 (+ (* .cse45 4) c_~f~0.offset))) (<= c_~size~0 .cse44) (< .cse45 0) (<= c_~size~0 .cse45) (< .cse46 0) (<= c_~size~0 .cse46) (< .cse44 0)))))) (or .cse16 .cse17 .cse18 .cse19 .cse20 .cse22 .cse23 (= 0 |c_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1|)) (forall ((v_ArrVal_311 (Array Int Int)) (v_ArrVal_312 (Array Int Int))) (let ((.cse49 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_311) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_312) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse52 (select .cse49 (+ (* 4 (select .cse49 (+ .cse5 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (.cse53 (select .cse49 (+ .cse6 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (let ((.cse51 (select .cse49 (+ (* (select .cse49 (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| (* .cse53 4))) 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (.cse50 (select .cse49 (+ (* .cse52 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (or (= (select .cse49 (+ (* .cse50 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (select .cse49 (+ (* .cse51 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (< .cse52 0) (<= c_~size~0 .cse52) (<= c_~size~0 .cse50) (<= c_~size~0 .cse51) (<= c_~size~0 .cse53) (< .cse51 0) (< .cse50 0) (< .cse53 0)))))) (forall ((v_ArrVal_312 (Array Int Int))) (let ((.cse58 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_312) c_~f~0.base))) (let ((.cse56 (select .cse58 .cse47)) (.cse55 (select .cse58 (+ c_~f~0.offset (* (select .cse58 .cse48) 4))))) (let ((.cse57 (select .cse58 (+ c_~f~0.offset (* .cse55 4)))) (.cse54 (select .cse58 (+ c_~f~0.offset (* (select .cse58 (+ (* .cse56 4) c_~f~0.offset)) 4))))) (or (< .cse54 0) (< .cse55 0) (< .cse56 0) (< .cse57 0) (<= c_~size~0 .cse57) (<= c_~size~0 .cse54) (= (select .cse58 (+ (* .cse57 4) c_~f~0.offset)) (select .cse58 (+ c_~f~0.offset (* .cse54 4)))) (<= c_~size~0 .cse56) (<= c_~size~0 .cse55))))))))))))) is different from false [2022-12-12 01:54:09,047 INFO L130 PetriNetUnfolder]: 46204/88873 cut-off events. [2022-12-12 01:54:09,047 INFO L131 PetriNetUnfolder]: For 653013/660990 co-relation queries the response was YES. [2022-12-12 01:54:09,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 725909 conditions, 88873 events. 46204/88873 cut-off events. For 653013/660990 co-relation queries the response was YES. Maximal size of possible extension queue 878. Compared 858116 event pairs, 4022 based on Foata normal form. 146/84287 useless extension candidates. Maximal degree in co-relation 693803. Up to 56153 conditions per place. [2022-12-12 01:54:09,715 INFO L137 encePairwiseOnDemand]: 112/180 looper letters, 5670 selfloop transitions, 3596 changer transitions 480/9938 dead transitions. [2022-12-12 01:54:09,715 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1248 places, 9938 transitions, 186506 flow [2022-12-12 01:54:09,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 916 states. [2022-12-12 01:54:09,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 916 states. [2022-12-12 01:54:09,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 55484 transitions. [2022-12-12 01:54:09,753 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.33651140223192627 [2022-12-12 01:54:09,754 INFO L295 CegarLoopForPetriNet]: 161 programPoint places, 1087 predicate places. [2022-12-12 01:54:09,754 INFO L82 GeneralOperation]: Start removeDead. Operand has 1248 places, 9938 transitions, 186506 flow [2022-12-12 01:54:10,393 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 1089 places, 9458 transitions, 178371 flow [2022-12-12 01:54:10,394 INFO L495 AbstractCegarLoop]: Abstraction has has 1089 places, 9458 transitions, 178371 flow [2022-12-12 01:54:10,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 145 states, 145 states have (on average 57.36551724137931) internal successors, (8318), 145 states have internal predecessors, (8318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 01:54:10,401 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 01:54:10,401 INFO L214 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 01:54:10,407 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-12-12 01:54:10,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-12 01:54:10,607 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 01:54:10,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 01:54:10,607 INFO L85 PathProgramCache]: Analyzing trace with hash -1101701757, now seen corresponding path program 9 times [2022-12-12 01:54:10,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 01:54:10,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276981821] [2022-12-12 01:54:10,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 01:54:10,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 01:54:10,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 01:54:17,425 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 01:54:17,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 01:54:17,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276981821] [2022-12-12 01:54:17,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276981821] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 01:54:17,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [537979408] [2022-12-12 01:54:17,426 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-12 01:54:17,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 01:54:17,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 01:54:17,427 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 01:54:17,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-12 01:54:17,660 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-12-12 01:54:17,660 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 01:54:17,662 INFO L263 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 109 conjunts are in the unsatisfiable core [2022-12-12 01:54:17,666 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 01:54:17,679 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-12 01:54:17,735 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-12 01:54:17,735 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-12-12 01:54:18,060 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-12 01:54:18,061 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-12-12 01:54:18,294 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-12 01:54:18,478 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-12 01:54:18,996 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-12 01:54:19,088 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-12 01:54:22,140 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 01:54:22,140 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 26 [2022-12-12 01:54:22,285 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 2 proven. 81 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-12 01:54:22,285 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 01:54:30,894 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 01:54:30,894 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 1054 treesize of output 479 [2022-12-12 01:54:31,286 INFO L321 Elim1Store]: treesize reduction 5, result has 98.2 percent of original size [2022-12-12 01:54:31,287 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 14 new quantified variables, introduced 28 case distinctions, treesize of input 2584 treesize of output 2423 [2022-12-12 01:54:31,965 INFO L321 Elim1Store]: treesize reduction 12, result has 95.7 percent of original size [2022-12-12 01:54:31,965 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 14 new quantified variables, introduced 28 case distinctions, treesize of input 2104 treesize of output 1696 [2022-12-12 01:54:32,575 INFO L321 Elim1Store]: treesize reduction 12, result has 95.7 percent of original size [2022-12-12 01:54:32,576 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 14 new quantified variables, introduced 28 case distinctions, treesize of input 1200 treesize of output 1152 Received shutdown request... [2022-12-12 01:54:49,600 WARN L249 SmtUtils]: Removed 2 from assertion stack [2022-12-12 01:54:49,602 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-12-12 01:54:49,607 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-12-12 01:54:49,622 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-12 01:54:49,622 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-12 01:54:49,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-12 01:54:49,803 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was analyzing trace of length 191 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 6 for 23ms.. [2022-12-12 01:54:49,804 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2022-12-12 01:54:49,804 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2022-12-12 01:54:49,804 INFO L445 BasicCegarLoop]: Path program histogram: [9, 4, 2, 1, 1] [2022-12-12 01:54:49,807 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-12 01:54:49,807 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-12 01:54:49,810 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.12 01:54:49 BasicIcfg [2022-12-12 01:54:49,810 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-12 01:54:49,810 INFO L158 Benchmark]: Toolchain (without parser) took 755452.41ms. Allocated memory was 174.1MB in the beginning and 2.8GB in the end (delta: 2.7GB). Free memory was 149.3MB in the beginning and 939.3MB in the end (delta: -790.0MB). Peak memory consumption was 2.3GB. Max. memory is 8.0GB. [2022-12-12 01:54:49,811 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 174.1MB. Free memory is still 150.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-12 01:54:49,811 INFO L158 Benchmark]: CACSL2BoogieTranslator took 210.07ms. Allocated memory is still 174.1MB. Free memory was 149.3MB in the beginning and 137.4MB in the end (delta: 11.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-12-12 01:54:49,811 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.31ms. Allocated memory is still 174.1MB. Free memory was 137.4MB in the beginning and 135.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-12 01:54:49,811 INFO L158 Benchmark]: Boogie Preprocessor took 32.14ms. Allocated memory is still 174.1MB. Free memory was 135.3MB in the beginning and 133.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-12 01:54:49,815 INFO L158 Benchmark]: RCFGBuilder took 525.43ms. Allocated memory is still 174.1MB. Free memory was 133.8MB in the beginning and 117.0MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2022-12-12 01:54:49,816 INFO L158 Benchmark]: TraceAbstraction took 754620.20ms. Allocated memory was 174.1MB in the beginning and 2.8GB in the end (delta: 2.7GB). Free memory was 115.4MB in the beginning and 939.3MB in the end (delta: -823.9MB). Peak memory consumption was 2.3GB. Max. memory is 8.0GB. [2022-12-12 01:54:49,820 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.14ms. Allocated memory is still 174.1MB. Free memory is still 150.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 210.07ms. Allocated memory is still 174.1MB. Free memory was 149.3MB in the beginning and 137.4MB in the end (delta: 11.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 57.31ms. Allocated memory is still 174.1MB. Free memory was 137.4MB in the beginning and 135.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 32.14ms. Allocated memory is still 174.1MB. Free memory was 135.3MB in the beginning and 133.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 525.43ms. Allocated memory is still 174.1MB. Free memory was 133.8MB in the beginning and 117.0MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 754620.20ms. Allocated memory was 174.1MB in the beginning and 2.8GB in the end (delta: 2.7GB). Free memory was 115.4MB in the beginning and 939.3MB in the end (delta: -823.9MB). Peak memory consumption was 2.3GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 94]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was analyzing trace of length 191 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 6 for 23ms.. - TimeoutResultAtElement [Line: 88]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was analyzing trace of length 191 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 6 for 23ms.. - TimeoutResultAtElement [Line: 89]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was analyzing trace of length 191 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 6 for 23ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 237 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.1s, RemoveRedundantFlowTime: 1.7s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 754.5s, OverallIterations: 17, TraceHistogramMax: 4, PathProgramHistogramMax: 9, EmptinessCheckTime: 0.0s, AutomataDifference: 471.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 16 mSolverCounterUnknown, 28137 SdHoareTripleChecker+Valid, 94.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 28137 mSDsluCounter, 70789 SdHoareTripleChecker+Invalid, 84.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 6058 IncrementalHoareTripleChecker+Unchecked, 68505 mSDsCounter, 1947 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 131552 IncrementalHoareTripleChecker+Invalid, 139573 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1947 mSolverCounterUnsat, 2284 mSDtfsCounter, 131552 mSolverCounterSat, 0.6s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5275 GetRequests, 2713 SyntacticMatches, 11 SemanticMatches, 2551 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 555481 ImplicationChecksByTransitivity, 323.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=178371occurred in iteration=16, InterpolantAutomatonStates: 2082, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.7s AutomataMinimizationTime, 16 MinimizatonAttempts, 121917 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 237.2s InterpolantComputationTime, 3751 NumberOfCodeBlocks, 3723 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 5218 ConstructedInterpolants, 376 QuantifiedInterpolants, 79949 SizeOfPredicates, 263 NumberOfNonLiveVariables, 2916 ConjunctsInSsa, 394 ConjunctsInUnsatCore, 34 InterpolantComputations, 8 PerfectInterpolantSequences, 288/1391 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown